A System for the Semantic Interpretation of Unrestricted Domains
Fernando Gómez, Carlos Segami · 1999
In this demonstration, we show an algorithm for the semantic interpretation of unrestricted texts. The algorithm presents a solution for the following interpretation problems: determination of the meaning of the verb, identification of thematic roles and adjuncts, and attachments of prepositional phrases (PPs). An interesting aspect of the algorithm is that the solution of all these problems is interdependent. The interpretation algorithm uses WordNet (Miller et al. 1993) as its lexical knowledge-base. Predicates, or verbal concepts, have been defined for WordNet verb classes (Fellbaum 1993), which have been reorganized considerably following the criteria imposed by the interpretation algorithm. The WordNet ontology for nouns has also undergone some reorganization and redefinition to conform with the entries in the thematic roles of the predicates. We have taken a top-down approach that defines generic