Mova0.5 pre-release⌕
☰
home / docs / papers / English / Tokenizing, POS Tagging, Lemmatizing and Parsing UD 2.0 with UDPipe

Tokenizing, POS Tagging, Lemmatizing and Parsing UD 2.0 with UDPipe

What it is about

The paper describes UDPipe 1.1 (the shared-task baseline) and UDPipe 1.2 (the participant system, which placed 8th of 33). Tokenisation and sentence splitting come from one character-level GRU; multi-word tokens are split by a dictionary plus suffix rules; the tagger uses a suffix-based morphological guesser with an averaged perceptron; lemmas are chosen as separate rules by a second tagger; and the parser is the transition-based Parsito with a search-based oracle and a default beam of 5. Tuning steps that helped include a larger tokenizer (dimension 24 to 64) for hard tokenisation, adding other treebanks of the same language to small training sets, and joint segmentation with parsing for three treebanks that lack punctuation. The search-based oracle raises the arc-standard static-oracle LAS from 68.27 to 68.87 on the authors' data. The full model has a median size of about 13 MB and runs at about 1,700 words per second on one CPU core.

Ideas

For Mova

The ideas touch the tokenizer en/src/tok.rs, the parser en/src/parse.rs and the lexicon in en/src/morph.rs, and they use en parse-eval, en ud-eval and the ATIS data. The chapters are languages/en/07-punctuation-capitals-numbers (contractions, spacing) and languages/en/19-lexicon-mwe-register (multi-word tokens). Measure first I2, because a change to the oracle is cheap to test and the paper reports a clear gain for it.

Topics: Dependency parsing · Universal Dependencies · Treebanks · Part-of-speech tagging

Cite

The paper itself, not this card. BibTeX from the library's record of the work. DOI 10.18653/v1/k17-3009

@inproceedings{straka2017tokenizing,
  title = {{Tokenizing, POS Tagging, Lemmatizing and Parsing UD 2.0 with UDPipe}},
  author = {Straka, Milan and Straková, Jana},
  booktitle = {Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies},
  year = {2017},
  doi = {10.18653/v1/k17-3009},
  url = {https://doi.org/10.18653/v1/k17-3009}
}

References

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

  1. Daniel Andor, Chris Alberti, David Weiss, Aliaksei Severyn, Alessandro Presta, Kuzman Ganchev, Slav Petrov, and Michael Collins. 2016. Glob-aly normalized transition-based neural networks. In Association for Computational Linguistic. http://arxiv.org/abs/1603.06042. ↗

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/ud-2017-straka-tokenizing-pos-tagging-lemmatizing-parsing/