Formal and computational aspects of natural language syntax
Formal and computational aspects of natural language syntax
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora
Computational Linguistics
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Synchronous models of language
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Multitext Grammars and synchronous parsers
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Statistical machine translation by parsing
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Bootstrapping parsers via syntactic projection across parallel texts
Natural Language Engineering
Comparing example-based and statistical machine translation
Natural Language Engineering
Statistical machine translation by parsing
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
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
Statistical machine translation
ACM Computing Surveys (CSUR)
A* search via approximate factoring
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Optimal reduction of rule length in linear context-free rewriting systems
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Quasi-synchronous grammars: alignment by soft projection of syntactic dependencies
StatMT '06 Proceedings of the Workshop on Statistical Machine Translation
Optimal parsing strategies for linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Learning to translate with source and target syntax
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Syntax-driven machine translation as a model of ESL revision
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Re-structuring, re-labeling, and re-aligning for syntax-based machine translation
Computational Linguistics
Grammar factorization by tree decomposition
Computational Linguistics
A $${\mathcal{O}(|G|n^6)}$$ time extension of inversion transduction grammars
Machine Translation
Parsing noun phrases in the penn treebank
Computational Linguistics
Machine translation based on constraint-based synchronous grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notational and intuitive simplicity of Context-Free Grammar (CFG). GMTG allows both synchronous and independent rewriting. Such flexibility facilitates more perspicuous modeling of parallel text than what is possible with other synchronous formalisms. This paper investigates the generative capacity of GMTG, proves that each component grammar of a GMTG retains its generative power, and proposes a generalization of Chomsky Normal Form, which is necessary for synchronous CKY-style parsing.