Generating referring expressions involving relations

  • Authors:
  • Robert Dale;Nicholas Haddock

  • Affiliations:
  • University of Edinburgh, Edinburgh, Scotland;Hewlett Packard Laboratories, Stoke Gifford, Bristol, England

  • Venue:
  • EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
  • Year:
  • 1991

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we review Dale's [1989] algorithm for determining the content of a referring expression. The algorithm, which only permits the use of one-place predicates, it revised and extended to deal with n-ary predicates. We investigate the problem of blocking "recursion" in complex noun phrases and propose a solution in the context of our algorithm.