Abstract
This paper reports on the development of a system that automatically constructs representations of the meaning of sentences using rules of grammar and a dictionary of word meanings. The meanings of words and sentences are expressed using an extension of knowledge graphs, a semantic network formalism. Furthermore the system contains an algorithm that calculates an evaluation measure for alternative sentence graphs of one sentence, making it possible to disambiguate the meaning of sentences on semantical grounds.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mailing list item from the lexical fuctional grammar mailing list. http://clwww.essex.ac.uk/LFG/Burquest/.
L. T. F. Gamut. Logic, Language and Meaning, Intensional logic and logical grammar, volume 2.
C. Hoede and L. Zhang. Word graphs: The third set. Memorandum 1526, University of Twente.
C. Hoede and L. Zhang. Structural parsing. Memorandum 1527, University of Twente, 2000.
D. Reidsma. Juggling word graphs, a method for modeling the meaning of sentences using extended knowledge graphs. Master’s thesis, University of Twente, August 2001.
H. van den Berg. Knowledge Graphs and Logic, One of Two Kinds. PhD thesis, University of Twente, 1993.
M. Willems. Chemistry of Language, a graph-theoretical study of linguistic semantics. PhD thesis, University of Twente, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reidsma, D. (2002). Automatic Generation and Evaluation of Sentence Graphs out of Word Graphs. In: Priss, U., Corbett, D., Angelova, G. (eds) Conceptual Structures: Integration and Interfaces. ICCS 2002. Lecture Notes in Computer Science(), vol 2393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45483-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-45483-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43901-1
Online ISBN: 978-3-540-45483-0
eBook Packages: Springer Book Archive