Resolving Noun Compounds With Multi-Use Domain Knowledge

Alicia Tribble, Scott E. Fahlman

In this paper we describe a system for semantic interpretation of noun compounds that relies on world and domain knowledge from a knowledge base. This architecture combines domain-independent compounding rules with a task-independent knowledge representation, allowing both components to be flexibly reused. We present examples from Scientific American text, on which the system was developed, and then describe an exercise that tests the portability of the architecture to a new domain: email text on the topic of conference planning.

Subjects: 13. Natural Language Processing; 11. Knowledge Representation

Submitted: Feb 13, 2006

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.