arrow
返回

Sampling Tree Fragments from Forests

delete2014-03-01
delete3
delete
OA
AI
T
Tagyoung Chung *
L
Licheng Fang
D
Daniel Gildea
D
Daniel Štefankovič
DOI:10.1162/COLI_a_00170delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
We study the problem of sampling trees from forests, in the setting where probabilities for each tree may be a function of arbitrarily large tree fragments. This setting extends recent work for sampling to learn Tree Substitution Grammars to the case where the tree structure (TSG derived tree) is not fixed. We develop a Markov chain Monte Carlo algorithm which corrects for the bias introduced by unbalanced forests, and we present experiments using the algorithm to learn Synchronous Context-Free Grammar rules for machine translation. In this application, the forests being sampled represent the set of Hiero-style rules that are consistent with fixed input word-level alignments. We demonstrate equivalent machine translation performance to standard techniques but with much smaller grammars.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computational Linguistics 封面图
Computational Linguistics
IF:
5.3
论文数:
837
被引数:
2.7K

机构

U
University of Rochester
学者数:
2.6W
论文数: 2.1W
被引数: 2.2W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Bulldog dwarfism in Dexter cattle is caused by mutations in ACAN
err2007-10-22
err0
PREAI
errJulie A. L. Cavanagh; Imke Tammen; Peter A. Windsor; John F. Bateman; Ravi Savarirayan; Frank W. Nicholas; Herman W. Raadsma
err分享
err收藏
Anticipatory and Anticipated Emotions in Regular and Non-regular Exercisers – A Qualitative Study
err2022-07-04
err0
errOAAI
errKatharina Feil; Susanne Weyland; Julian Fritsch; Hagen Wäsche; Darko Jekauc
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容