Interleaved semantic interpretation in environment-based parsing

Authors:
William Schuler
Affiliations:
University of Pennsylvania, Philadelphia, PA
Venue:
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Year:
2002

Citing 5
Cited 1

Semiring parsing

Computational Linguistics
Treating coordination in logic grammars

Computational Linguistics
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Interleaving syntax and semantics in an efficient bottom-up parser

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Computational properties of environment-based disambiguation

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics

Incremental parsing with reference interaction

IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends a polynomial-time parsing algorithm that resolves structural ambiguity in input sentences by calculating and comparing the denotations of rival constituents, given some model of the application environment (Schuler, 2001). The algorithm is extended to incorporate a full set of logical operators, including quantifiers and conjunctions, into this calculation without increasing the complexity of the overall algorithm beyond polynomial time, both in terms of the length of the input and the number of entities in the environment model.