Graphs and booleans: on the generation of referring expressions
type: Item
instance of: scholarly article
title: Graphs and booleans: on the generation of referring expressions
DOI: 10.1007/978-1-4020-5958-2_16
author: Kees van Deemter
author: Emiel Krahmer
publication date: 2024-05-30T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68T50
Mathematics Subject Classification ID: 91F20
zbMATH DE Number: 7857591
zbMATH Keywords: conjunctive normal form
zbMATH Keywords: gradable property
zbMATH Keywords: disjunctive normal form
zbMATH Keywords: computational linguistics
zbMATH Keywords: subgraph isomorphism
MaRDI profile type: Publication
cites work: Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
cites work: Generating Referring Expressions that Involve Gradable Properties
cites work: Q4198056
cites work: Q3684121
cites work: Q4398780
cites work: Graph-Based Generation of Referring Expressions
cites work: Q5586372
cites work: Q3219752
cites work: Q4847218
cites work: Q5686039
description: scientific article; zbMATH DE number 7857591