A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
DIAGRAM: a grammar for dialogues
Communications of the ACM
Logic for Problem Solving
Understanding Natural Language
Understanding Natural Language
The Theory and Practice of Augmented Transition Network Grammars
Natural Language Communication with Computers
Natural Language Communication with Computers
Translating Spanish into logic through logic
Computational Linguistics
Computational Linguistics
Phrase structure trees bear more fruit than you would have thought
Computational Linguistics
From English to logic: context-free computation of "conventional" logical translation
Computational Linguistics
An efficient easily adaptable system for interpreting natural language queries
Computational Linguistics
Design of LMT: a prolog-based machine translation system
Computational Linguistics
Computational Linguistics
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Parsing conjunctions deterministically
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
New approaches to parsing conjunctions using prolog
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Analysis of conjunctions in a rule-based parser
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
When something is missing: ellipsis, coordination and the chart
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Coordination in an Axiomatic Grammar
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Non-constituent coordination: theory and practice
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Coordination in reconnaissance-attack parsing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Constituent coordination in Lexical-Functional Grammar
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Cross-serial dependencies are not hard to process
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Interleaved semantic interpretation in environment-based parsing
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
New approaches to parsing conjunctions using prolog
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Journal of Biomedical Informatics
An abductive treatment of long distance dependencies in CHR
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
| Hi-index | 0.00 |
Logic grammars are grammars expressible in predicate logic. Implemented in the programming language Prolog, logic grammar systems have proved to be a good basis for natural language processing. One of the most difficult constructions for natural language grammars to treat is coordination (construction with conjunctions like 'and'). This paper describes a logic grammar formalism, modifier structure grammars (MSGs), together with an interpreter written in Prolog, which can handle coordination (and other natural language constructions) in a reasonable and general way. The system produces both syntactic analyses and logical forms, and problems of scoping for coordination and quantifiers are dealt with. The MSG formalism seems of interest in its own right (perhaps even outside natural language processing) because the notions of syntactic structure and semantic interpretation are more constrained than in many previous systems (made more implicit in the formalism itself), so that less burden is put on the grammar writer.