Abstract
This paper presents a Conceptual Graph (CG) framework to the Generation of Referring Expressions (GRE). Employing Conceptual Graphs as the underlying formalism allows a rigorous, semantically rich, approach to GRE. A number of advantages over existing work are discussed. The new framework is also used to revisit existing complexity results in a fully rigorous way, showing that the expressive power of CGs does not increase the theoretical complexity of GRE.
Original language | English |
---|---|
Title of host publication | Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI) |
Pages | 2456-2461 |
Number of pages | 6 |
Publication status | Published - 2007 |
Event | International Joint Conference on Artificial Intelligence - Hyderabad, India Duration: 6 Jan 2007 → 12 Jan 2007 |
Conference
Conference | International Joint Conference on Artificial Intelligence |
---|---|
Country/Territory | India |
City | Hyderabad |
Period | 6/01/07 → 12/01/07 |
Keywords
- conceptual graphs
- generation of referring expressions