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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207345" target="_blank" >RIV/00216208:11320/09:00207345 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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- utomaton), 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. Based on these constraints we obtain four variants of two-dimensional hierarchies of language classes.

Název v anglickém jazyce

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

Popis výsledku anglicky

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- utomaton), 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. Based on these constraints we obtain four variants of two-dimensional hierarchies of language classes.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/1ET100300517" target="_blank" >1ET100300517: Metody inteligentních systémů a jejich aplikace při dobývání znalostí a zpracování přirozeného jazyka</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Information and Computation

ISSN

0890-5401

e-ISSN

—

Svazek periodika

207

Číslo periodika v rámci svazku

11

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

—

Kód UT WoS článku

000271169800013

EID výsledku v databázi Scopus

—