Procedure for quantitatively comparing the syntactic coverage of English grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
Handbook of formal languages, vol. 3
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Parsing with Principles and Classes of Information
Parsing with Principles and Classes of Information
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing
Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
Three generative, lexicalised models for statistical parsing
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
An alternative LR algorithm for TAGS
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Sentence disambiguation by a shift-reduce parsing technique
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Tree-gram parsing lexical dependencies and structural relations
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Statistical parsing with an automatically-extracted tree adjoining grammar
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
An efficient LR parser generator for tree-adjoining grammars
New developments in parsing technology
| Hi-index | 0.00 |
We describe an LR parser of parts-of-speech (and punctuation labels) for Tree Adjoining Grammars (TAGs), that solves table conflicts in a greedy way, with limited amount of backtracking. We evaluate the parser using the Penn Treebank showing that the method yield very fast parsers with at least reasonable accuracy, confirming the intuition that LR parsing benefits from the use of rich grammars.