Normalization of Semantic Graphs

  • Frédérique Segond
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 196)


At the level of semantic relations, we are interested in finding the semantic links hidden in the syntax of a sentence. This involves, among other things, normalizing semantic structures across a wide range of paraphrases. The goal is achieved by taking the output of the preceding analysis components and modifying it with a “concept grammar,” written in PLNLP. The rules of this grammar are similar in form to the rules of preceding components; but they operate on different aspects of the common information structure, analyzing the relations between nodes in the sentence graph, and normalizing semantic structures and lexical relationships in a variety of syntactic domains, without losing access to the surface syntactic differences. This chapter shows how, starting from the argument structure output from PEGASUS, the concept grammar produces semantic graphs that preserve the broad-coverage, broad-domain characteristics of the entire system.


Semantic Relation Relative Clause Semantic Structure Conceptual Graph Semantic Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1993

Authors and Affiliations

  • Frédérique Segond

There are no affiliations available

Personalised recommendations