The logic of typed feature structures
The logic of typed feature structures
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
An efficient context-free parsing algorithm
Communications of the ACM
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
From datalog rules to efficient programs with time and space guarantees
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Relating tabular parsing algorithms for LIG and TAG
New developments in parsing technology
Inductive Dependency Parsing (Text, Speech and Language Technology)
Inductive Dependency Parsing (Text, Speech and Language Technology)
Dyna: a declarative language for implementing dynamic programs
ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
Compiling Declarative Specifications of Parsing Algorithms
DEXA '07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Deterministic left corner parsing
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Generating XTAG parsers from algebraic specifications
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
A General Method for Transforming Standard Parsers into Error-Repair Parsers
CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
Theoretical Computer Science
Dependency parsing schemata and mildly non-projective dependency parsing
Computational Linguistics
| Hi-index | 0.00 |
We present a compiler that can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and to ensure that the generated implementations are efficient. The system described is general enough to be able to handle all kinds of schemata for different grammar formalisms, such as context-free grammars and tree-adjoining grammars, and it provides an extensibility mechanism allowing the user to define custom notational elements. This compiler has proven very useful for analyzing, prototyping and comparing natural-language parsers in real domains, as can be seen in the empirical examples provided at the end of the paper. Copyright © 2008 John Wiley & Sons, Ltd.