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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
