Presentation on theme: "Generation of Referring Expressions: the State of the Art LOT Winter School, Tilburg 2008 Kees van Deemter Computing Science University of Aberdeen."— Presentation transcript:
Generation of Referring Expressions: the State of the Art LOT Winter School, Tilburg 2008 Kees van Deemter Computing Science University of Aberdeen
GRE in complex domains Early GRE studies have focussed on extremely simple domains Recently, slightly more complex domains have attracted attention The domain of Viethen & Dale (2007) involved spacial location. Same for TUNAs two domains, for work by Funakoshi et al (2004, 2006), and by Gatt (2006). TUNAs people domain involved objects whose properties were not easy to list Siddharthan & Copestake (2004) studied complex domains, focussing on repeated reference.
GRE in complex domains But domains can involve different kinds of complexity, such as hierarchical structure Also, domains can be much larger than the ones usually studied. Do the solutions scale up? A referential strategy that produces easy references in a small domain might produce less easy reference in a large domain. E.g., how would you point out the location of this course to someone unfamiliar with Tilburg? The PhD work of Ivandre Paraboni (now Sao Paulo, formerly Brighton) focussed on this problem.