Lexicalized Syntactic Analysis by Two-Way Restarting Automata

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F21%3A00517853" target="_blank" >RIV/67985807:_____/21:00517853 - isvavai.cz</a>

Alternative codes found

RIV/00216208:11320/21:10440805

Result on the web

<a href="http://dx.doi.org/10.25596/jalc-2021-145" target="_blank" >http://dx.doi.org/10.25596/jalc-2021-145</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.25596/jalc-2021-145" target="_blank" >10.25596/jalc-2021-145</a>

Result language

angličtina

Original language name

Lexicalized Syntactic Analysis by Two-Way Restarting Automata

Original language description

We study h-lexicalized two-way restarting automata that can rewrite at most i times per cycle for some i >= 1 (hRLWW(i)-automata). This model is useful for the study of lexical (syntactic) disambiguation, which is a concept from linguistics that is based on certain reduction patterns. We study lexical disambiguation through the formal notion of h-lexicalized syntactic analysis (hLSA). The hLSA is a relation between a basic language and the corresponding h-proper language, which is obtained from the basic language by mapping all basic symbols to input symbols. We stress the sensitivity of hLSA by hRLWW(i)-automata to the size of the window, the number of possible rewrites per cycle, and the degree of (non-)monotonicity of these automata. We introduce the concepts of contextually transparent languages and contextually transparent lexicalized analyses based on very special reduction patterns, and we present two-dimensional hierarchies of their subclasses based on the size of window and on the degree of monotonicity. The bottoms of these hierarchies correspond to the regular and the context-free languages. The class of contextually transparent languages forms a proper subclass of the class of context-sensitive languages with syntactically natural properties.

Czech name

—

Czech description

—

Type

J_SC - Article in a specialist periodical, which is included in the SCOPUS database

CEP classification

—

OECD FORD branch

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

Project

<a href="/en/project/GA19-05704S" target="_blank" >GA19-05704S: FoNeCo: Analytical Foundations of Neurocomputing</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2021

Confidentiality

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

Name of the periodical

Journal of Automata, Languages and Combinatorics

ISSN

1430-189X

e-ISSN

2567-3785

Volume of the periodical

26

Issue of the periodical within the volume

1-2

Country of publishing house

DE - GERMANY

Number of pages

27

Pages from-to

145-171

UT code for WoS article

—

EID of the result in the Scopus database

2-s2.0-85126969946