Dependency parsing with an extended finite state approach
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
A cognitive cost model of annotations based on eye-tracking data
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
ULISSE: an unsupervised algorithm for detecting reliable dependency parses
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
READ-IT: assessing readability of Italian texts with a view to text simplification
SLPAT '11 Proceedings of the Second Workshop on Speech and Language Processing for Assistive Technologies
The efficacy of human post-editing for language translation
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
| Hi-index | 0.00 |
The objective of this paper is to formalize the intnition about the complexity of syntactic structures. We propose a definition of structural complexity such that sentences ranked by our definition as more complex are generally more difficult for humans to process. We justify the definition by showing how it is able to account for several seemingly unrelated phenomena in natural languages.