• No results found

[PDF] Top 20 Referring Expression Generation in time constrained communication

Has 10000 "Referring Expression Generation in time constrained communication" found on our website. Below are the top 20 most common "Referring Expression Generation in time constrained communication".

Referring Expression Generation in time constrained communication

Referring Expression Generation in time constrained communication

... Regarding attribute choice, we notice that studies as in (Pechmann, 1989) argue that colour is frequently selected even when not necessary for disambiguation, and for that reason we assume that the use of colour may be ... See full document

6

Adaptive Referring Expression Generation in Spoken Dialogue Systems: Evaluation with Real Users

Adaptive Referring Expression Generation in Spoken Dialogue Systems: Evaluation with Real Users

... it (significantly) easier to identify objects when using the learned policy. For the other ratings, users seemed to be not able to recognize the nu- ances in the way the system adapted to them. They could have been ... See full document

8

Generation of Referring Expression Using Prefix Tree Structure

Generation of Referring Expression Using Prefix Tree Structure

... can’t distinguish a from b at second phase. Deem- ter(2002) suggested inclusion of all overlapping values that are true of target while also removing some distractors. So, referring expression for a is “The ... See full document

6

Towards Situated Dialogue: Revisiting Referring Expression Generation

Towards Situated Dialogue: Revisiting Referring Expression Generation

... While graph-based approaches have shown effec- tive for the situation where the agent has complete knowledge of the environment, as its human part- ner, these approaches are often inadequate when hu- mans and agents have ... See full document

11

Justifying Corpus-Based Choices in Referring Expression Generation

Justifying Corpus-Based Choices in Referring Expression Generation

... generating referring expressions is a subtask in the traditional NL generation pipeline, the most intensively addressed one in the past decade (see (Krahmer, van Deemter 2012) for a recent ...long ... See full document

8

Learning Distributions over Logical Forms for Referring Expression Generation

Learning Distributions over Logical Forms for Referring Expression Generation

... Using this parser, we label the sentences in our training set. We only use scenes where at least 15 sentences were successfully parsed. This gives a training set of 141 scenes (2587 expressions). Com- bining the ... See full document

12

On the Robustness of Standalone Referring Expression Generation Algorithms Using RDF Data

On the Robustness of Standalone Referring Expression Generation Algorithms Using RDF Data

... We run three representative algorithms that can deal with single entity referents, described in Sec- tion 3. As all our algorithms can fail to produce a RE, the first column in our results table (Table 1) contains the ... See full document

8

On The Feasibility of Open Domain Referring Expression Generation Using Large Scale Folksonomies

On The Feasibility of Open Domain Referring Expression Generation Using Large Scale Folksonomies

... Pilot. The 16 tasks were split into 40 runs (a task spans n runs each, where n is the number of entities in the task, by rotating through the different alterna- tive pairs of referent / set of distractors). From these ... See full document

5

Learning to Adapt to Unknown Users: Referring Expression Generation in Spoken Dialogue Systems

Learning to Adapt to Unknown Users: Referring Expression Generation in Spoken Dialogue Systems

... user-adaptive referring expression gener- ation (REG) policies for spoken dialogue ...systems. Referring expressions can be dif- ficult to understand in technical domains where users may not know the ... See full document

10

The D-TUNA Corpus: A Dutch Dataset for the Evaluation of Referring Expression Generation Algorithms

The D-TUNA Corpus: A Dutch Dataset for the Evaluation of Referring Expression Generation Algorithms

... Each participant was presented the forty trials in a different random order. The experiments were individually performed in an experimental room, with an average running time of twenty minutes. All participants ... See full document

6

Reference production in human computer interaction: Issues for Corpus based Referring Expression Generation

Reference production in human computer interaction: Issues for Corpus based Referring Expression Generation

... The experiment followed the same procedure as in (Paraboni et al., 2017a), except that there was no hearer par- ticipant available, that is, each speaker worked on his/her own by interacting with a WEB interface without ... See full document

5

Computational Generation of Referring Expressions: A Survey

Computational Generation of Referring Expressions: A Survey

... of referring expressions ...and time periods ...of referring and then examine the borderline cases in light of similarities and differences from the paradigms” (Searle 1969, pages 26– ... See full document

46

Graph Based Generation of Referring Expressions

Graph Based Generation of Referring Expressions

... Defining an upper bound K, however, does have a disadvantage: We lose com- pleteness (see van Deemter [2002]). In particular, the algorithm will fail for objects that can be uniquely described only with K + 1 (or more) ... See full document

20

Learning Preferences for Referring Expression Generation: Effects of Domain, Language and Algorithm

Learning Preferences for Referring Expression Generation: Effects of Domain, Language and Algorithm

... produce referring expres- sions for targets in controlled visual ...a time consuming and labour in- tensive exercise, so it will not be surprising that only a handful of such corpora exists (and often only ... See full document

9

Referring Expression Generation Using Entity Profiles

Referring Expression Generation Using Entity Profiles

... the referring ex- pression in the discourse ...at time t − → h (pre) t and ← − h (pre) t ...step time H, and concatenate them to form the final vector representation h (pre) H = [ − → h (pre) H ; ← − ... See full document

10

NeuralREG: An end to end approach to referring expression generation

NeuralREG: An end to end approach to referring expression generation

... a referring expression for a wiki target is not found in this way, a back- off method is applied by removing one factor at a time in the following order: sentence information status, text information ... See full document

11

Real-Time Optimal Trajectory Generation for Constrained Dynamical Systems

Real-Time Optimal Trajectory Generation for Constrained Dynamical Systems

... trajectory generation problem would be to use nonlinear geometric control ...and generation of these so-called flat outputs are subjects of Isidori [46], Rathinam [87], Charlet et ...trajectory ... See full document

176

Trainable Speaker Based Referring Expression Generation

Trainable Speaker Based Referring Expression Generation

... These three methods for surface realization create a space of possible linguistic expressions given the set of attributes to be realized. These expressions are encoded as finite-state automata and have to be ranked based ... See full document

8

A Representation for Complex and Evolving Data Dependencies in Generation

A Representation for Complex and Evolving Data Dependencies in Generation

... When the Referring Expression generation module runs, it can recover the Centering information by inspecting the partial syntactic representations for the phrases it is supposed to gener[r] ... See full document

8

The Pragmatics of Referring and the Modality of Communication

The Pragmatics of Referring and the Modality of Communication

... Now, clearly, a speaker's planning of a request that the hearer identify the referent of some description should c o m p l y with the rules for requesting; the speaker is trying to achie[r] ... See full document

50

Show all 10000 documents...