Unsupervised Induction of Sentence Compression Rules

ACL-IJCNLP 2009 - UCNLG+Sum 2009: 2009 Workshop on Language Generation and Summarisation, Proceedings of the Workshop

Volumn , Issue , 2009, Pages 15-22

  Cordeiro, João ^a   Dias, Gaël ^a   Brazdil, Pavel ^b  

^a UNIVERSITY OF BEIRA INTERIOR   (Portugal)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS;

COMPRESSION RULES; DATA EXAMPLES; INDUCTIVE LOGIC; LEARNING PROCESS; LINGUISTIC PROCESSING; LOGIC-PROGRAMMING; PROGRAMMING TECHNIQUE; SENTENCE COMPRESSION; STRUCTURED DATA; UNSUPERVISED APPROACHES;

INDUCTIVE LOGIC PROGRAMMING (ILP);

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

References (16)

1. Barzilay R. and Lee L.. 2003. Learning to paraphrase: An unsupervised approach using multiple-sequence alignment. In HLT-NAACL 2003: Main Proceedings, pages 16-23.
2. Camacho R. 1994. Learning stage transition rules with Indlog. Gesellschaft für Mathematik und Datenverarbeitung MBH., Volume 237 of GMD-Studien, pp. 273-290.
3. Clarke J., and Lapata M. 2006. Constraint-based Sentence Compression: An Integer Programming Approach. 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics.
4. Cordeiro J. and Dias G. and Cleuziou G. 2007. Biology Based Alignments of Paraphrases for Sentence Compression. In Proceedings of the Workshop on Textual Entailment and Paraphrasing (ACL-PASCAL/ACL2007), Prague, Czech Republic.
5. Cordeiro J. and Dias G. and Brazdir P. October 2007. New Functions for Unsupervised Asymmetrical Paraphrase Detection. In Journal of Software., Volume:2, Issue:4, Page(s): 12-23. Academy Publisher. Finland. ISSN: 1796-217X.
6. Dolan W.B. and Quirck C. and Brockett C. 2004. Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources. In Proceedings of 20th International Conference on Computational Linguistics (COLING 2004).
7. Knight K. and Marcu D. 2002. Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence, 139(1):91-107.
8. Muggleton S. 1991. Inductive Logic Programming. New Generation Computing, 8 (4):295-318.
9. Muggleton S. 1996. Learning from positive data. Proceedings of the Sixth International Workshop on Inductive Logic Programming (ILP-96), LNAI 1314, Berlin, 1996. Springer-Verlag.
10. Muggleton S. 1999. Inductive logic programming: Issues, results and the challenge of learning language in logic. Artificial Intelligence, 114 (1-2), 283-296.
11. Le Nguyen M., Horiguchi S., A. S., and Ho B. T. 2004. Example-based sentence reduction using the hidden markov model. ACM Transactions on Asian Language Information Processing (TALIP), 3(2):146-158.
12. Needleman SB, Wunsch CD. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48 (3): 443-53.
13. Quinlan J. R. 1990. Learning Logical Deinitions from Relations. Machine Learning., 5 (3), 239-266. 33, 39, 41.
14. Smith TF, Waterman MS. 1981. Identification of Common Molecular Subsequences. Journal of Molecular Biology, 147: 195-197.
15. Srinivasan A. 2000. The Aleph Manual, Technical Report. Computing Laboratory, Oxford University, UK.
16. Turner J, Charniak E. 2005. Supervised and Unsupervised Learning for Sentence Compression. Proceedings of the 43rd Annual Meeting of the ACL, pages 290-297.