On multiple context-free grammars
Theoretical Computer Science
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Approaches to unification in grammar: a brief survey
Specifying syntactic structures
Computational Complexity and Natural Language
Computational Complexity and Natural Language
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Computational Complexity of Problems on Probabilistic Grammars and Transducers
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
The mathematics of statistical machine translation: parameter estimation
Computational Linguistics - Special issue on using large corpora: II
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
Computational Linguistics
Estimation of probabilistic context-free grammars
Computational Linguistics
Statistical properties of probabilistic context-free grammars
Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A comparative study on reordering constraints in statistical machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Learning non-isomorphic tree mappings for machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
Computational Linguistics
Aligning words using matrix factorisation
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Generalized multitext grammars
ACL '04 Proceedings of the 42nd 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
Optimal constituent alignment with edge covers for semantic projection
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Translating with non-contiguous phrases
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
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
Hierarchical Phrase-Based Translation
Computational Linguistics
An EM algorithm for SCFG in formal syntax-based translation
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Extracting synchronous grammar rules from word-level alignments in linear time
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Comparing reordering constraints for SMT using efficient Bleu oracle computation
SSST '07 Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation
Empirical lower bounds on alignment error rates in syntax-based machine translation
SSST '09 Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation
Learning stochastic bracketing inversion transduction grammars with a cubic time biparsing algorithm
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Using a maximum entropy-based tagger to improve a very fast vine parser
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
| Hi-index | 0.00 |
Range concatenation grammars are viewed as a hierarchy of synchronous grammars. It is shown how inversion transduction grammars (ITGs) and extensions thereof, including synchronous tree-adjoining grammars, are captured by the hierarchy, and the expressivity and linguistic relevance of subclasses of the hierarchy are discussed. A $${\mathcal{O}(|G|n^6)}$$ time extension of ITGs is proposed. The extension translates cross-serial dependencies into nested ones and handles complex kinds of discontinuous translation units and so-called inside-out alignments. In fact, our $${\mathcal{O}(|G|n^6)}$$ time extension generates all possible alignments. It is shown that this additional expressivity comes at the cost of probabilistic parsing.