ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Logical Grammars Based on Constraint Handling Rules
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Parsing Ill-Formed Inputs with Constraint Graphs
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
CHRv: A Flexible Query Language
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Anaphoric dependencies in ellipsis
Computational Linguistics
Treating coordination in logic grammars
Computational Linguistics
Non-constituent coordination: theory and practice
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Informed parsing for coordination with combinatory categorial grammar
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We propose a CHR treatment for long distance dependencies which abduces the missing elements while relating the constituents that must be related. We discuss our ideas both from a classical analysis point of view, and from a property-grammar based perspective. We exemplify them through relative clauses first, and next through the more challenging case of natural language coordination. We present an abductive rule schema for conjunction from which appropriate rule instances materialize through the normal process of unification in a given sentence's parse, and which fills in (abduces) any information that may be missing in one conjunct through semantic and syntactic information found in the other. Thus semantic criteria, which in most previous approaches was understressed in favour of syntactic criteria, regains its due importance, within our encompassing while retaining economic abductive formulation.