Sorted dependency insertion grammars
Theoretical Computer Science - Algebraic methods in language processing
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Correctness preservation and complexity of simple RL-automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Modeling syntax of free word-order languages: dependency analysis by reduction
TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
| Hi-index | 0.00 |
Restarting automata were introduced for modeling linguistically motivated analysis by reduction. In this paper we enhance these automata with a structured output in the form of a tree. Enhanced restarting automata can serve as a formal framework for the Functional Generative Description. In this framework, a natural language is described at four layers. Working simultaneously with all these layers, tectogrammatical dependency structures that represent the meaning of the sentence are derived.