Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules

Advaith Siddharthan, Angrosh Annayappan Mandya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

26 Citations (Scopus)
28 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014)
PublisherAssociation for Computational Linguistics
Pages722-731
Number of pages10
Publication statusPublished - 2014

Fingerprint

Substitution reactions
Acoustic waves

Cite this

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.

Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules. / Siddharthan, Advaith; Mandya, Angrosh Annayappan.

Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014). Association for Computational Linguistics, 2014. p. 722-731.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Siddharthan, A & Mandya, AA 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). Association for Computational Linguistics, pp. 722-731.
Siddharthan A, Mandya AA. 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). Association for Computational Linguistics. 2014. p. 722-731
Siddharthan, Advaith ; Mandya, Angrosh Annayappan. / Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules. Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014). Association for Computational Linguistics, 2014. pp. 722-731
@inproceedings{3579ab43cc2b4c8ca22e4fbd53a7720e,
title = "Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules",
abstract = "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.",
author = "Advaith Siddharthan and Mandya, {Angrosh Annayappan}",
year = "2014",
language = "English",
pages = "722--731",
booktitle = "Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014)",
publisher = "Association for Computational Linguistics",

}

TY - GEN

T1 - Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules

AU - Siddharthan, Advaith

AU - Mandya, Angrosh Annayappan

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 722

EP - 731

BT - Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014)

PB - Association for Computational Linguistics

ER -