Publication at Faculty of Mathematics and Physics |
2009
Abstract
This paper deals with restarting automata, which we use as a formal framework for modeling the Functional Generative Description of Czech. The proposed model of restarting automaton works simultaneously with four layers of language description; it is intended to carry out reductive analysis of Czech sentences, thus allowing to derive the dependency relations in the sentence of the possible order of reduction.
Standard model of restarting automaton is enriched with structured output, which allows to build tectogrammatical dependency structure derived from the reduction analysis.