The computational complexity of avoiding conversational implicatures

  • Authors:
  • Ehud Reiter

  • Affiliations:
  • Harvard University, Cambridge, Mass

  • Venue:
  • ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 implicature make the generation task NP-Hard.