On h-Lexicalized Automata and h-Syntactic Analysis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10370232" target="_blank" >RIV/00216208:11320/17:10370232 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On h-Lexicalized Automata and h-Syntactic Analysis

Popis výsledku v původním jazyce

Following some previous studies on list automata and restarting automata is introduced a generalized and refined model - the h-lexicalized restarting list automaton (LxRLAW). We argue that this model is useful for expressing transparent variants of lexicalized syntactic analysis, and analysis by reduction in computational linguistics. We present several subclasses of LxRLAW, and provide some variants and some extensions of the Chomsky hierarchy, including the variant for the lexicalized syntactic analysis. We compare the input languages, which are the languages traditionally considered in automata theory, to the so called basic and h-proper languages . The basic and h-proper languages allow stressing the transparency of h-lexicalized restarting automata for a super- class of the context-free languages by the so-called complete correctness preserving property. Such a type of transparency cannot be achieved for the whole class of context-free languages by traditional input languages. The transparency of h-lexicalized restarting automata is illustrated by two types of hierarchies which separate the classes of infinite and the classes of finite languages by the same tools.

Název v anglickém jazyce

On h-Lexicalized Automata and h-Syntactic Analysis

Popis výsledku anglicky

Following some previous studies on list automata and restarting automata is introduced a generalized and refined model - the h-lexicalized restarting list automaton (LxRLAW). We argue that this model is useful for expressing transparent variants of lexicalized syntactic analysis, and analysis by reduction in computational linguistics. We present several subclasses of LxRLAW, and provide some variants and some extensions of the Chomsky hierarchy, including the variant for the lexicalized syntactic analysis. We compare the input languages, which are the languages traditionally considered in automata theory, to the so called basic and h-proper languages . The basic and h-proper languages allow stressing the transparency of h-lexicalized restarting automata for a super- class of the context-free languages by the so-called complete correctness preserving property. Such a type of transparency cannot be achieved for the whole class of context-free languages by traditional input languages. The transparency of h-lexicalized restarting automata is illustrated by two types of hierarchies which separate the classes of infinite and the classes of finite languages by the same tools.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA15-04960S" target="_blank" >GA15-04960S: SeLeCt - struktury, učení a kognice</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

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 statě ve sborníku

Proceedings of the 17th Conference on Information Technologies - Applications and Theory (ITAT 2017), CEUR Workshop Proceedings

ISBN

—

ISSN

1613-0073

e-ISSN

neuvedeno

Počet stran výsledku

8

Strana od-do

40-47

Název nakladatele

Charles University, Faculty of Mathematics and Physics

Místo vydání

Praha

Místo konání akce

Martinské hole, Slovakia

Datum konání akce

22. 9. 2017

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—