About: Gale–Church alignment algorithm

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 and Kenneth W. Church of AT&T Bell Laboratories.

Property Value
dbo:abstract
  • 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 and Kenneth W. Church of AT&T Bell Laboratories. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 12223583 (xsd:integer)
dbo:wikiPageLength
  • 1081 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1051121036 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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 and Kenneth W. Church of AT&T Bell Laboratories. (en)
rdfs:label
  • Gale–Church alignment algorithm (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License