This paper describes a language independent method for aligning parallel texts (texts that arc translations of each other, or of a common source text), statistically supported. This new approach is inspired on previous work by Ribeiro et al (2000). The application of the second statistical filler, proposed by Ribeiro et al, based on Confidence Bands (CB), is substituted by the application of the Longest Sorted Sequence algorithm (LSSA). LSSA is described in this paper. As a result, 35% decrease in processing time and 18% increase in the number of aligned segments was obtained, for Portuguese-French alignments. Similar results were obtained regarding Portuguese-English alignments. Both methods are compared and evaluated, over a large parallel corpus made up of Portuguese, English and French parallel texts (approximately 250Mb of text per language). © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ildefonso, T., & Lopes, G. P. (2005). Longest sorted sequence algorithm for parallel text alignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3643 LNCS, pp. 81–90). https://doi.org/10.1007/11556985_13
Mendeley helps you to discover research relevant for your work.