Mining wikipedia's article revision history for training computational linguistics algorithms

AAAI Workshop - Technical Report

Volumn WS-08-15, Issue , 2008, Pages 31-36

  Nelken, Rani ^a   Yamangil, Elif ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SENTENCE COMPRESSION; TEXT SUMMARIZATION; TRAINING DATA; WIKIPEDIA;

ARTIFICIAL INTELLIGENCE; ERRORS; MINING; TEXT PROCESSING; WORD PROCESSING;

COMPUTATIONAL LINGUISTICS;

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

References (14)

1. Carlson, A. J.; Rosen, J.; and Roth, D. 2001. Scaling up context sensitive text correction. In IAAI2001, 45-50.
2. Collins, M. 1997. Three generative, lexicalized models for statistical parsing. In Cohen, P. R., and Wahlster, W., eds., Proceedings of the Thirty-Fifth Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics, 16-23. Somerset, New Jersey: Association for Computational Linguistics.
3. Dagan, I.; Glickman, O.; and Magnini, B. 2005. The PASCAL recognising textual entailment challenge. In Candela, J. Q.; Dagan, I.; Magnini, B.; and d'Alche Buc, F., eds., MLCW, volume 3944 of Lecture Notes in Computer Science, 177-190. Springer.
4. Dolan, B.; Quirk, C.; and Brockett, C. 2004. Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources. In Proceedings of the 20th International Conference on Computational Linguistics (COLING-2004).
5. Fellbaum, C. 1998. WordNet: An Electronic Lexical Database. MIT Press.
6. Hall, P. A. V., and Dowling, G. R. 1980. Approximate string matching. ACM Comput. Surv. 12(4):381-402.
7. Knight, K., and Marcu, D. 2000. Statistics-based summarization - step one: Sentence compression. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, 703-710. AAAI Press/The MIT Press.
8. Kupiec, J.; Pederson, J.; and Chen, F. 1995. A Trainable Document Summarizer. In SIGIR 1995, 68-73. Washington, WA, USA: ACM.
9. Langkilde, I. 2000. Forest-based statistical sentence generation. In Proceedings of the first conference on North American chapter of the Association for Computational Linguistics, 170-177. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
10. Turner, J., and Charniak, E. 2005. Supervised and unsupervised learning for sentence compression. In ACL '05: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, 290-297. Morristown, NJ, USA: Association for Computational Linguistics.
11. Viegas, F. B.; Wattenberg, M.; and Dave, K. 2004. Studying cooperation and conflict between authors with history flow visualizations. In Dykstra-Erickson, E., and Tscheligi, M., eds., CHI, 575-582. ACM.
12. Witten, I., and Bell, T. 1991. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Transactions on Information Theory 37(4).
13. Yamangil, E., and Nelken, R. 2008. Mining wikipedia revision histories for improving sentence compression. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies.
14. Zobel, J., and Dart, P. W. 1996. Phonetic string matching: Lessons from information retrieval. In Frei, H.-P; Harman, D.; Schäble, P.; and Wilkinson, R., eds., Proceedings of the 19th International Conference on Research and Development in Information Retrieval, 166-172. Zurich, Switzerland: ACM Press.