Transforming syntactic graphs into semantic graphs

Authors:
Hae-Chang Rim;Jungyun Seo;Robert F. Simmons
Affiliations:
University of Texas at Austin, Austin, Texas;University of Texas at Austin, Austin, Texas;University of Texas at Austin, Austin, Texas
Venue:
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Year:
1990

Citing 6
Cited 0

Semantic interpretation and the resolution of ambiguity

Semantic interpretation and the resolution of ambiguity
Syntactic graphs: a representation for the union of all ambiguous parse trees

Computational Linguistics
An efficient context-free parsing algorithm

Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Theory of Syntactic Recognition for Natural Languages

Theory of Syntactic Recognition for Natural Languages
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a computational method for transforming a syntactic graph, which represents all syntactic interpretations of a sentence, into a semantic graph which filters out certain interpretations, but also incorporates any remaining ambiguities. We argue that the resulting ambiguous graph, supported by an exclusion matrix, is a useful data structure for question answering and other semantic processing. Our research is based on the principle that ambiguity is an inherent aspect of natural language communication.