Gale–Church alignment algorithm: Difference between revisions
Appearance
Content deleted Content added
m WP:CHECKWIKI error fixes + other fixes, removed orphan tag using AWB (10065) |
Fermatgio2 (talk | contribs) No edit summary |
||
Line 1: | Line 1: | ||
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 [http://acl.ldc.upenn.edu/J/J93/J93-1004.pdf 1993 paper] by William A. Gale and Kenneth W. Church of [[Bell Labs|AT&T Bell Laboratories]]. |
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 [http://acl.ldc.upenn.edu/J/J93/J93-1004.pdf 1993 paper] by William A. Gale and Kenneth W. Church of [[Bell Labs|AT&T Bell Laboratories]]. |
||
==References== |
==References== |
||
==External Link== |
|||
* {{Citation |
* {{Citation |
||
| last1 = Gale | first1 = William A. |
| last1 = Gale | first1 = William A. |
Revision as of 06:52, 18 June 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
External Link
- Gale, William A.; Church, Kenneth W. (1993), "A Program for Aligning Sentences in Bilingual Corpora" (PDF), Computational Linguistics, 19 (1): 75–102