Non-projective Dependency Parsing using Spanning Tree Algorithms
McDonald et al., 2005, Non-projective Dependency Parsing using Spanning Tree Algorithms (Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP 2005))
Subscriber deck — free during early access
1 cards in “4 Experiments” · whole deck
4 Experiments
- On what data did McDonald et al. evaluate non-projective MST parsing, and how non-projective is it?The Czech Prague Dependency Treebank, with automatic POS tags reduced to Collins et al.’s (1999) tag set and about 13.5M features. About 23% of sentences have at least one non-projective dependency, but fewer than 2% of edges are non-projective; Czech-B contains only those 23% of sentences.
- McDonald et al., 2005, Non-projective Dependency Parsing using Spanning Tree Algorithms (Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP 2005)), §4, p. 528
Source
- Ryan McDonald, Fernando Pereira, Kiril Ribarov and Jan Hajič. 2005. Non-projective Dependency Parsing using Spanning Tree Algorithms. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP 2005), pp. 523–530. https://aclanthology.org/H05-1066/