Preservation of recognizability for synchronous tree substitution grammars

Authors:
Zoltán Fülöp;Andreas Maletti;Heiko Vogler
Affiliations:
University of Szeged, Szeged, Hungary;Universitat Rovira i Virgili, Tarragona, Spain;Technische Universitát Dresden, Dresden, Germany
Venue:
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Year:
2010

Citing 19
Cited 6

Weighted grammars and Kleene's theorem

Information Processing Letters
Tree languages

Handbook of formal languages, vol. 3
Syntax-Directed Transduction

Journal of the ACM (JACM)
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
On syntax-directed transduction and tree transducers

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Translations on a context free grammar

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Mathematical and computational aspects of lexicalized grammars

Mathematical and computational aspects of lexicalized grammars
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
A syntax-based statistical translation model

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Statistical phrase-based translation

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Probabilistic parsing strategies

Journal of the ACM (JACM)
Training tree transducers

Computational Linguistics
Better k-best parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The Power of Extended Top-Down Tree Transducers

SIAM Journal on Computing
Extended multi bottom–up tree transducers: Composition and decomposition

Acta Informatica
Generalized2 sequential machine maps

Journal of Computer and System Sciences
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
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

An alternative to synchronous tree substitution grammars*

Natural Language Engineering
Tree transformations and dependencies

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Tree parsing with synchronous tree-adjoining grammars

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Weighted Extended Tree Transducers

Fundamenta Informaticae
Unidirectional derivation semantics for synchronous tree-adjoining grammars

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider synchronous tree substitution grammars (Stsg). With the help of a characterization of the expressive power of Stsg in terms of weighted tree bimorphisms, we show that both the forward and the backward application of an Stsg preserve recognizability of weighted tree languages in all reasonable cases. As a consequence, both the domain and the range of an Stsg without chain rules are recognizable weighted tree languages.