Sciweavers

ACL
1990

The Computational Complexity of Avoiding Conversational Implicatures

13 years 5 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they may lead hearers to infer unwanted conversational implicatures. These preference rules can be incorporated into a polynomial time generation algorithm, while some alternative formalizations of conversational impficature make the generation task NP-Hard.
Ehud Reiter
Added 07 Nov 2010
Updated 07 Nov 2010
Type Conference
Year 1990
Where ACL
Authors Ehud Reiter
Comments (0)