Viewing parsing as word sense discrimination: a connectionist approach
Computational models of natural language processing
Linguistic and extra-linguistic knowledge
Computers and Translation
Principles of artificial intelligence
Principles of artificial intelligence
DIAGRAM: a grammar for dialogues
Communications of the ACM
An intelligent analyzer and understander of English
Communications of the ACM
Disambiguating grammatically ambiguous sentences by asking
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Experience with an easily computed metric for ranking alternative parsess
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Towards convenient bi-directional grammar formalisms
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
The disambiguation of sentences is a combinatorial problem. This paper describes a method for treating it as such, directly, by adapting standard combinatorial search optimizations. Traditional disambiguation heuristics are applied but, instead of being embedded in individual decision procedures for specific types of ambiguities, they contribute to numerical weights that are considered by a single global optimizer. The result is increased power and simpler code. The method is being implemented for a machine translation project, but could be adapted to any natural language system.