Gale–Church alignment algorithm: Difference between revisions
Content deleted Content added
mNo edit summary |
m →References: WP:CHECKWIKI error fixes - Replaced endash with hyphen in sortkey per WP:MCSTJR using AWB (9100) |
||
| Line 14: | Line 14: | ||
| url = http://www.aclweb.org/anthology/J93-1004.pdf }} |
| url = http://www.aclweb.org/anthology/J93-1004.pdf }} |
||
{{DEFAULTSORT:Gale-Church alignment algorithm}} |
|||
[[Category:Computational linguistics]] |
[[Category:Computational linguistics]] |
||
{{algorithm-stub}} |
{{algorithm-stub}} |
||
Revision as of 18:41, 20 April 2013
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 1993 paper by William A. Gale and Kenneth W. Church of AT&T Bell Laboratories.
References
- Gale, William A.; Church, Kenneth W. (1993), "A Program for Aligning Sentences in Bilingual Corpora" (PDF), Computational Linguistics, 19 (1): 75–102
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
 | This linguistics article is a stub. You can help Wikipedia by expanding it. |