On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata
Theoretical Computer Science
On determinism versus nondeterminism for restarting automata
Information and Computation
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
Language and Automata Theory and Applications
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Information and Computation
A measure for the degree of nondeterminism of context-free languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Transductions computed by PC-systems of monotone deterministic restarting automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Czech-English phrase-based machine translation
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Correctness preservation and complexity of simple RL-automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Learning analysis by reduction from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Restarting automata with structured output and functional generative description
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On the gap-complexity of simple RL-Automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Unsupervised dependency parsing using reducibility and fertility features
WILS '12 Proceedings of the NAACL-HLT Workshop on the Induction of Linguistic Structure
Exploiting reducibility in unsupervised dependency parsing
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Automatic speech recognition for under-resourced languages: A survey
Speech Communication
| Hi-index | 0.00 |
This paper explains the principles of dependency analysis by reduction and its correspondence to the notions of dependency and dependency tree. The explanation is illustrated by examples from Czech, a language with a relatively high degree of word-order freedom. The paper sums up the basic features of methods of dependency syntax. The method serves as a basis for the verification (and explanation) of the adequacy of formal and computational models of those methods.