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 “3.2 Factored MIRA” · whole deck
3.2 Factored MIRA
- What is factored MIRA?It factors the exponentially many tree constraints into \(O(n^2)\) local ones: for each word \(x_j\), the correct incoming edge must beat every other incoming edge by 1, \(s(l, j) - s(k, j) \ge 1\) for \((l, j) \in y_t\), \((k, j) \notin y_t\). Then the correct tree beats any other tree by at least its number of wrong edges. These constraints are stricter than the originals.
- 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)), §3.2, 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/