Generating referring expressions involving relations
Robert Dale, Nicholas J. Haddock · 1991
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.