Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm

DOI10.1162/089120102317341765MaRDI QIDQ4406663zbMATH OpenOpenAlexFDO

Authors Kees van Deemter

Publication date 26 June 2003

Published in Computational Linguistics (Search for Journal in Brave)

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

zbMATH Keywords

generation of referring expressionsnatural language generationreferences to sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Recommendations

• Using logic in the generation of referring expressions
• Graph-based 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
• Generating referring expressions that involve gradable properties

Cited in

(9)

• Lexical choice and conceptual perspective in the generation of plural referring expressions
• Conservation principles and action schemes in the synthesis of geometric concepts
• Distinguishing and classifying from n-ary properties
• Using logic in the generation of referring expressions
• Graph-based generation of referring expressions
• Generating referring expressions that involve gradable properties
• An Inferential Approach to the Generation of Referring Expressions
• Formal concept analysis for the generation of plural referring expressions
• Graphs and booleans: on the generation of referring expressions

This page was built for publication: Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm

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