guest ::
| Home > Conference materials > Papers > Lexicalized Syntactic Analysis by Restarting Automata |
Original title:
Lexicalized Syntactic Analysis by Restarting Automata
Authors: Mráz, F. ; Otto, F. ; Pardubská, D. ; Plátek, Martin
Document type: Papers
Conference/Event: Prague Stringology Conference 2019, Prague (CZ), 20190826
Year: 2019
Language: eng
Abstract: 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.
Keywords: h-lexicalization; lexical disambiguation; Restarting automaton
Project no.: GA19-05704S (CEP)
Funding provider: GA ČR
Host item entry: Proceedings of the Prague Stringology Conference 2019, ISBN 978-80-01-06618-8
Institution: Institute of Computer Science AS ČR (web)
Document availability information: Fulltext is available at external website.
External URL: http://www.stringology.org/papers/PSC2019.pdf
Original record: http://hdl.handle.net/11104/0303097
Permalink: http://www.nusl.cz/ntk/nusl-408971
The record appears in these collections:
Research > Institutes ASCR > Institute of Computer Science
Conference materials > Papers
Authors: Mráz, F. ; Otto, F. ; Pardubská, D. ; Plátek, Martin
Document type: Papers
Conference/Event: Prague Stringology Conference 2019, Prague (CZ), 20190826
Year: 2019
Language: eng
Abstract: 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.
Keywords: h-lexicalization; lexical disambiguation; Restarting automaton
Project no.: GA19-05704S (CEP)
Funding provider: GA ČR
Host item entry: Proceedings of the Prague Stringology Conference 2019, ISBN 978-80-01-06618-8
Institution: Institute of Computer Science AS ČR (web)
Document availability information: Fulltext is available at external website.
External URL: http://www.stringology.org/papers/PSC2019.pdf
Original record: http://hdl.handle.net/11104/0303097
Permalink: http://www.nusl.cz/ntk/nusl-408971
The record appears in these collections:
Research > Institutes ASCR > Institute of Computer Science
Conference materials > Papers
Record created 2020-01-13, last modified 2023-12-06