Daniel Gildea (2003): Loosely Tree-Based Alignment for Machine Translation. Linguistics 580 (Machine Translation) Scott Drellishak, 2/21/2006. Overview. Gildea presents an alignment model he describes as “loosely tree-based” Builds on Yamada & Knight (2001), a tree-to-string model
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Linguistics 580(Machine Translation)Scott Drellishak, 2/21/2006
for all nodes εiin input tree T do for all k, l such that 1 < k < l < N do for all orderings ρof the children ε1… εmof εido for all partitions of span k, l into k1, l1…km, lmdo
end for end for end forend for
B Z → X Z Y
for all nodes εain source tree Ta in bottom-up order do for all elementary trees ta rooted in εado for all nodes εb in target tree Tb in bottom-up order do for allelementary trees tb rooted in εbdo for all alignments α of the children of ta and tbdo
end forend for end for end forend for