An English language question answering system for a large relational database
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Cooperative responses from a portable natural language data base query system.
Cooperative responses from a portable natural language data base query system.
Subjective understanding: computer models of belief systems.
Subjective understanding: computer models of belief systems.
A parsing algorithm that extends phrases
Computational Linguistics
Responding intelligently to unparsable inputs
Computational Linguistics
Towards a self-extending parser
ACL '79 Proceedings of the 17th annual meeting on Association for Computational Linguistics
Integrated processing produces robust understanding
Computational Linguistics
Processing dictionary definitions with phrasal pattern hierarchies
Computational Linguistics - Special issue of the lexicon
Composite document extended retrieval: an overview
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Talking to UNIX in English: an overview of UC
Communications of the ACM
The pragmatics of referring and the modality of communication
Computational Linguistics
The fitted parse: 100% parsing capability in a syntactic grammar of English
ANLC '83 Proceedings of the first conference on Applied natural language processing
A status report on the LRC machine
ANLC '83 Proceedings of the first conference on Applied natural language processing
How to detect grammatical errors in a text without parsing it
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A robust parser based on syntactic information
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Recovery strategies for parsing extragrammatical language
Computational Linguistics - Special issue on ill-formed input
Parse fitting and prose fixing: getting a hold on ill-formedness
Computational Linguistics - Special issue on ill-formed input
Computational Linguistics - Special issue on ill-formed input
WEDNESDAY: parsing flexible word order languages
EACL '83 Proceedings of the first conference on European chapter of the Association for Computational Linguistics
Limited domain systems for language teaching
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Coping with extragrammaticality
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
From HOPE en l'ESPERANCE: on the role of computational neurolinguistics in cross-language studies
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Robust processing in Machine Translation
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Deterministic parsing of syntactic non-fluencies
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Schema method: a framework for correcting grammatically ill-formed input
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The typology of unknown words: an experimental study of two corpora
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
GramCheck: a grammar and style checker
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
A portable approach to last resort parsing and interpretation
HLT '93 Proceedings of the workshop on Human Language Technology
The LRC machine translation system
Computational Linguistics - Special issue on machine translation
| Hi-index | 0.02 |
When people use natural language in natural settings, they often use it ungrammatically, leaving out or repeating words, breaking off and restarting, speaking in fragments, etc. Their human listeners are usually able to cope with these deviations with little difficulty. If a computer system is to accept natural language input from its users on a routine basis, it should be similarly robust. In this paper, we outline a set of parsing flexibilities that such a system should provide. We go on to describe FlexP, a bottom-up pattern matching parser that we have designed and implemented to provide many of these flexibilities for restricted natural language input to a limited-domain computer system.