{"id":1863,"date":"2020-01-02T15:49:21","date_gmt":"2020-01-02T10:19:21","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=1863"},"modified":"2020-01-02T15:49:21","modified_gmt":"2020-01-02T10:19:21","slug":"book-review-automatic-text-simplification","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2020\/01\/02\/book-review-automatic-text-simplification\/","title":{"rendered":"Book Review – Automatic Text Simplification"},"content":{"rendered":"

Title:<\/span> Automatic Text Simplification<\/strong><\/em><\/p>\n

Author:<\/span> Horacio Saggino<\/strong><\/em><\/p>\n

Publisher:<\/span> Morgan & Claypool Publishers<\/strong><\/em><\/p>\n

Year:<\/span> 2017<\/strong><\/em><\/p>\n

\"Automatic<\/a>
Book Cover Image<\/strong><\/figcaption><\/figure>\n

Automatic Text Simplification<\/strong><\/em> is an active area of research in NLP and has been going on for over 20 years. The idea is to transform a given text T1<\/strong><\/em> into text T2<\/strong><\/em> such that T2<\/strong><\/em> is easier to read and understand compared to T1<\/strong><\/em>, while conveying the same information as T1<\/strong><\/em>. This is different from Text Paraphrasing<\/strong><\/em><\/a>, which does not guarantee that the target text is easier to understand compared to the original version. Finally, both of these are different from Text Summarization<\/strong><\/em><\/a>.\u00a0<\/span><\/p>\n

The first two chapters lay the foundation for later chapters. After introducing the idea of text simplification, the author touches upon the notion of text readability<\/strong><\/em> and discusses a few classic readability formulas<\/strong><\/em>, including Flesch Reading Ease Score<\/strong><\/em> and SMOG<\/strong><\/em> readability score. He then outlines more recent approaches, including languages models for readability assessment, as well as treating it as a classification problem.<\/p>\n

The third chapter focuses on lexical simplification<\/strong><\/em>. The idea here is to replace difficult<\/strong><\/em> words in the text with easier-to-understand<\/strong><\/em> words or phrases that mean the same. One of the initial approaches used WordNet<\/strong><\/em><\/a>\u00a0along with the word\u2019s frequency count to find an appropriate replacement for a difficult word. Later approaches made use of corpora such as the Simple English Wikipedia<\/strong><\/em><\/a>\u00a0and the regular English Wikipedia<\/strong><\/em><\/a>, combined with machine learning techniques to arrive at suitable lexical substitution rules. An interesting category of simplification involves handling arithmetic expressions. There is a brief discussion on LexSis<\/strong><\/em> system, a lexical simplification system for Spanish<\/strong><\/em>.<\/p>\n

The next chapter is on syntactic simplification<\/strong><\/em>, a much more challenging approach. Whereas lexical simplification ignores the grammatical structure of the sentences in the text, syntactic simplification attempts to replace complicated syntactic phenomena (relative clauses<\/strong><\/em>, subordination<\/strong><\/em>, etc.) with simpler phrases. One system discussed in this section uses a Java<\/strong><\/em>-based pattern matching engine, working on the dependency parse structure, to identify sentence fragments that require transformation. A variant of this approach, also rule-based, uses event extraction<\/strong><\/em> to determine key elements of a sentence and then applies a generation step to transform the resulting structure.<\/p>\n

Chapter 5 talks about applying Machine Learning<\/strong><\/em> techniques to discover text simplification rules from original and simplified text corpora. One approach treats simplification as monolingual<\/strong><\/em> machine translation using a well-established statistical framework. Another interesting approach attempts to apply a sequence of pre-defined operations namely, splitting<\/strong><\/em>, dropping<\/strong><\/em>, reordering<\/strong><\/em>, and dropping<\/strong><\/em> to the input parse tree to produce the simplified text. When multiple such sequence transformations exist, the system tries to find the best<\/strong><\/em> sequence. While both the above are pure syntax-based systems, other researchers have added semantic constraints to improve the quality of simplification.<\/p>\n

Chapter 6 briefly discusses three text simplification systems: PSET<\/strong><\/em> (English), Simplext<\/strong><\/em> (Spanish) and PorSimples<\/strong><\/em> (Brazilian Portuguese).<\/p>\n

What are the applications of automatic text simplification? Chapter 7 addresses this important question. An important use case is assisting people with special needs, such as those suffering from Dyslexia<\/strong><\/em> and Autism Spectrum Disorder<\/strong><\/em> (ASD<\/strong><\/em>). The other use case is\u00a0NLP facilitator<\/strong><\/em>, where simplification is performed prior to other steps such as Parsing<\/strong><\/em>, Information Extraction<\/strong><\/em> or Summarization<\/strong><\/em>.\u00a0<\/span><\/p>\n

For those interested in building text simplification systems, Chapter 8 provides a fairly comprehensive list of resources, including datasets and tools.<\/p>\n

One thing I like very much about this book is its extensive bibliography, running to 23 pages! This will be immensely useful to those who would like to pursue further research in this area. Since the book provides a good overview of the field\u00a0of automatic text simplification, I strongly recommend it to everyone interested in this area.<\/p>\n

Have a wonderful New Year 2020!<\/strong><\/em><\/p>\n","protected":false},"excerpt":{"rendered":"

Title: Automatic Text Simplification Author: Horacio Saggino Publisher: Morgan & Claypool Publishers Year: 2017 Automatic Text Simplification is an active area of research in NLP and has been going on for over 20 years. The idea is to transform a given text T1 into text T2 such that T2 is easier to read and understand […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[94,107],"tags":[224],"class_list":["post-1863","post","type-post","status-publish","format-standard","hentry","category-book-review","category-natural-language-processing","tag-automatic-text-simplification"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-u3","jetpack-related-posts":[{"id":1870,"url":"https:\/\/www.rangakrish.com\/index.php\/2020\/01\/19\/experimenting-with-text-simplification\/","url_meta":{"origin":1863,"position":0},"title":"Experimenting with Text Simplification","author":"admin","date":"January 19, 2020","format":false,"excerpt":"After my last book review, I decided to check out a few websites that claim to simplify English text and\/or help compute the measure of readability. In today\u2019s post, I am sharing the results of my experiment. www.simplish.org This site has some interesting functionality. It does spelling check, grammar check,\u2026","rel":"","context":"In "Natural Language Processing"","block_context":{"text":"Natural Language Processing","link":"https:\/\/www.rangakrish.com\/index.php\/category\/natural-language-processing\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":198,"url":"https:\/\/www.rangakrish.com\/index.php\/2016\/04\/08\/c14-return-type-deduction-for-normal-functions\/","url_meta":{"origin":1863,"position":1},"title":"C++14: Return Type Deduction for Normal Functions","author":"admin","date":"April 8, 2016","format":false,"excerpt":"In C++11, a function must specify its return type in one of the following two ways: int aFunction(int arg) { \u00a0 \u00a0 return arg * 2; } (or) auto aFunction(int arg) -> int { \u00a0 \u00a0 return arg * 2; } The first is the classic function definition syntax. The\u2026","rel":"","context":"In "C++"","block_context":{"text":"C++","link":"https:\/\/www.rangakrish.com\/index.php\/category\/c\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":3343,"url":"https:\/\/www.rangakrish.com\/index.php\/2024\/02\/21\/using-similarity-search-in-homeopathy-repertorization-software-part-2\/","url_meta":{"origin":1863,"position":2},"title":"Using Similarity Search in Homeopathy Repertorization Software – Part 2","author":"admin","date":"February 21, 2024","format":false,"excerpt":"In my earlier article, I had explained how natural language text describing a symptom can be converted to a formal \u201crubric\u201d by using a vector database. In today\u2019s article, I will show how this can be extended to support multiple symptoms in the input text with automatic repertorisation to identify\u2026","rel":"","context":"In "Homeopathy"","block_context":{"text":"Homeopathy","link":"https:\/\/www.rangakrish.com\/index.php\/category\/homeopathy\/"},"img":{"alt_text":"Example Case - 1","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2024\/02\/case1-300x217.png?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2024\/02\/case1-300x217.png?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2024\/02\/case1-300x217.png?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":2986,"url":"https:\/\/www.rangakrish.com\/index.php\/2023\/01\/11\/book-review-adventures-in-rule-based-programming-a-clips-tutorial\/","url_meta":{"origin":1863,"position":3},"title":"Book Review: Adventures in Rule-Based Programming – A CLIPS Tutorial","author":"admin","date":"January 11, 2023","format":false,"excerpt":"Title: Adventures in Rule-Based Programming - A CLIPS Tutorial Author: Gary Riley Publisher: Secret Society Software, LLC Year: 2022 In an earlier article, I had talked about the relevance of Rule-based systems today. In that article I had also listed a few Rule engines that are popular and widely used.\u2026","rel":"","context":"In "Knowledge Representation"","block_context":{"text":"Knowledge Representation","link":"https:\/\/www.rangakrish.com\/index.php\/category\/knowledge-representation\/"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/01\/Cover-188x300.png?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":3249,"url":"https:\/\/www.rangakrish.com\/index.php\/2023\/11\/06\/book-review-c-initialization-story\/","url_meta":{"origin":1863,"position":4},"title":"Book Review: C++ Initialization Story","author":"admin","date":"November 6, 2023","format":false,"excerpt":"Title: C++ Initialization Story - A Guide Through All Initialization Options and Related C++ Areas Author: Bart\u0142omiej Filipek Publisher: Leanpub Year: 2023 Can you believe that there is a language where \u201cinitialization\u201d itself involves many subtleties and a whole book can be devoted to this topic? Yes, modern C++ is\u2026","rel":"","context":"In "Book Review"","block_context":{"text":"Book Review","link":"https:\/\/www.rangakrish.com\/index.php\/category\/book-review\/"},"img":{"alt_text":"","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Book-cover-231x300.png?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":190,"url":"https:\/\/www.rangakrish.com\/index.php\/2016\/03\/15\/book-review-common-lisp-recipes-by-edi-weitz\/","url_meta":{"origin":1863,"position":5},"title":"Book Review: Common Lisp Recipes – A Problem-Solution Approach","author":"admin","date":"March 15, 2016","format":false,"excerpt":"Last Saturday (March 12, 2016), I got my most eagerly awaited book from Amazon.com. Yes, I am talking about Common Lisp Recipes: A Problem-Solution Approach\u00a0authored by Dr.Edmund Weitz. Of course, if you have been programming in Lisp for a couple of years, you would have definitely heard of Dr.Edi Weitz,\u2026","rel":"","context":"In "Book Review"","block_context":{"text":"Book Review","link":"https:\/\/www.rangakrish.com\/index.php\/category\/book-review\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/1863","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/comments?post=1863"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/1863\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=1863"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=1863"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=1863"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}