返回
Sampling Tree Fragments from Forests
DOI:10.1162/COLI_a_00170.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.3
论文数:
837
被引数:
2.7K
机构
引用论文
Spatial trends and human health risks of organochlorinated pesticides from bovine milk; a case study from a developing country, Pakistan
Chemosphere
IF0
Papel de la microbiota intestinal en el desarrollo de diferentes enfermedades neurológicas
Neurología
IF0

