Počet záznamů: 1
Lexicalized Syntactic Analysis by Two-Way Restarting Automata
- 1.
SYSNO ASEP 0517853 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve SCOPUS Název Lexicalized Syntactic Analysis by Two-Way Restarting Automata Tvůrce(i) Mráz, F. (CZ)
Otto, F. (DE)
Pardubská, D. (SK)
Plátek, Martin (UIVT-O)Zdroj.dok. Journal of Automata, Languages and Combinatorics - ISSN 1430-189X
Roč. 26, 1-2 (2021), s. 145-171Poč.str. 27 s. Forma vydání Tištěná - P Jazyk dok. eng - angličtina Země vyd. DE - Německo Klíč. slova analysis by reduction ; two-way restarting automaton ; h-lexicalization ; contextually transparent language ; mildly context-sensitive language Vědní obor RIV IN - Informatika Obor OECD Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) CEP GA19-05704S GA ČR - Grantová agentura ČR Způsob publikování Omezený přístup Institucionální podpora UIVT-O - RVO:67985807 EID SCOPUS 85126969946 DOI 10.25596/jalc-2021-145 Anotace 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. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2023 Elektronická adresa http://dx.doi.org/10.25596/jalc-2021-145
Počet záznamů: 1