Gale–Church alignment algorithm: Difference between revisions
Content deleted Content added
Fermatgio2 (talk | contribs) No edit summary |
m WP:CHECKWIKI error fixes, added Empty section (1) tag using AWB (11345) |
||
| Line 3: | Line 3: | ||
==References== |
==References== |
||
{{Empty section|date=July 2015}} |
|||
| ⚫ | |||
| ⚫ | |||
* {{Citation |
* {{Citation |
||
| last1 = Gale | first1 = William A. |
| last1 = Gale | first1 = William A. |
||
Revision as of 21:41, 27 July 2015
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
![[icon]](/wiki/File:Wiki_letter_w_cropped.svg?lang=en){kind=small} | This section is empty. You can help by adding to it. (July 2015) |
External links
- 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. |