Text simplification explained

Text simplification is an operation used in natural language processing to change, enhance, classify, or otherwise process an existing body of human-readable text so its grammar and structure is greatly simplified while the underlying meaning and information remain the same. Text simplification is an important area of research because of communication needs in an increasingly complex and interconnected world more dominated by science, technology, and new media. But natural human languages pose huge problems because they ordinarily contain large vocabularies and complex constructions that machines, no matter how fast and well-programmed, cannot easily process. However, researchers have discovered that, to reduce linguistic diversity, they can use methods of semantic compression to limit and simplify a set of words used in given texts.

Example

Text simplification is illustrated with an example used by Siddharthan (2006).[1] The first sentence contains two relative clauses and one conjoined verb phrase. A text simplification system aims to change the first sentence into a group of simpler sentences, as seen just below the first sentence.

One approach to text simplification is lexical simplification via lexical substitution, a two-step process of first identifying complex words and then replacing them with simpler synonyms. A key challenge here is identifying complex words, which is performed by a machine learning classifier trained on labeled data. Researchers, frustrated by the problems with using the classical method of asking research subjects to describe words as either simple or complex, have discovered that they can get a higher consistency in more levels of complexity if they ask labelers to sort words presented to them in order of complexity.[2]

See also

References

External links

Notes and References

  1. Siddharthan . Advaith . Syntactic Simplification and Text Cohesion . Research on Language and Computation . 28 March 2006 . 4 . 1 . 77–109 . 10.1007/s11168-006-9011-1 . 14619244 .
  2. Gooding . Sian . Kochmar . Ekaterina . Sarkar . Advait . Blackwell . Alan . Comparative judgments are more consistent than binary classification for labelling word complexity . Proceedings of the 13th Linguistic Annotation Workshop . August 2019 . 208–214 . 10.18653/v1/W19-4024 . 22 November 2019 . en-us. free .