Generating Referring Expressions with OWL2

The task of generating referring expressions, an important subtask of Natural Language Generation is to generate phrases that uniquely identify domain entities. Until recently, many GRE algorithms were developed using only simple and essentially home-made formalisms. Following the fast development of ontology-based systems, reinterpretations of GRE in terms of description logic have been studied. However, the quantifiers generated are still limited, not exceeding the works covered by existing GRE approaches. In this paper, we propose an DL-based approach to GRE that exploits the full power of OWL2 to generate referring expressions that goes beyond the expressivity of previous GRE algorithms. The potential of DL reasoning in GRE is also discussed. 1 GRE and KR: the story so far Generation of Referring Expressions (GRE) is the subtask of Natural Language Generation (NLG) that focuses on the identification of objects in natural language. For example, Fig.1 depicts the relations between se...

• Type: Journal
• Year: 2010
• Where: DLOG
• Authors: Yuan Ren, Kees van Deemter, Jeff Z. Pan
• Keywords: Automated Reasoning, DLOG 2010, GRE Algorithms, Natural Language, Natural Language Generation