Term Indexing
PROLOG and Natural Language Analysis
PROLOG and Natural Language Analysis
An efficient implementation of the head-corner parser
Computational Linguistics
Efficient feature structure operations without compilation
Natural Language Engineering
Parser engineering and performance profiling
Natural Language Engineering
A simple transformation for offline-parsable grammars and its termination properties
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
An indexing scheme for typed feature structures
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
Optimizing typed feature structure grammar parsing through non-statistical indexing
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Efficient matrix-encoded grammars and low latency parallelization strategies for CYK
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) per edge. It has applications to unification-based grammars with very large partially ordered categories, in which copying is expensive, and can facilitate the use of more sophisticated indexing strategies for retrieving such categories that may otherwise be overwhelmed by the cost of such copying. It also provides a new perspective on "quick-checking" and related heuristics, which seems to confirm that forcing an early failure (as opposed to seeking an early guarantee of success) is in fact the best approach to use. A preliminary empirical evaluation of its performance is also provided.