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 “5 Discussion” · whole deck
5 Discussion
- What is the main limitation of the MST parsing framework?It requires tree scores that decompose over single edges. Extending it to features of larger substructures would make the search for the best non-projective tree intractable.
- 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)), §5, pp. 529–530
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/