Gale–Church alignment algorithm
{{Short description|Parallel text alignment algorithm}}
In computational linguistics, the Gale–Church algorithm is a method for aligning corresponding sentences in a parallel corpus. It works on the principle that equivalent sentences should roughly correspond in length; that is, longer sentences in one language should correspond to longer sentences in the other language. The algorithm was described in a [https://web.archive.org/web/20061026051708/http://acl.ldc.upenn.edu/J/J93/J93-1004.pdf 1993 paper] by William A. Gale and Kenneth W. Church of AT&T Bell Laboratories.
References
{{reflist}}
External links
- {{Citation
| last1 = Gale | first1 = William A.
| last2 = Church | first2 = Kenneth W.
| title = A Program for Aligning Sentences in Bilingual Corpora
| journal = Computational Linguistics
| volume = 19
| issue = 1
| pages = 75–102
| year = 1993
| url = http://www.aclweb.org/anthology/J93-1004.pdf }}
{{DEFAULTSORT:Gale-Church alignment algorithm}}
Category:Computational linguistics
{{algorithm-stub}}
{{comp-ling-stub}}