Transition network grammars for natural language analysis
Communications of the ACM
Meta-rules as a basis for processing ill-formed input
Computational Linguistics - Special issue on ill-formed input
Some chart-based techniques for parsing ill-formed input
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A parser coping with self-repaired Japanese utterances and large corpus-based evaluation
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Reversible delayed lexical choice in a bidirectional framework
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Lenient default unification for robust processing within unification based grammar formalisms
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
This paper describes an integrated method for processing grammatically ill formed inputs. We use partial parses of the input for recovering from parsing failure. In order to select partial parses appropriate for error recovery, cost and reward are assigned to them Cost and reward represent the badness and goodness of a partial parse, respectively. The most appropriate partial parse is selected on the basis of cost and reward trade off. The system contains three modules Module A handles local ill-formedness such as constraint violations Module B handles non-local ill formedness such as word order violations, and Module C handles non-local ill-formedness such as contextual ellipses. These three modules work in a uniform framework based on the notions of cost and reward.