Multi-sentence compression: Finding shortest paths inword graphs

Coling 2010 - 23rd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 2, Issue , 2010, Pages 322-330

  Filippova, Katja ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SHORTEST PATH; SIMPLE APPROACH; TOKENIZER; WORD GRAPHS;

COMPUTATIONAL LINGUISTICS;

GRAPH THEORY;

EID: 79959671458     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Banko, M., V. O. Mittal & M. J. Witbrock (2000). Headline generation based on statistical translation. In Proc. of ACL-00, pp. 318-325.
2. Barzilay, R. & L. Lee (2003). Learning to paraphrase: An unsupervized approach using multisequence alignment. In Proc. of HLT-NAACL-03, pp. 16-23.
3. Barzilay, R. & K. R. McKeown (2005). Sentence fusion for multidocument news summarization. Computational Linguistics, 31(3):297-327. (Pubitemid 43677937)
4. Clarke, J. & M. Lapata (2007). Modelling compression with discourse constraints. In Proc. of EMNLP-CoNLL-07, pp. 1-11.
5. Clarke, J. & M. Lapata (2008). Global inference for sentence compression: An integer linear programming approach. Journal of Artificial Intelligence Research, 31:399-429. (Pubitemid 351761992)
6. Cohn, T. & M. Lapata (2009). Sentence compression as tree transduction. Journal of Artificial Intelligence Research, 34:637-674.
7. Corston-Oliver, S. H. (2001). Text compaction for display on very small screens. In Proceedings of the NAACL Workshop on Automatic Summarization, Pittsburg, PA, 3 June 2001, pp. 89-98.
8. Dorr, B., D. Zajic & R. Schwartz (2003). Hedge trimmer: A parse-and-trim approach to headline generation. In Proceedings of the Text Summarization Workshop at HLT-NAACL-03, Edmonton, Alberta, Canada, 2003, pp. 1-8.
9. Filippova, K. & M. Strube (2008a). Dependency tree based sentence compression. In Proc. of INLG-08, pp. 25-32.
10. Filippova, K. & M. Strube (2008b). Sentence fusion via dependency graph compression. In Proc. of EMNLP-08, pp. 177-185.
11. Galley, M. & K. R.McKeown (2007). Lexicalized Markov grammars for sentence compression. In Proc. of NAACL-HLT-07, pp. 180-187.
12. Hori, C., S. Furui, R. Malkin, H. Yu & A. Waibel (2003). A statistical approach to automatic speech summarization. EURASIP Journal on Applied Signal Processing, 2:128-139.
13. Jin, R. & A. G. Hauptmann (2003). Automatic title generation for spoken broadcast news. In Proc. of HLT-01, pp. 1-3.
14. Jing, H. & K. McKeown (2000). Cut and paste based text summarization. In Proc. of NAACL-00, pp. 178-185.
15. Krahmer, E., E. Marsi & P. van Pelt (2008). Query-based sentence fusion is better defined and leads to more preferred results than generic sentence fusion. In Proc. of ACL-HLT-08, pp. 193-196.
16. Mani, I. (2001). Automatic Summarization. Amsterdam, Philadelphia: John Benjamins.
17. McDonald, R. (2006). Discriminative sentence compression with soft syntactic evidence. In Proc. of EACL-06, pp. 297-304.
18. Mohri, M. (1997). Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311.
19. Shen, S., D. Radev, A. Patel & G. Erkan (2006). Adding syntax to dynamic programming for aligning comparable texts for generation of paraphrases. In Proc. of COLING-ACL-06, pp. 747-754.
20. Wan, S., M. Dras, R. Dale & C. Paris (2009). Improving grammaticality in statistical sentence generation: Introducing a dependency spanning tree algorithm with an argument satisfaction model. In Proc. of EACL-09, pp. 852-860.