User:AryamanA/Transition-based parsing
Transition-based parsing is an algorithmic paradigm in the field of computational linguistics for learning automatic parsers for dependency grammars, including for syntactic and semantic parsing. It extends on shift-reduce parsing, but adapted to the complexities of parsing natural language. Several algorithms exist in this family, all sharing the fundamental approach of building up the parse tree step-by-step by parsing tokens from left to right.
Transition-based parsing was first proposed by Joakim Nivre in 2003.[1] His original algorithm only supported projective dependency trees, and is now referred to as the arc-standard algorithm.
References
- ^ Nivre, Joakim (2003). An Efficient Algorithm for Projective Dependency Parsing. Proceedings of the Eighth International Conference on Parsing Technologies. pp. 149–160.