Alignment of noisy unstructured text data

Proceedings of IJCAI 2007 Workshop on Analytics for Noisy Unstructured Text Data, AND 2007

Volumn , Issue , 2007, Pages 139-146

  Bourdaillet, Julien ^a   Ganascia, Jean Gabriel ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EDIT DISTANCE WITH MOVES; EXPERIMENTAL EVALUATION; LARGE AMOUNTS; SYNTHETIC DATA; UNSTRUCTURED TEXTS;

HEURISTIC ALGORITHMS;

EXPERIMENTS;

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

References (22)

1. [Arslan et al., 2001] Abdullah N. Arslan, Omer Egecioglu, and Pavel A. Pevzner. A new approach to sequence comparison: normalized sequence alignment. Bioinformatics, 17(4):327-337, 2001.
2. [Bergroth et al., 2000] L. Bergroth, H. Hakonen, and T. Raita. A Survey of Longest Common Subsequence Algorithms. In SPIRE '00: Proceedings of the Seventh International Symposium on String Processing Information Retrieval, 2000.
3. [Bourdaillet and Ganascia, 2006] Julien Bourdaillet and Jean-Gabriel Ganascia. MEDITE: A Unilingual Textual Aligner. In Tapio Salakoski et al., editor, Advances in Natural Language Processing, 5th International Conference on NLP, FinTAL 2006, Turku, Finland, Proceedings, volume 4139 of Lecture Notes in Artificial Intelligence, pages 458-469. Springer, 2006.
4. [Bray et al., 2003] Nick Bray, Inna Dubchak, and Lior Pachter. AVID: A Global Alignment Program. Genome Res., 13(1):97-102, 2003.
5. [Chiao et al., 2006] Yun-Chuang Chiao, Olivier Kraif, Dominique Laurent, Thi Minh Huyen Nguyen, Nasredine Semmar, François Stuck, Jean V́eronis, and Wajdi Zaghouani. Evaluation of multilingual text alignment systems: The ARCADE II project. Proceedings of the LREC 2006 Conference, 2006.
6. [Clough et al., 2002] Paul Clough, Robert Gaizauskas, Scott Piao, and YorickWilks. METER: MEasuring TExt Reuse. In proceedings of the 40th Anniversary Meeting for the Association for Computational Linguistics (ACL-02), pages 152-159, 2002.
7. [Deppman et al., 2004] Jed Deppman, Daniel Ferrer, and Michael Groden, editors. Genetic Criticism - Texts and Avant-textes. University of Pennsylvania Press, 2004.
8. [Feng and Manmatha, 2006] Shaolei Feng and R. Manmatha. A hierarchical, HMM-based automatic evaluation of OCR accuracy for a digital library of books. In JCDL '06: Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries, pages 109-118, New York, NY, USA, 2006. ACM Press.
9. [Gusfield, 1997] Dan Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computer Biology. Cambridge University Press, 1997.
10. [Kolman et al., 2004] Petr Kolman, Avraham Goldstein, and Jie Zheng. Minimum Common String Partition Problem: Hardness and Approximations. In Proceedings of the 15h International Symposium on Algorithms and Computation (ISAAC), 2004.
11. [Levenshtein, 1966] V.I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversal. Cybernetics and Control Theory, 10(0):707-710, 1966.
12. [Lopresti and Tomkins, 1997] Daniel P. Lopresti and Andrew Tomkins. Block EditModels for Approximate String Matching. Theoretical Computer Science, 181(1):159- 179, 1997.
13. [Myers, 1986] Eugene W. Myers. An O(ND) Difference Algorithm and Its Variations. Algorithmica, 1(2):251-266, 1986.
14. [Needleman and Wunsch, 1970] Saul Needleman and Christian Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(i):443-453, 1970.
15. [Regina Barzilay, 2001] Kathleen McKeown, Regina Barzilay. Extracting Paraphrases from a Parallel Corpus. in Proceedings of ACL/EACL, 2001.
16. [Shapira and Storer, 2002] Dana Shapira and James A. Storer. Edit Distance with Move Operations. In Alberto Apostolico and Masayuki Takeda, editors, CPM, volume 2373 of Lecture Notes in Computer Science, pages 85-98. Springer, 2002.
17. [Smit et al., 1996] A.F.A. Smit, R. Hubley, and P. Green. RepeatMasker Open-3.0, 1996.
18. [Smith and Waterman, 1981] Temple F. Smith and Michael S. Waterman. Identification of Common Molecular Subsequences. Journal of Molecular Biology, 147:195-197, 1981.
19. [Tichy, 1984] Walter F. Tichy. The String-to-String Correction Problem with Block Moves. ACM Trans. Comput. Syst., 2(4):309-321, 1984.
20. [Ukkonen, 1995] Esko Ukkonen. On-Line Construction of Suffix Trees. Algorithmica, 14(3):249-260, 1995.
21. [Wilbur and Lipman, 1984] W. J. Wilbur and David J. Lipman. The context dependent comparison of biological sequences. SIAM J. Applied Mathematics, 44(3):557-567, 1984.
22. [Wise, 1996] Michael J. Wise. YAP3: Improved Detection of Similarities in Computer Program and Other Texts. SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education), 28, 1996.