Generating referring expressions that involve gradable properties

DOI10.1162/COLI.2006.32.2.195MaRDI QIDQ3225447zbMATH OpenOpenAlexFDO

Authors Kees van Deemter

Publication date 20 March 2012

Published in Computational Linguistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/coli.2006.32.2.195

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• Graph-based generation of referring expressions
• Using logic in the generation of referring expressions
• An Inferential Approach to the Generation of Referring Expressions
• Lexical choice and conceptual perspective in the generation of plural referring expressions

Cites work

• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• The bargaining problem

Cited in

(9)

• Lexical choice and conceptual perspective in the generation of plural referring expressions
• Evaluative linguistic expressions vs. fuzzy categories
• scientific article; zbMATH DE number 1690098 (Why is no real title available?)
• On modelling with words
• Using logic in the generation of referring expressions
• Graph-based generation of referring expressions
• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• Graphs and booleans: on the generation of referring expressions
• Utility and language generation: The case of vagueness

This page was built for publication: Generating referring expressions that involve gradable properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225447)