Computer interpretation of natural language descriptions
Computer interpretation of natural language descriptions
Prolog and natural-language analysis
Prolog and natural-language analysis
Artificial intelligence (2nd ed.)
Artificial intelligence (2nd ed.)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Proceedings of the first international conference on Principles of knowledge representation and reasoning
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Understanding Natural Language
Understanding Natural Language
Computational Complexity and Natural Language
Computational Complexity and Natural Language
From English to logic: context-free computation of "conventional" logical translation
Computational Linguistics
Bound variables and other anaphors
TINLAP '78 Proceedings of the 1978 workshop on Theoretical issues in natural language processing
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper investigates a problem of natural language processing from the perspective of reasoning work on constraint satisfaction. We formulate the task of computing singular, definite reference to a known contextual entity as a constraint satisfaction problem. We argue that such referential constraint problems have a structure which is often simpler than the general case, and can therefore often be solved by the sole use of low-power network consistency techniques. To illustrate, we define a linguistic fragment which provably generates tree-structured constraint problems. This enables us to conclude that the limited operation of strong arc consistency is sufficient to resolve the class of noun phrase defined by the fragment.