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



Publication Details
Authors:
Platek, M.; Otto, F.; Mraz, F.
Publication year:
2009
Journal:
Information and Computation
Pages range:
1300-1314
Volume number:
207
ISSN:
0890-5401

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. (C) 2009 Elsevier Inc. All rights reserved.


Authors/Editors

Last updated on 2019-01-11 at 16:04