27th International Conference on Computational Linguistics, COLING 2018 : Proceedings of the conference : August 20-26, 2018, Santa Fe, New Mexico, USA
Seitenbereich:
318-330
Veranstaltungstitel:
27th International Conference on Computational Linguistics
Complexity of texts is usually assessed only at the lexical and syntactic levels. Although it is known that conceptual complexity plays a significant role in text understanding, no attempts have been made at assessing it automatically. We propose to automatically estimate the conceptual complexity of texts by exploiting a number of graph-based measures on a large knowledge base. By using a high-quality language learners corpus for English, we show that graph-based measures of individual text concepts, as well as the way they relate to each other in the knowledge graph, have a high discriminative power when distinguishing between two versions of the same text. Furthermore, when used as features in a binary classification task aiming to choose the simpler of two versions of the same text, our measures achieve high performance even in a default setup.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.
Creative Commons Namensnennung 4.0 International (CC BY 4.0)
Suche Autoren in