Graph-Based Generation of Referring Expressions

DOI10.1162/089120103321337430zbMath1234.68417OpenAlexW2096646663MaRDI QIDQ3225398

Sebastiaan van Erk, André Verleg, Emiel Krahmer

Publication date: 20 March 2012

Published in: Computational Linguistics (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/a8397b0e-5627-4f73-bd50-e1cb80ee0650

zbMATH Keywords

branch and bound algorithmcost functionsgraph-theoretic approachscenenatural language generationcontent selection problemreferring expressions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Natural language processing (68T50) Linguistics (91F20)

Related Items (1)

Distinguishing and classifying from \(n\)-ary properties

Cites Work

• Planarizing Graphs - A Survey and Annotated Bibliography
• Efficient Planarity Testing
• The graph isomorphism disease
• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Graph-Based Generation of Referring Expressions