Introduction to algorithms
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
Computational Linguistics
A syntax-based statistical translation model
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A hierarchical phrase-based model for statistical machine translation
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Empirical lower bounds on the complexity of translational equivalence
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Some computational complexity results for synchronous context-free grammars
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Synchronous binarization for machine translation
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Factoring synchronous grammars by sorting
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Revisiting t. uno and m. yagiura's algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Extracting synchronous grammar rules from word-level alignments in linear time
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Binarization of synchronous context-free grammars
Computational Linguistics
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
Grammar factorization by tree decomposition
Computational Linguistics
On hierarchical re-ordering and permutation parsing for phrase-based decoding
WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
| Hi-index | 0.00 |
Factoring a Synchronous Context-Free Grammar into an equivalent grammar with a smaller number of nonterminals in each rule enables synchronous parsing algorithms of lower complexity. The problem can be formalized as searching for the tree-decomposition of a given permutation with the minimal branching factor. In this paper, by modifying the algorithm of Uno and Yagiura (2000) for the closely related problem of finding all common intervals of two permutations, we achieve a linear time algorithm for the permutation factorization problem. We also use the algorithm to analyze the maximum SCFG rule length needed to cover hand-aligned data from various language pairs.