Preprint
Degrees of Free Word-Order and Freely Rewriting Restarting Automata
Zusammenfassung
In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: 1. the degree of j-monotonicity, and 2. the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.
Zitieren
@article{urn:nbn:de:hebis:34-200604038969,
author={Mráz, František and Otto, Friedrich and Plátek, Martin},
title={Degrees of Free Word-Order and Freely Rewriting Restarting Automata},
year={2005}
}
0500 Oax 0501 Text $btxt$2rdacontent 0502 Computermedien $bc$2rdacarrier 1100 2005$n2005 1500 1/eng 2050 ##0##urn:nbn:de:hebis:34-200604038969 3000 Mráz, František 3010 Otto, Friedrich 3010 Plátek, Martin 4000 Degrees of Free Word-Order and Freely Rewriting Restarting Automata / Mráz, František 4030 4060 Online-Ressource 4085 ##0##=u http://nbn-resolving.de/urn:nbn:de:hebis:34-200604038969=x R 4204 \$dPreprint 4170 Mathematische Schriften Kassel 7136 ##0##urn:nbn:de:hebis:34-200604038969
2006-04-03T13:36:10Z 2006-04-03T13:36:10Z 2005 urn:nbn:de:hebis:34-200604038969 http://hdl.handle.net/123456789/200604038969 265248 bytes application/pdf eng Universität Kassel, FB 17, Mathematik/Informatik Urheberrechtlich geschützt https://rightsstatements.org/page/InC/1.0/ Theoretische Informatik Restart-Automaten Rewriting Restarting Automata 004 Degrees of Free Word-Order and Freely Rewriting Restarting Automata Preprint In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: 1. the degree of j-monotonicity, and 2. the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity. open access Mráz, František Otto, Friedrich Plátek, Martin Mathematische Schriften Kassel 05, 05 Mathematische Schriften Kassel 05, 05
Die folgenden Lizenzbestimmungen sind mit dieser Ressource verbunden:
:Urheberrechtlich geschützt