[PDF] Top 20 Probabilistic Refinement Algorithms for the Generation of Referring Expressions

... a referring expression will be found if it exists; but gives higher probability to expressions using relations with a high ...the refinement function add L (R,ϕ, RE ) successively with each relation ... See full document

... A Fast Algorithm for the Generation of Referring Expressions A Fast A l g o r i t h m for t h e G e n e r a t i o n of Referring Expressions A b s t r a c t We simplify previous work in t h e developm[.] ... See full document

... of Referring Expressions (GRE) is the subtask of Natural Language Generation (NLG) that focuses on identifying objects in natural lan- ...the expressions generated in simple situations, ... See full document

... Language Generation, the task of attribute selection (AS) consists of determining the appropriate attribute-value pairs (or semantic properties) that represent the contents of a referring ...with ... See full document

... generating referring expressions mainly utilized attributes of objects and bi- nary relations between ...lect referring expressions in such situations, and built a generation algorithm ... See full document

... The generation of referring expressions is one of the most common tasks in natural language generation and has been addressed by many researchers in the past two decades, including Appelt ... See full document

... REG algorithms which rely on some predefined ranking of attributes cannot straightforwardly be applied in an inter- active ...traditional algorithms are outperformed by simple strategies that pay attention ... See full document

... Speakers can express quantities in different ways. For instance, a speaker may specify a meeting time with the expression ‘in the morning’ or with the more precise, numeric expression ‘at 10:30am’’; she may choose to ... See full document

... GRE algorithms have addressed the is- sue of generating locative expressions (Dale and Haddock, 1991; Horacek, 1997; Gardent, 2002; Krahmer and Theune, 2002; Varges, ...these algorithms assume the ... See full document

... Our work stands in a recent tradition of approaches that attempt to learn optimal RE generation strate- gies from corpora. For instance, Viethen et al. (2008) tune the parameters of the graph-based algo- rithm of ... See full document

... Secondly, anaphora resolution involves not only searching for the antecedent term in the text (as when searching for domain objects in space deixis) but also interpreting multiple candidate descriptions (including those ... See full document

... call referring expressions of this form scopally ambiguous, as the scope of Adj is unclear be- tween wide scope (Adj applies to both nouns) and narrow scope (Adj applies only to ... See full document

... algorithm is on the right track. If H3 were con- firmed, then earlier algorithms were (also) on the right track by taking brevity into account. Con- firmation of H2 would be interpreted as meaning that, in ... See full document

... Krahmer and Theune (2002) suggest a simi- lar adjustment for the IA by introducing a re- cursive loop if a relation to another object is in- troduced to the referring expression under con- struction. They treat ... See full document

... The evaluation scheme used in this study tests explic- itly for human-likeness of the referring expressions produced. This is based on the assumption that the more human-like a referring expression ... See full document

... expression generation has historically been treated as a part of the wider issue of gener- ating text from an underlying semantic representa- ...of referring expression generation has traditionally ... See full document

... of Referring Expressions Gen- eration (REG) algorithms by means of different versions of an ...REG algorithms with ontologies to study their behavior as the entities in the chosen ontol- ogy ... See full document

... presentation planning as an extension of text planning." In Aspects of Automated Natural Language Generation, edited by Robert Dale, Eduard H.. "Generating referring expressions in a mul[r] ... See full document

... produce referring expressions. Such expressions (for example: ‘the grey chair’) have therefore been studied extensively in research on Natural Language Generation ...automatic ... See full document

... Language Generation, Referring Ex- pression Generation (REG) is the task of generat- ing references to discourse entities (Krahmer and Van Deemter, ...REG algorithms have been developed on ... See full document