Overgenerating Referring Expressions Involving Relations and Booleans

  title={Overgenerating Referring Expressions Involving Relations and Booleans},
  author={Sebastian Varges},
  • S. Varges
  • Published in INLG 14 July 2004
  • Computer Science
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… 

Incremental Generation of Spatial Referring Expressions in Situated Dialog

This paper addresses the issue of combinatorial explosion inherent in the construction of relational context models by contextually defining the set of objects in the context that may function as a landmark and sequencing the order in which spatial relations are considered using a cognitively motivated hierarchy of relations.

Generating coherent references to multiple entities

This study is unique in that it is the first to directly address the semantic issues while attempting to abstract away from linguistic realisation, and focuses not only on singular, but also on plural descriptions.

Semantics and Pragmatics of Spatial Reference

A compositional model for interpreting utterances that uses a learned model of lexical semantics to ground linguistic terms into the physical world and a novel probabilistic model that is capable of discerning the spatial relations that are present in a physical scene is presented.

The generation of natural descriptions: corpus-based investigations of referring expressions in visual domains

The main conclusion of the analyses and experiments in this thesis is that speaker-specific variation plays a much larger role in the generation of referring expressions than existing algorithms acknowledge.

Cosy Cognitive Systems for Cognitive Assistants Wp 9.1 Grammar Resources for Describing Objects and Locations Executive Summary Role of Grammar Resources in Cosy Relation to the Demonstrators Cosy Fp6-004250

  • Computer Science
In this deliverable the meaning representations the grammar constructs for different classes of phenomena are described, and how the grammar for the embodied agent to generate utterances describing the environment is described.

Interactive Question Answering and Constraint Relaxation in Spoken Dialogue Systems

Methods for dealing with the results of database queries in information-seeking dialogues in spoken dialogue systems and dialogue strategies for selecting and presenting information succinctly are described.

A Context-dependent Algorithm for Generating Locative Expressions in Physically Situated Environments

This framework addresses the issue of combinatorial explosion inherent in the construction of relational context models by contextually defining the set of objects in the context that may function as a landmark and sequencing the order in which spatial relations are considered using a cognitively motivated hierarchy of relations.

Chart Generation Using Production Systems

The purpose of this paper is to extend the range of implementation options available to the NLG practitioner by detailing the specific advantages and disadvantages of using production systems for NLG.

Applying Computational Models of Spatial Prepositions to Visually Situated Dialog

A generic architecture for a visually situated dialog system is described and the interactions between the spatial cognition module, which provides the interface to the models of prepositional semantics, and the other components in the architecture are highlighted.



Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm

A logical perspective to the generation of referring expressions is brought, addressing the incompleteness of existing algorithms in this area, and generalizations and extensions of the Incremental Algorithm of Dale and Reiter (1995) are proposed.

Generating Referring Expressions Involving Relations

Dale's algorithm for determining the content of a referring expression is reviewed, which only permits the use of one-place predicates, revised and extended to deal with n-ary predicates.

Graph-Based Generation of Referring Expressions

A scene is proposed to formalize a scene as a labeled directed graph and describe content selection as a subgraph construction problem that allows for an integration of rule-based generation techniques with more recent stochastic approaches.

Generating Minimal Definite Descriptions

An alternative, constraint-based algorithm is presented that builds on existing related algorithms in that it produces minimal descriptions for sets of individuals using positive, negative and disjunctive properties and is integrated with surface realisation.

Instance-Based Natural Language Generation

This work develops an efficient search technique for identifying the optimal candidate based on a novel extension of the A* algorithm and details the annotation scheme and grammar induction algorithm and the efficiency and output of the generator.

Sentence Planning as Description Using Tree Adjoining Grammar

This approach captures naturally and elegantly the interaction between pragmatic and syntactic constraints on descriptions in a sentence, and the inferential interactions between multiple descriptions inA sentence.

Reversible delayed lexical choice in a bidirectional framework

It is shown how delayed lexical choice can be used in parsing, so that some types of ill-formed inputs can be parsed, but well-formed outputs are generated, using the same shared linguistic information.

Computational Interpretations of the Gricean Maxims in the Generation of Referring Expressions

A recommended algorithm is described, along with a specification of the resources a host system must provide in order to make use of the algorithm, and an implementation used in the natural language generation component of the IDAS system.

A Best-First Search Algorithm for Generating Referring Expressions

This work proposes a best-first searching algorithm for uniquely identifying sets of objects that incorporates linguistically motivated preferences and several techniques to cut down the search space.

Exploiting a Probabilistic Hierarchical Model for Generation

Initial results are presented showing that a tree-based model derived from aTree-annotated corpus improves on a tree modelderived from an unannotated Corpus, and that a Tree-based stochastic model with a hand-crafted grammar outperforms both.