TINA: a natural language system for spoken language applications
Computational Linguistics
Natural language understanding (2nd ed.)
Natural language understanding (2nd ed.)
Conversation machines for transaction processing
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A minimum description length approach to grammar inference
Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing
Expressive power of grammatical formalisms
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
| Hi-index | 0.00 |
We present an algorithm and a tool for automatically revising grammars for natural language processing (NLP) systems to disallow specifically identified sentences or sets of sentences. We also outline an approach for automatically revising attribute value grammars using counter-examples. Developing grammars for NLP systems that are both general enough to accept most sentences about a domain, but constrained enough to disallow other sentences is very tedious. Our approach of revising grammars automatically using counter-examples greatly simplifies the development and revision of tightly constrained grammars. We have successfully used our tool to constrain over-generalizing grammars of speech understanding systems and obtained higher recognition accuracy.