A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
The mathematics of statistical machine translation: parameter estimation
Computational Linguistics - Special issue on using large corpora: II
Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - 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
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Revisited
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Why synchronous tree substitution grammars?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Parsing and translation algorithms based on weighted extended tree transducers
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Fluency constraints for minimum Bayes-risk decoding of statistical machine translation lattices
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Varro: an algorithm and toolkit for regular structure discovery in treebanks
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Finite-state methods and models in natural language processing
Natural Language Engineering
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
How to train your multi bottom-up tree transducer
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Composing extended top-down tree transducers
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Preservation of recognizability for weighted linear extended top-down tree transducers
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
TTT: a tree transduction language for syntactic and semantic processing
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Hyper-minimization for deterministic tree automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We study automata for capturing the transformations in practical natural language processing (NLP) systems, especially those that translate between human languages. For several variations of finite-state string and tree transducers, we survey answers to formal questions about their expressiveness, modularity, teachability, and generalization. We conclude that no formal device yet captures everything that is desirable, and we point to future research.