Graphs and booleans: on the generation of referring expressions

DOI10.1007/978-1-4020-5958-2_16MaRDI QIDQ6547646zbMATH OpenFDO

Authors Kees van Deemter, Emiel Krahmer

Publication date 30 May 2024

zbMATH Keywords

subgraph isomorphismcomputational linguisticsdisjunctive normal formconjunctive normal formgradable property

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 794693 (Why is no real title available?)
• scientific article; zbMATH DE number 3305071 (Why is no real title available?)
• scientific article; zbMATH DE number 3424017 (Why is no real title available?)
• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• Generating referring expressions that involve gradable properties
• Graph-based generation of referring expressions

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

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