Two-dimensional hierarchies of proper languages of lexicalized FRR-automata

Authors:
Martin Plátek;Friedrich Otto;František Mráz
Affiliations:
Charles University, Faculty of Mathematics and Physics, Department of Computer Science, CZ-118 00 Praha 1, Czech Republic;Fachbereich Elektrotechnik/Informatik, Universität Kassel, D-34109 Kassel, Germany;Charles University, Faculty of Mathematics and Physics, Department of Computer Science, CZ-118 00 Praha 1, Czech Republic
Venue:
Information and Computation
Year:
2009

Citing 12
Cited 0

On measuring nondeterminism in regular languages

Information and Computation
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
A grammar based approach to a grammar checking of free word order languages

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Measuring nondeterminism in pushdown automata

Journal of Computer and System Sciences
Degrees of non-monotonicity for restarting automata

Theoretical Computer Science
On the Complexity of 2-Monotone Restarting Automata

Theory of Computing Systems
Monotonicity of restarting automata

Journal of Automata, Languages and Combinatorics
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages

Theoretical Computer Science
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
A measure for the degree of nondeterminism of context-free languages

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Modeling syntax of free word-order languages: dependency analysis by reduction

TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various syntactical phenomena play an important role when developing grammars for natural languages. Among them are the dependencies (subordination) or valences, which are closely related to the complexity of the word-order of the language considered, and the number and types of categories that are used during the process of syntactic disambiguation. Here we present the freely rewriting restarting automaton (FRR-automaton), which is a variant of the restarting automaton that is tuned towards modeling such phenomena. We study proper languages of deterministic FRR-automata that are (strongly) lexicalized, where we focus on two types of constraints: the number of rewrites per cycle, which models the degree of valences within sentences, and the number of occurrences of auxiliary symbols (categories) in the sentences (words) of the corresponding characteristic language, which models the use of categories during the process of syntactic disambiguation. Based on these constraints we obtain four variants of two-dimensional hierarchies of language classes.