[PDF] Top 20 Generating Referring Expressions with Reference Domain Theory

... In the second step, the algorithm iterates through the underspecified domains instantiated with S and selects the first that matches. The order in which underspecified domains are tested is particularly im- portant. We ... See full document

... planning domain (lex- icon) is used for multiple problem instances, a rel- evant evaluation of a planning-based approach is its coverage of a range of various linguistic input (for REI tasks) and output (for REG ... See full document

... Suppose a referring expression identifies its referent uniquely. Then at least two things can stand in the way of finding its referent: the “difficulty” of the individual properties used in the description (i.e., ... See full document

... The Incremental Algorithm of Dale and Reiter (1995) singles out a target object from among some larger domain of entities. It does this by logically conjoining a num- ber of properties found in a part of the KB ... See full document

... Furthermore, our presented approach leads to a variety of predictions that we are testing. One such prediction involves the role of a set of items’ spatial arrangement on QRE production. Findings in numerical perception ... See full document

... cal reference for this approach is the Incremental Algorithm of Dale and Reiter (1995); other meth- ods for generating definite REs follow the same perspective (Krahmer et ...systematically ... See full document

... Our User Simulation module simulates dialogue behaviour of different users, and interacts with the dialogue system by exchanging both dialogue acts and REs. It produces users with different knowl- edge profiles. The user ... See full document

... Referring expressions and definite descriptions of objects in space exploit information about both object characteristics and ...to reference entities, changing modal- ities as ...when ... 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

... explain reference domains ...partitions, reference domains can be nested as an approximation of partitioning, that is, an entity included in a RD is either an individual en- tity or another ... See full document

... Our experiments extended these findings to full definite NP reference. Throughout, we used a dis- tributional definition of similarity, as defined by Lin (1998), which was found to be highly corre- lated to ... See full document

... of referring expressions ...of reference is difficult to pin down exactly (Searle 1969; Abbott ...of referring and then examine the borderline cases in light of similarities and differences ... See full document

... Sedivy et al. (1999) asked subjects to identify the target of a vague description in a visual scene. Consider the tall cup. The relevant scene would contain three distractors: (1) a less tall object of the same type as ... See full document

... A Computational Model for Generating Referring Expressions in a Multilingual Application Domain A C o m p u t a t i o n a l M o d e l for G e n e r a t i n g R e f e r r i n g E x p r e s s i o n s in[.] ... See full document

... We start by defining a synchronous grammar formalism that relates surface strings to their in- terpretations as sets of objects in a given domain (Section 3). This formalism integrates REG with surface ... See full document

... while relations might serve to help locate the en- tity. This needs to be taken into account when gen- erating a referring expression. If we were gener- ating instructions for using a machine, we might want to ... See full document

... The context in the previous Fig.1 and the ac- companying examples (a-c) in Section 1 illustrate the expected output of each of the three algorithms under consideration. As in previous work on re- lational REG, the ... See full document

... Each experimental subject was presented with screenshots containing a marked object and an RE. Subjects were told that we had previously referred to the marked object with the given RE, but an (imaginary) player ... See full document

... of referring expressions have been investigated by the research in this field, including, for example, the construction of the shortest possible descriptions, how to incorporate relations between objects ... See full document

... Dale and Reiter point out that the full brevity algorithm is both computationally infeasible (NP hard) and psychologically unrealistic. They offer the incremental algo- rithm as an alternative. The incremental algorithm ... See full document