An efficient augmented-context-free parsing algorithm
Computational Linguistics
Prolog and natural-language analysis
Prolog and natural-language analysis
Semantic-head-driven generation
Computational Linguistics
Communications of the ACM
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Bidirectional parsing of lexicalized tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Head corner parsing for discontinuous constituency
ACL '91 Proceedings of the 29th 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
Memoization of coroutined constraints
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
An extended theory of head-driven parsing
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Nonminimal derivations in unification-based parsing
Computational Linguistics
Introduction to this Special Issue
Natural Language Engineering
Parser engineering and performance profiling
Natural Language Engineering
Robust grammatical analysis for spoken dialogue systems
Natural Language Engineering
Left-to-right parsing and bilexical context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
A framework for robust semantic interpretation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Finite-state approximation of constraint-based grammars using left-corner grammar transforms
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Know when to hold 'em: shuffling deterministically in a parser for nonconcatenative grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Compact non-left-recursive grammars using the selective left-corner transform and factoring
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A tabulation-based parsing method that reduces copying
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Optimal ambiguity packing in context-free parsers with interleaved unification
New developments in parsing technology
Measure for measure: towards increased component comparability and exchange
New developments in parsing technology
An efficient incremental architecture for robust interpretation
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Exploiting the student model to emphasize language teaching pedagogy in natural language processing
ASSESSEVALNLP '99 Proceedings of a Symposium on Computer Mediated Language Assessment and Evaluation in Natural Language Processing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Are very large context-free grammars tractable?
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Backbone extraction and pruning for speeding up a deep parser for dialogue systems
ScaNaLU '06 Proceedings of the Third Workshop on Scalable Natural Language Understanding
Grammatical analysis in the OVIS spoken-dialogue system
ISDS '97 Interactive Spoken Dialog Systems on Bringing Speech and NLP Together in Real Applications
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Constraining robust constructions for broad-coverage parsing with precision grammars
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Efficient large-scale parsing: a survey
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper describes an efficient and robust implementation of a bidirectional, head-driven parser for constraint-based grammars. This parser is developed for the OVIS system: a Dutch spoken dialogue system in which information about public transport can be obtained by telephone.After a review of the motivation for head-driven parsing strategies, and head-corner parsing in particular, a nondeterministic version of the head-corner parser is presented. A memorization technique is applied to obtain a fast parser. A goal-weakening technique is introduced, which greatly improves average case efficiency, both in terms of speed and space requirements.I argue in favor of such a memorization strategy with goal-weakening in comparison with ordinary chart parsers because such a strategy can be applied selectively and therefore enormously reduces the space requirements of the parser, while no practical loss in time-efficiency is observed. On the contrary, experiments are described in which head-corner and left-corner parsers implemented with selective memorization and goal weakening outperform "standard" chart parsers. The experiments include the grammar of the OVIS system and the Alvey NL Tools grammar.Head-corner parsing is a mix of bottom-up and top-down processing. Certain approaches to robust parsing require purely bottom-up processing. Therefore, it seems that head-corner parsing is unsuitable for such robust parsing techniques. However, it is shown how underspecification (which arises very naturally in a logic programming environment) can be used in the head-corner parser to allow such robust parsing techniques. A particular robust parsing model, implemented in OVIS, is described.