We present an approach to text simplification based on synchronous dependency grammars. The higher level of abstraction afforded by dependency representations allows for a linguistically sound treatment of complex constructs requiring reordering and morphological change, such as conversion of passive voice to active. We present a synchronous grammar formalism in which it is easy to write rules by hand and also acquire them automatically from dependency parses of aligned English and Simple English sentences. The grammar formalism is optimised for monolingual translation in that it reuses ordering information from the source sentence where appropriate. We demonstrate the superiority of our approach over a leading contemporary system based on quasi-synchronous tree substitution grammars, both in terms of expressivity and performance.
|Title of host publication||Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014)|
|Publisher||Association for Computational Linguistics|
|Number of pages||10|
|Publication status||Published - 2014|
Siddharthan, A., & Mandya, A. A. (2014). Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014) (pp. 722-731). Association for Computational Linguistics. http://anthology.aclweb.org/E/E14/E14-1076.pdf