Gale–Church alignment algorithm: Difference between revisions

Content deleted Content added

Inline

Latest revision as of 23:35, 14 September 2024

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 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 computational linguistics-related article is a stub. You can help Wikipedia by expanding it.

Revision as of 09:49, 8 March 2024 edit Jorge Hinoshon (talk \| contribs) 4 edits m Changed a hyphen to semicolon Tag: Visual edit ← Previous edit		Latest revision as of 23:35, 14 September 2024 edit undo Jlwoodwa (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers, Rollbackers 101,128 edits Adding short description: "Parallel text alignment algorithm" Tag: Shortdesc helper
Line 1:		Line 1:
			{{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 [[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 [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 [[Bell Labs\|AT&T Bell Laboratories]].