All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On h-Lexicalized Automata and h-Syntactic Analysis

The result's identifiers

  • Result code in 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>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    On h-Lexicalized Automata and h-Syntactic Analysis

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    <a href="/en/project/GA15-04960S" target="_blank" >GA15-04960S: SeLeCt - Structures, Learning and Cognition</a><br>

  • Continuities

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

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

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

  • ISBN

  • ISSN

    1613-0073

  • e-ISSN

    neuvedeno

  • Number of pages

    8

  • Pages from-to

    40-47

  • Publisher name

    Charles University, Faculty of Mathematics and Physics

  • Place of publication

    Praha

  • Event location

    Martinské hole, Slovakia

  • Event date

    Sep 22, 2017

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article