The Open UniversitySkip to content

Lexico-syntactic Text Simplification And Compression With Typed Dependencies

Mandya, Angrosh Annayappan; Nomoto, Tadashi and Siddharthan, Advaith (2014). Lexico-syntactic Text Simplification And Compression With Typed Dependencies. In: Proceedings of the 25th International Conference on Computational Linguistics (Tounsi, Lamia and Rak, Rafal eds.), ACL, Stroudsburg PA, pp. 1996–2006.

Full text available as:
PDF (Version of Record) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (447kB) | Preview
Google Scholar: Look up in Google Scholar


We describe two systems for text simplification using typed dependency structures, one that performs lexical and syntactic simplification, and another that performs sentence compression optimised to satisfy global text constraints such as lexical density, the ratio of difficult words, and text length. We report a substantial evaluation that demonstrates the superiority of our systems, individually and in combination, over the state of the art, and also report a comprehension based evaluation of contemporary automatic text simplification systems with target non-native readers.

Item Type: Conference or Workshop Item
Copyright Holders: 2014 The Authors
ISBN: 1-63439-196-9, 978-1-63439-196-2
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Related URLs:
Item ID: 58891
Depositing User: Advaith Siddharthan
Date Deposited: 01 Feb 2019 13:13
Last Modified: 29 Mar 2019 20:16
Share this page:

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU