This paper presents a Conceptual Graph (CG) framework to the Generation of Referring Expressions (GRE). Employing Conceptual Graphs as the underlying formalism allows a new rigorous, semantically rich, approach to GRE: the intended referent is indentified by a combination of facts that can be deduced in its presence but not if it would be absent. Since CGS allow a substantial generalisation of the GRE problem, we show how the resulting formalism can be used by a GRE algorithm that refers uniquely to objects in the scene.
展开▼