A Conceptual Graph Approach to the Generation of Referring Expressions

Madalina Croitoru, Kees van Deemter

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of International Joint Conferences on Artificial Intelligence (IJCAI)
Pages2456-2461
Number of pages6
Publication statusPublished - 2007
EventInternational Joint Conference on Artificial Intelligence - Hyderabad, India
Duration: 6 Jan 200712 Jan 2007

Conference

ConferenceInternational Joint Conference on Artificial Intelligence
CountryIndia
CityHyderabad
Period6/01/0712/01/07

Keywords

  • conceptual graphs
  • generation of referring expressions

Cite this

Croitoru, M., & van Deemter, K. (2007). A Conceptual Graph Approach to the Generation of Referring Expressions. In Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI) (pp. 2456-2461)

A Conceptual Graph Approach to the Generation of Referring Expressions. / Croitoru, Madalina; van Deemter, Kees.

Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI). 2007. p. 2456-2461.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Croitoru, M & van Deemter, K 2007, A Conceptual Graph Approach to the Generation of Referring Expressions. in Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI). pp. 2456-2461, International Joint Conference on Artificial Intelligence, Hyderabad, India, 6/01/07.
Croitoru M, van Deemter K. A Conceptual Graph Approach to the Generation of Referring Expressions. In Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI). 2007. p. 2456-2461
Croitoru, Madalina ; van Deemter, Kees. / A Conceptual Graph Approach to the Generation of Referring Expressions. Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI). 2007. pp. 2456-2461
@inproceedings{72f40a9aa8b1431ca2bc548cd48f34c9,
title = "A Conceptual Graph Approach to the Generation of Referring Expressions",
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.",
keywords = "conceptual graphs, generation of referring expressions",
author = "Madalina Croitoru and {van Deemter}, Kees",
year = "2007",
language = "English",
pages = "2456--2461",
booktitle = "Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI)",

}

TY - GEN

T1 - A Conceptual Graph Approach to the Generation of Referring Expressions

AU - Croitoru, Madalina

AU - van Deemter, Kees

PY - 2007

Y1 - 2007

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

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

KW - conceptual graphs

KW - generation of referring expressions

M3 - Conference contribution

SP - 2456

EP - 2461

BT - Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI)

ER -