Minimalist Grammar Transition-Based Parsing.
LACL(2016)
摘要
Current chart-based parsers of Minimalist Grammars exhibit prohibitively high polynomial complexity that makes them unusable in practice. This paper presents a transition-based parser for Minimalist Grammars that approximately searches through the space of possible derivations by means of beam search, and does so very efficiently: the worst case complexity of building one derivation is $On^2$ and the best case complexity is On. This approximated inference can be guided by a trained probabilistic model that can condition on larger context than standard chart-based parsers. The transitions of the parser are very similar to the transitions of bottom-up shift-reduce parsers for Context-Free Grammars, with additional transitions for online reordering of words during parsing in order to make non-projective derivations projective.
更多查看译文
关键词
Minimalist Grammars,Shift-reduce parsing,Transition-based parsing,Swap transition,Two-stack automata
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络