An intelligent analyzer and understander of English
Communications of the ACM
Augmented phrase structure grammars
TINLAP '75 Proceedings of the 1975 workshop on Theoretical issues in natural language processing
Anaphora resolution in slot grammar
Computational Linguistics
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
The fitted parse: 100% parsing capability in a syntactic grammar of English
ANLC '83 Proceedings of the first conference on Applied natural language processing
The experience of developing a large-scale natural language text processing system: CRITIQUE
ANLC '88 Proceedings of the second conference on Applied natural language processing
ANLC '88 Proceedings of the second conference on Applied natural language processing
Parse fitting and prose fixing: getting a hold on ill-formedness
Computational Linguistics - Special issue on ill-formed input
"Natural language texts are not necessarily grammatical and unambiguous of even complete."
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
A syntactic filter on pronominal anaphora for Slot Grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
A prototype English-Japanese machine translation system for translating IBM computer manuals
COLING '86 Proceedings of the 11th coference on Computational linguistics
Improving search strategies: an experiment in best-first parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Schema method: a framework for correcting grammatically ill-formed input
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Heuristics for broad-coverage natural language parsing
HLT '93 Proceedings of the workshop on Human Language Technology
The EPISTLE text-critiquing system
IBM Systems Journal
Rediscovering ACL discoveries through the lens of ACL anthology network citing sentences
ACL '12 Proceedings of the ACL-2012 Special Workshop on Rediscovering 50 Years of Discoveries
| Hi-index | 0.00 |
This brief paper, which is itself an extended abstract for a forthcoming paper, describes a metric that can be easily computed during either bottom-up or top-down construction of a parse tree for ranking the desirability of alternative parses. In its simplest form, the metric tends to prefer trees in which constituents are pushed as far down as possible, but by appropriate modification of a constant in the formula other behavior can be obtained also. This paper includes in introduction to the EPISTLE system being developed at IBM Research and a discussion of the results of using this metric with that system.