A template matcher for robust NL interpretation
HLT '91 Proceedings of the workshop on Speech and Natural Language
SRI's experience with the ATIS evaluation
HLT '90 Proceedings of the workshop on Speech and Natural Language
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
A template matcher for robust NL interpretation
HLT '91 Proceedings of the workshop on Speech and Natural Language
Robust processing of real-world natural-language texts
ANLC '92 Proceedings of the third conference on Applied natural language processing
Gemini: a natural language system for spoken-language understanding
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Interleaving syntax and semantics in an efficient bottom-up parser
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
Efficiency, robustness and accuracy in Picky chart parsing
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Probabilistic prediction and Picky chart parsing
HLT '91 Proceedings of the workshop on Speech and Natural Language
Automatic detection and correction of repairs in human-computer dialog
HLT '91 Proceedings of the workshop on Speech and Natural Language
Gemini: a natural language system for spoken-language understanding
HLT '93 Proceedings of the workshop on Human Language Technology
Efficient large-scale parsing: a survey
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
| Hi-index | 0.00 |
This paper describes a series of experiments aimed at producing a bottom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first attempt, ending with a system that was twice as fast as our previous parser, which relied on strong top-down constraints. The major algorithmic variations we tried are described along with the corresponding performance results.