Graphs and booleans: on the generation of referring expressions
From MaRDI portal
Publication:6547646
DOI10.1007/978-1-4020-5958-2_16MaRDI QIDQ6547646FDOQ6547646
Authors: Kees van Deemter, Emiel Krahmer 
Publication date: 30 May 2024
subgraph isomorphismcomputational linguisticsdisjunctive normal formconjunctive normal formgradable property
Knowledge representation (68T30) Logic in artificial intelligence (68T27) Natural language processing (68T50) Linguistics (91F20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-based generation of referring expressions
- Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating referring expressions that involve gradable properties
- Title not available (Why is that?)
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)
