Premium
Content determination in the generation of referring expressions
Author(s) -
Dale Robert,
Haddock Nicholas
Publication year - 1991
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1991.tb00399.x
Subject(s) - noun phrase , computer science , referent , natural language processing , artificial intelligence , domain (mathematical analysis) , recursion (computer science) , lexicon , representation (politics) , generative grammar , set (abstract data type) , noun , linguistics , algorithm , mathematics , programming language , mathematical analysis , philosophy , politics , political science , law
In this paper, we describe a general framework for the generation of referring expressions. Given an intended referent in the domain, domain‐dependent mapping rules build a domain‐independent level of recoverable semantic structure, which encodes the semantic content to be recovered by the hearer; a second set of mapping rules then builds an abstract syntactic structure, which is unified with a grammar and lexicon to produce a surface noun phrase. Within this framework, (0 we present a detailed description of the algorithms required to build the recoverable semantic structure, and discuss how the problem of infinite recursion can be handled when using relations in descriptions; and (/;') we show how the two levels of representation facilitate the generation of one‐anaphoric noun phrases.