Počet záznamů: 1
Lexicalized Syntactic Analysis by Restarting Automata
- 1.
SYSNO ASEP 0517845 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV D - Článek ve sborníku Název Lexicalized Syntactic Analysis by Restarting Automata Tvůrce(i) Mráz, F. (CZ)
Otto, F. (CZ)
Pardubská, D. (SK)
Plátek, Martin (UIVT-O)Zdroj.dok. Proceedings of the Prague Stringology Conference 2019. - Prague : Czech Technical University in Prague, 2019 / Holub Jan ; Žďárek Jan - ISBN 978-80-01-06618-8 Rozsah stran s. 69-83 Poč.str. 15 s. Forma vydání Online - E Akce Prague Stringology Conference 2019 Datum konání 26.08.2019 - 28.08.2019 Místo konání Prague Země CZ - Česká republika Typ akce WRD Jazyk dok. eng - angličtina Země vyd. CZ - Česká republika Klíč. slova Restarting automaton ; h-lexicalization ; lexical disambiguation 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 Institucionální podpora UIVT-O - RVO:67985807 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 considered useful for the study of lexical (syntactic) disambiguation, which is a concept from linguistics. It is based on certain reduction patterns. We study lexical disambiguation through the formal notion of h-lexicalized syntactic analysis (hLSA). The hLSA is composed of 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 their windows, the number of possible rewrites per cycle, and the degree of (non-)monotonicity. We introduce the concepts of contextually transparent languages (CTL) 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 windows and on the degree of synchronization. The bottoms of these hierarchies correspond to the context-free languages. CTL creates a proper subclass 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 2020 Elektronická adresa http://www.stringology.org/papers/PSC2019.pdf
Počet záznamů: 1