Лес разбора
Related Papers
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language ana- lyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by …...
Non-deterministic Recursive Ascent Parsing
A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a generalization of the recursive descent parser. For non-LR grammars the time-complexity …...
Preserving Semantic Dependencies in Synchronous Tree Adjoining Grammar
Rambow, Wier and Vijay-Shanker (Rainbow et al., 1995) point out the differences between TAG derivation structures and semantic or predicate- argument dependencies, and Joshi and Vijay- Shanker (Joshi and Vijay-Shanker, …...
Ambiguity-aware Ensemble Training for Semi-supervised Dependency Parsing
This paper proposes a simple yet effective framework for semi-supervised dependency parsing at entire tree level, referred to as ambiguity-aware ensemble training. Instead of only using 1- best parse trees …...