A System for the Semantic Interpretation of Unrestricted Domains using WordNet

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).

Authors

• Fernando Gomez University of Central Florida
• University of Central Florida
• Carlos Segami
• Barry University

Keywords

No keywords are indexed for this paper.