A System for the Semantic Interpretation of Unrestricted Domains using WordNet

Fernando Gomez, University of Central Florida and Carlos Segami, Barry University

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


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.