2004
DOI: 10.1007/978-3-540-27823-8_18
|View full text |Cite
|
Sign up to set email alerts
|

Overgenerating Referring Expressions Involving Relations and Booleans

Abstract: Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and negations. The focus of this paper is on generating referring expressions involving positive and negated relations. We describe rule-based overgeneration of referring expressions based on the notion of 'extension', and show how to constrain the search space by interleaving logical form generation with realization and expressing preferen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0
1

Year Published

2006
2006
2009
2009

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 15 publications
0
3
0
1
Order By: Relevance
“…Several GRE algorithms have addressed the issue of generating locative expressions (Dale and Haddock 1991;Horacek 1997;Gardent 2002;Krahmer and Theune 2002;Figure 26 Interpreting the blue ball near the red ball. Varges 2004). However, all these algorithms assume the GRE component has access to a predefined scene model that defines all the spatial relations between all the entities in the scene.…”
Section: Generating Referencesmentioning
confidence: 99%
“…Several GRE algorithms have addressed the issue of generating locative expressions (Dale and Haddock 1991;Horacek 1997;Gardent 2002;Krahmer and Theune 2002;Figure 26 Interpreting the blue ball near the red ball. Varges 2004). However, all these algorithms assume the GRE component has access to a predefined scene model that defines all the spatial relations between all the entities in the scene.…”
Section: Generating Referencesmentioning
confidence: 99%
“…Several GRE algorithms have addressed the issue of generating locative expressions (Dale and Haddock, 1991;Horacek, 1997;Gardent, 2002;Krahmer and Theune, 2002;Varges, 2004). However, all these algorithms assume the GRE component has access to a predefined scene model.…”
Section: Introductionmentioning
confidence: 99%
“…NP generation for query constraints can be seen as a form of referring expression generation (see Dale and Reiter 1995, for example). In contrast to Varges (2004), the phrases produced by the chart generator are not directly associated with their extension (the set of objects they denote) since these are held in the database backend rather than in-memory.…”
Section: Response Generationmentioning
confidence: 99%