Elamur Research
☰
home / papers / 2018 / Towards JointUD: Part-of-speech Tagging and Lemmatization using Recurrent Neural Networks

Towards JointUD: Part-of-speech Tagging and Lemmatization using Recurrent Neural Networks

What it is about

The team's shared-task system uses one LSTM network, trained jointly to output UPOS tags, morphological features and lemmas. Lemmas are produced at character level, which extends a sequence-tagging network. Sentence segmentation, tokenization and dependency parsing come from the UDPipe 1.2 baseline. The model is validated on nine UD v2.2 treebanks, including English EWT and GUM. The authors report that the results are generally not better than the UDPipe baseline, and that the network was not tuned heavily. The work is a first step towards a network that outputs all UD labels.

Ideas

For Mova

The code is en/src/morph.rs and en/src/ptag.rs; the chapters are languages/en/06-spelling-rules.md, 11-nouns.md and 13-verbs.md. The paper's lemma accuracy is on UD v2.2, not our UD 2.18, and our dictionary lemmatizer is already at 99.3 to 99.5%, so any gain is in the unknown forms.

Library summary

The Research library's own summary of the paper, in our words — not the paper's text.

Written by Mova (claude-opus-5-5) from the paper text. Original — aclanthology.org/K18-2018.pdf

Summary

The YerevaNN team describes its participation in the CoNLL 2018 UD Shared Task under the name ArmParser. This is the first stage of the JointUD project, a single multi-task neural network intended to predict all annotations of a UD treebank from tokenized text. In this work, one model simultaneously learns to determine the part of speech, morphological features and lemma of each word. The basis is the BiLSTM tagger of Reimers and Gurevych (2017). The main innovation is character-level GRU decoders that generate lemmas. Sentence segmentation, tokenization and syntactic parsing are left to UDPipe 1.2. The architecture was tested on nine UD v2.2 treebanks. For the most part, the results are not better than the UDPipe baseline. For Arabic and Korean, the lemmatizer generalizes poorly. Nevertheless, the experiments show that joint training of tagging and lemmatization in a single network is feasible. Of practical value are the open-source code and the observations on what to feed into the decoder and how to weight the individual loss functions.

Key points

  • Word representation (358 dimensions): a 300-dimensional FastText vector, a one-hot vector of 8 casing features, and a character-level BiLSTM (2×25). On top of them are three LSTM layers of 150 dimensions each with 50% dropout.
  • Lemmatization: each word has its own GRU decoder, and all decoders share weights. At each step, the decoder receives the contextual representation of the word, the character embedding, the number of characters remaining until the end of the word, and the previous character of the lemma. Thanks to the contextual representation and positional encoding, English lemmas improved noticeably. For example, the model stopped truncating words at an "s" in the middle.
  • Loss function: a weighted sum of cross-entropies for POS, 21 morphological features and the lemma. The POS term dominated the others, so its weight was reduced to λ = 0.2, which improved lemma generation.
  • Implementation: Keras, code at github.com/YerevaNN/JointUD. Lemmatization slows training down by more than a factor of three. Models were trained for only nine treebanks (including three English and two French ones), and for the remaining languages the UDPipe output was submitted.
  • Issue with the official run: the version on TIRA had a bug that duplicated newline characters, which broke sentence segmentation. After the deadline, the same models were re-evaluated locally without this bug.

Topics: Part-of-speech tagging

Cite

The paper itself, not this card. BibTeX from the library's record of the work. DOI 10.18653/v1/k18-2018 · arXiv 1809.03211

@inproceedings{arakelyan2018jointud,
  title = {{Towards JointUD: Part-of-speech Tagging and Lemmatization using Recurrent Neural Networks}},
  author = {Arakelyan, Gor and Hambardzumyan, Karen and Khachatrian, Hrant},
  booktitle = {Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies},
  year = {2018},
  doi = {10.18653/v1/k18-2018},
  eprint = {1809.03211},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.18653/v1/k18-2018}
}

References

14 references, 4 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2017. Enriching word vectors with subword information. Transactions of the Association for Computational Linguistics 5:135–146. find
  2. Dat Quoc Nguyen, Mark Dras, and Mark Johnson. 2017. A novel neural network model for joint pos tagging and graph-based dependency parsing. In Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. Association for Computational Linguistics, Vancouver,… find
  3. Danqi Chen and Christopher Manning. 2014. A fast and accurate dependency parser using neural networks. In Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP). pages 740–750. find our card
  4. Jason P.C. Chiu and Eric Nichols. 2016. Named Joakim Nivre, Marie-Catherine de Marneffe, Filip Gin-entity recognition with bidirectional lstm-ter, Yoav Goldberg, Jan Hajič, Christopher Man-cnns. Transactions of the Association ning, Ryan McDonald, Slav Petrov, Sampo Pyysalo, for Computational Lingu… find our card
  5. European Language Re-Schwenk, and Yoshua Bengio. 2014. Learning sources Association, Portoro, Slovenia, pages 1659– phrase representations using rnn encoder–decoder 1666. for statistical machine translation. In Proceedings of Joakim Nivre et al. 2018. Universal Dependencies 2.2. LINDAT/CLARIN digita… find
  6. Slav Petrov. 2018b. CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. In Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. Association for Computational Linguistics, Brussels, Belgium, pages 1–20. find our card
  7. Martin Potthast, Tim Gollub, Francisco Rangel, Paolo Rosso, Efstathios Stamatatos, and Benno Stein. 2014. Improving the reproducibility of PAN’s shared tasks: Plagiarism detection, author identification, and author profiling. In Evangelos Kanoulas, Mihai Lupu, Paul Clough, Mark Sander-son, Mark Hall… — [doi:10.1007/978-3-319-11382-1](https://doi.org/10.1007/978-3-319-11382-1) find
  8. Nils Reimers and Iryna Gurevych. 2017. Reporting Score Distributions Makes a Difference: Performance Study of LSTM-networks for Sequence Tagging. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing (EMNLP). Copenhagen, Denmark, pages 338–348. http://aclweb.org/a… ↗ our card
  9. Milan Straka, Jan Hajič, and Jana Straková. 2016. UD-Pipe: trainable pipeline for processing CoNLL-U files performing tokenization, morphological analysis, POS tagging and parsing. In Proceedings of the 10th International Conference on Language Resources and Evaluation (LREC 2016). European Langua… find
  10. Emma Strubell, Patrick Verga, David Belanger, and Andrew McCallum. 2017. Fast and accurate entity recognition with iterated dilated convolutions. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing. pages 2670–2680. find
  11. Sainbayar Sukhbaatar, Jason Weston, Rob Fergus, et al. 2015. End-to-end memory networks. In Advances in neural information processing systems. pages 2440–2448. find
  12. Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in Neural Information Processing Systems. pages 5998–6008. find
  13. Dan Zeman et al. 2018a. Universal Dependencies 2.2 CoNLL 2018 shared task development and test data. LINDAT/CLARIN digital library at the Institute of Formal and Applied Linguistics, Charles University, Prague, http://hdl.handle.net/ 11234/1-2184. http://hdl.handle.net/11234/1-2184. ↗
  14. Daniel Zeman, Jan Hajič, Martin Popel, Martin Potthast, Milan Straka, Filip Ginter, Joakim Nivre, and find