Gale–Church alignment algorithm - Revision history

Jlwoodwa: Adding short description: "Parallel text alignment algorithm"

2024-09-14T23:35:33Z

Adding short description: "Parallel text alignment algorithm"

← Previous revision		Revision as of 23:35, 14 September 2024
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]].

Jorge Hinoshon: Changed a hyphen to semicolon

2024-03-08T09:49:53Z

Changed a hyphen to semicolon

← Previous revision		Revision as of 09:49, 8 March 2024
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~~&mdash~~;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]].

	==References==		==References==

BattyBot: /* References */Replaced Template:Empty section with Template:Reflist, performed general fixes

2023-06-08T16:52:15Z

References: Replaced Template:Empty section with Template:Reflist, performed general fixes

← Previous revision		Revision as of 16:52, 8 June 2023
Line 3:		Line 3:
	==References==		==References==

			{{reflist}}
	{{Empty section\|date=July 2015}}

	==External links==		==External links==

Dominus: /* top */ redlink William A. Gale

2021-10-21T17:59:19Z

top: redlink William A. Gale

← Previous revision		Revision as of 17:59, 21 October 2021
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 [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]].

	==References==		==References==

InternetArchiveBot: Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0

2019-12-23T19:57:08Z

Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0

← Previous revision		Revision as of 19:57, 23 December 2019
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 [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]].

	==References==		==References==

Fadesga: /* External links */

2017-07-24T11:51:40Z

External links

← Previous revision		Revision as of 11:51, 24 July 2017
Line 22:		Line 22:

	{{algorithm-stub}}		{{algorithm-stub}}
	{{ling-stub}}		{{comp-ling-stub}}

Yobot: WP:CHECKWIKI error fixes, added Empty section (1) tag using AWB (11345)

2015-07-27T21:41:02Z

WP:CHECKWIKI error fixes, added Empty section (1) tag using AWB (11345)

← Previous revision		Revision as of 21:41, 27 July 2015
Line 3:		Line 3:
	==References==		==References==

			{{Empty section\|date=July 2015}}
⚫	==External ~~Link~~==

		⚫	==External links==
	* {{Citation		* {{Citation
	\| last1 = Gale \| first1 = William A.		\| last1 = Gale \| first1 = William A.

Fermatgio2 at 06:52, 18 June 2015

2015-06-18T06:52:45Z

← Previous revision		Revision as of 06:52, 18 June 2015
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.

Yobot: WP:CHECKWIKI error fixes + other fixes, removed orphan tag using AWB (10065)

2014-03-29T07:36:57Z

WP:CHECKWIKI error fixes + other fixes, removed orphan tag using AWB (10065)

← Previous revision		Revision as of 07:36, 29 March 2014
Line 1:		Line 1:
	{{Orphan\|date=February 2009}}
	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]].

Yobot: /* References */WP:CHECKWIKI error fixes - Replaced endash with hyphen in sortkey per WP:MCSTJR using AWB (9100)

2013-04-20T18:41:36Z

References: WP:CHECKWIKI error fixes - Replaced endash with hyphen in sortkey per WP:MCSTJR using AWB (9100)

← Previous revision		Revision as of 18:41, 20 April 2013
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}}