Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees

Authors:
Anna Kasprzik
Affiliations:
University of Trier
Venue:
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Year:
2009

Citing 8
Cited 1

Learning regular sets from queries and counterexamples

Information and Computation
Learning context-free grammars from structural data in polynomial time

Theoretical Computer Science
A geometric hierarchy beyond context-free languages

Theoretical Computer Science
Tree languages

Handbook of formal languages, vol. 3
wMSO theories as grammar formalisms

Theoretical Computer Science - Algebraic methods in language processing
A study of tree adjoining grammars

A study of tree adjoining grammars
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Learning a regular tree language from a teacher

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Two Equivalent Regularizations for Tree Adjoining Grammars

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a new term-like representation for multi-dimensional trees as defined by Rogers [1,2] which establishes them as a direct generalization of classical trees. As a consequence these structures can be used as input for finite-state applications based on classical term-based tree language theory. Via the correspondence between string and tree languages these applications can then be conceived to be able to process even some language classes beyond context-freeness.