Graphs and booleans: on the generation of referring expressions

DOI10.1007/978-1-4020-5958-2_16MaRDI QIDQ6547646

Kees van Deemter, Emiel Krahmer

Publication date: 30 May 2024

zbMATH Keywords

computational linguisticsdisjunctive normal formsubgraph isomorphismconjunctive normal formgradable property

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Natural language processing (68T50) Linguistics (91F20)

Cites Work

• Graph-Based Generation of Referring Expressions
• Generating Referring Expressions that Involve Gradable Properties
• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs and booleans: on the generation of referring expressions