tailieunhanh - Báo cáo khoa học: "Preferences versus Adaptation during Referring Expression Generation"

Current Referring Expression Generation algorithms rely on domain dependent preferences for both content selection and linguistic realization. We present two experiments showing that human speakers may opt for dispreferred properties and dispreferred modifier orderings when these were salient in a preceding interaction (without speakers being consciously aware of this). We discuss the impact of these findings for current generation algorithms. | Preferences versus Adaptation during Referring Expression Generation Martijn Goudbeek University of Tilburg Tilburg The Netherlands Emiel Krahmer University of Tilburg Tilburg The Netherlands Abstract Current Referring Expression Generation algorithms rely on domain dependent preferences for both content selection and linguistic realization. We present two experiments showing that human speakers may opt for dispreferred properties and dispre-ferred modifier orderings when these were salient in a preceding interaction without speakers being consciously aware of this . We discuss the impact of these findings for current generation algorithms. 1 Introduction The generation of referring expressions is a core ingredient of most Natural Language Generation NLG systems Reiter and Dale 2000 Mellish et al. 2006 . These systems usually approach Referring Expression Generation REG as a two-step procedure where first it is decided which properties to include content selection after which the selected properties are turned into a natural language referring expression linguistic realization . The basic problem in both stages is one of choice there are many ways in which one could refer to a target object and there are multiple ways in which these could be realized in natural language. Typically these choice problems are tackled by giving preference to some solutions over others. For example the Incremental Algorithm Dale and Reiter 1995 one of the most widely used REG algorithms assumes that certain attributes are preferred over others partly based on evidence provided by Pechmann 1989 a chair would first be described in terms of its color and only if this does not result in a unique characterization other less preferred attributes such as orientation are tried. The Incremental Algorithm is arguably unique in assuming a complete preference order of attributes but other REG algo rithms rely on similar distinctions. The Graphbased algorithm .