Abstract
Alignment of the sentences of an original text and a translation is considerably better understood than alignment of smaller units such as words and phrases. This paper makes some preliminary proposals for solving the problem of aligning substrings that should be treated as basic translation unites even though they may not begin and end at word boundaries. The proposals make crucial use of suffix trees as a way of identifying repeated substrings of the texts that occur significantly often.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fredkin, E.: Trie memory. Informal Memorandum. Communications of the ACM 3(9), 490–500 (1960)
Gale, W.A., Church, K.W.: A program for Aligning Sentences in Bilingual Corpora. Computational Linguistics 19(1), 61–74 (1993)
Kay, M., Röscheisen, M.: Text-Translation Alignment. Computational Linguistics 19(1) (1995)
Nelson, M.: Fast String Searching With Suffix Trees. Dr. Dobb’s Journal (August 1996)
McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23, 262–272 (1976)
Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kay, M. (2004). Substring Alignment Using Suffix Trees. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2004. Lecture Notes in Computer Science, vol 2945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24630-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-24630-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21006-1
Online ISBN: 978-3-540-24630-5
eBook Packages: Springer Book Archive