Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1162/COLI_a_00170 | Computational Linguistics |
Field | DocType | Volume |
Tree traversal,Computer science,K-ary tree,Algorithm,Tree structure,Segment tree,Fractal tree index,Interval tree,Search tree,Incremental decision tree | Journal | 40 |
Issue | ISSN | Citations |
1 | 0891-2017 | 4 |
PageRank | References | Authors |
0.49 | 33 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tagyoung Chung | 1 | 68 | 8.83 |
| Licheng Fang | 2 | 21 | 2.54 |
| Daniel Gildea | 3 | 2269 | 193.43 |
| Daniel Stefankovic | 4 | 243 | 28.65 |