A generalized view on parsing and translation

Authors:
Alexander Koller;Marco Kuhlmann
Affiliations:
University of Potsdam, Germany;Uppsala University, Sweden
Venue:
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Year:
2011

Citing 25
Cited 2

Tree languages

Handbook of formal languages, vol. 3
Tree-adjoining grammars

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

Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
The syntactic process

The syntactic process
On the complexity analysis of static analyses

Journal of the ACM (JACM)
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Synchronous models of language

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Computational properties of environment-based disambiguation

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Learning non-isomorphic tree mappings for machine translation

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series)

Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series)
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
Tree representations of graphs

European Journal of Combinatorics
Hierarchical Phrase-Based Translation

Computational Linguistics
Training tree transducers

Computational Linguistics
Dependency trees and the strong generative capacity of CCG

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Binarization of synchronous context-free grammars

Computational Linguistics
A connection between partial symmetry and inverse procedural modeling

ACM SIGGRAPH 2010 papers
Efficient parsing of well-nested 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
Computing weakest readings

ACL '10 Proceedings of the 48th Annual Meeting 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
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

Second position clitics and monadic second-order transduction

ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
Finding the smallest binarization of a CFG is NP-hard

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formal framework that generalizes a variety of monolingual and synchronous grammar formalisms for parsing and translation. Our framework is based on regular tree grammars that describe derivation trees, which are interpreted in arbitrary algebras. We obtain generic parsing algorithms by exploiting closure properties of regular tree languages.