Weighted grammars and Kleene's theorem
Information Processing Letters
A maximum entropy approach to natural language processing
Computational Linguistics
Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
On the complexity analysis of static analyses
Journal of the ACM (JACM)
Computational Complexity of Problems on Probabilistic Grammars and Transducers
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On syntax-directed transduction and tree transducers
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Context-free grammars on trees
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Computational Linguistics
Using lexicalized tags for machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Discriminative training and maximum entropy models for statistical machine translation
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Minimum error rate training 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
Hierarchical Phrase-Based Translation
Computational Linguistics
Capturing practical natural language transformations
Machine Translation
Computational Linguistics
Efficient parsing for transducer grammars
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Variational decoding for statistical machine translation
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Synchronous tree adjoining machine translation
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2
Journal of Computer and System Sciences
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
A decoder for probabilistic synchronous tree insertion grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Input products for weighted extended top-down tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Unidirectional derivation semantics for synchronous tree-adjoining grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous tree-adjoining grammars, partial solutions to this problem have been described, some being restricted to the unweighted case, some to the monolingual case. We introduce a formulation of this class of grammars which is effectively closed under input and output restrictions to regular tree languages, i.e., the restricted translations can again be represented by grammars. Moreover, we present an algorithm that constructs these grammars for input and output restriction, which is inspired by Earley's algorithm.