Multi-Sentence Compression: Finding Shortest Paths in Word Graphs

Katja Filippova


Anthology ID:
C10-1037
Volume:
Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010)
Month:
August
Year:
2010
Address:
Beijing, China
Editors:
Chu-Ren Huang, Dan Jurafsky
Venue:
COLING
SIG:
Publisher:
Coling 2010 Organizing Committee
Note:
Pages:
322–330
Language:
URL:
https://aclanthology.org/C10-1037
DOI:
Bibkey:
Cite (ACL):
Katja Filippova. 2010. Multi-Sentence Compression: Finding Shortest Paths in Word Graphs. In Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010), pages 322–330, Beijing, China. Coling 2010 Organizing Committee.
Cite (Informal):
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs (Filippova, COLING 2010)
Copy Citation:
PDF:
https://aclanthology.org/C10-1037.pdf