Charting the Potential of Description Logic for the Generation of Referring Expressions

The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recently, many GRE algorithms were developed using only simple formalisms, which were taylor made for the task. Following the fast development of ontology-based systems, reinterpretations of GRE in terms of description logic (DL) have recently started to be studied. However, the expressive power of these DL-based algorithms is still limited, not exceeding that of older GRE approaches. In this paper, we propose a DL-based approach to GRE that exploits the full power of OWL2. Unlike existing approaches, the potential of reasoning in GRE is explored. 1 GRE and KR: the story so far Generation of Referring Expressions (GRE) is the subtask of Natural Language Generation (NLG) that focuses on identifying objects in natural language. For example, Fig.1 depicts the relations between several women, dogs and cats. In such a ...

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