1 |
Lexicalized Syntactic Analysis by Two-Way Restarting Automata ...
|
|
|
|
Abstract:
We study \emph{h-lexicalized two-way restarting automat{a}} that can rewrite at most $i$ times per cycle for some $i\ge 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 \emph{h-lexicalized syntactic analysis} (hLSA). The hLSA is a relation between a \emph{basic language} and the corresponding \emph{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 \emph{contextually transparent languages} and \emph{contextually transparent lexicalized analyses} based on very special reduction patterns, and we present two-dimensional hierarchies of their subclasses ... : Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 145-171 ...
|
|
URL: https://dx.doi.org/10.25596/jalc-2021-145 http://jalc.de/issues/2021/issue_26_1-2/jalc-2021-145-171.php
|
|
BASE
|
|
Hide details
|
|
4 |
Studies in formal slavic linguistics : contributions from Formal Description of Slavic Languages 6.5, held at the University of Nova Gorica, December 1-3, 2006
|
|
|
|
BLLDB
|
|
UB Frankfurt Linguistik
|
|
Show details
|
|
|
|