The Question of Expressiveness in the Generation of Referring Expressions

Details The Question of Expressiveness in the Generation of Referring Expressions The Question of Expressiveness in the Generation of Referring Expressions

2010-06-23

arxiv.org/abs/1006.4621v1

Computer Science

Logic in Computer Science

Scientific paper

We study the problem of generating referring expressions modulo different notions of expressive power. We define the notion of $\+L$-referring expression, for a formal language $\+L$ equipped with a semantics in terms of relational models. We show that the approach is independent of the particular algorithm used to generate the referring expression by providing examples using the frameworks of \cite{AKS08} and \cite{Krahmer2003}. We provide some new complexity bounds, discuss the issue of the length of the generated descriptions, and propose ways in which the two approaches can be combined.

Affiliated with

Also associated with

No associations

Rating

The Question of Expressiveness in the Generation of Referring Expressions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Question of Expressiveness in the Generation of Referring Expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Question of Expressiveness in the Generation of Referring Expressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278744