Theoretical Computer Science
Extending definite clause grammars with scoping constructs
Logic programming
Communications of the ACM
Logic programming for processing natural language (tutorial)
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Logic for Problem Solving
Natural Language Communication with Computers
Decidability of Linear Affine Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Anaphoric dependencies in ellipsis
Computational Linguistics
Treating coordination in logic grammars
Computational Linguistics
Some uses of higher-order logic in computational linguistics
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Priority union and generalization in discourse grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Informed parsing for coordination with combinatory categorial grammar
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
| Hi-index | 0.00 |
We present a logic programming parsing methodology which we believe especially interesting for understanding implicit human-language structures. It records parsing state constituents through linear assumptions to be consumed as the corresponding constituents materialize throughout the computation. Parsing state symbols corresponding to implicit structures remain as undischarged assumptions, rather than blocking the computation as they would if they were subgoals in a query. They can then be used to glean the meaning of elided structures, with the aid of parallel structures. Word ordering inferences are made not from symbol contiguity as in DCGs, but from invisibly handling numbered edges as parameters of each symbol. We illustrate our ideas through a metagrammatical treatment of coordination, which shows that the proposed methodology can be used to detect and resolve parallel structures through syntactic and semantic criteria.