{"id":2483,"date":"2021-07-18T10:24:43","date_gmt":"2021-07-18T04:54:43","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=2483"},"modified":"2021-07-18T10:24:43","modified_gmt":"2021-07-18T04:54:43","slug":"sentence-negation","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2021\/07\/18\/sentence-negation\/","title":{"rendered":"Sentence Negation"},"content":{"rendered":"

In the last article<\/strong><\/em><\/a>, I talked about determining sentence types automatically. Another interesting task is to generate the “negation”<\/strong><\/em> of a given sentence.<\/p>\n

Example-1:<\/p>\n

Sentence => “My teacher lives nearby”<\/p>\n

Negation => “My teacher does not live nearby”<\/p>\n

Example-2:<\/p>\n

Sentence => “She did not like that speech”<\/p>\n

Negation => “She liked that speech”<\/p>\n<\/blockquote>\n

I have implemented this idea using “iLexicon”<\/strong><\/em> and a DCG<\/strong><\/em>-based parser for English Grammar in Sicstus Prolog<\/strong><\/em>.<\/p>\n

The parser first parses the given sentence and emits a “parse tree”<\/strong><\/em>. The sentence Negator<\/strong><\/em> then manipulates the parse tree and derives the negation of the given sentence.<\/p>\n

For example, the sentence “Jack teaches at Harvard”<\/strong><\/em> results in the following parse tree:<\/p>\n

\"Parse<\/a>
Parse Tree<\/strong><\/figcaption><\/figure>\n

It can be visualized as follows:<\/p>\n

\"Visualizing<\/a>
Visualizing Parse Tree<\/strong><\/figcaption><\/figure>\n

The sentence Negator<\/strong><\/em> applies various rules and patterns to detect the appropriate Verb<\/strong><\/em> and handle its negation.<\/p>\n

The top-level logic can be expressed thus:<\/p>\n

\"Top-Level<\/a>
Top-Level Logic<\/strong><\/figcaption><\/figure>\n

The actual negation depends on the sentence type, for example is it\u00a0 <\/span>“declarative”<\/strong><\/em> or “imperative”,<\/strong><\/em> and so on.<\/p>\n

A part of the core patterns that apply to “declarative”<\/strong><\/em> sentences is shown here:<\/p>\n

\"Handling<\/a>
Handling Declarative Sentence<\/strong><\/figcaption><\/figure>\n

Similarly, “imperative”<\/strong><\/em> sentences are handled this way:<\/p>\n

\"Handling<\/a>
Handling Imperative Sentence<\/strong><\/figcaption><\/figure>\n

Here I have shown just a few of the possible patterns.<\/p>\n

Let us look at some actual outputs. First, some declarative sentences:<\/p>\n

\"Example<\/a>
Example Output<\/strong><\/figcaption><\/figure>\n

What about sentences that contain negation?<\/p>\n

\"Handling<\/a>
Handling Negative Sentences<\/strong><\/em><\/figcaption><\/figure>\n

Here are some examples of imperative sentences:<\/p>\n

\"Imperative<\/a>
Imperative Sentences<\/strong><\/figcaption><\/figure>\n

Once we parse a sentence and obtain its “syntactic structure”<\/strong><\/em>, it is possible to analyze and manipulate the structure to suit our requirements.<\/p>\n

Have a great weekend!<\/p>\n","protected":false},"excerpt":{"rendered":"

In the last article, I talked about determining sentence types automatically. Another interesting task is to generate the “negation” of a given sentence. Example-1: Sentence => “My teacher lives nearby” Negation => “My teacher does not live nearby” Example-2: Sentence => “She did not like that speech” Negation => “She liked that speech” I have […]<\/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":[107,17,147],"tags":[101,287,151],"class_list":["post-2483","post","type-post","status-publish","format-standard","hentry","category-natural-language-processing","category-programming","category-prolog","tag-definite-clause-grammar","tag-sentence-negation","tag-sicstus-prolog"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-E3","jetpack-related-posts":[{"id":1843,"url":"https:\/\/www.rangakrish.com\/index.php\/2019\/12\/22\/distributed-computing-with-linda\/","url_meta":{"origin":2483,"position":0},"title":"Distributed Computing with Linda","author":"admin","date":"December 22, 2019","format":false,"excerpt":"Linda, originally proposed by Nicholas Carriero and David Gelernter, is a model of process communication using a small set of well-defined primitives, operating on a tuple space.\u00a0 Interestingly, Sicstus Prolog\u00a0comes with a library that implements Linda (both Server and Client).\u00a0 I played with it a little bit and really enjoyed\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"The Simple Client","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/12\/Simple-client-source.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":541,"url":"https:\/\/www.rangakrish.com\/index.php\/2017\/06\/04\/definite-clause-grammars-in-lisp-part-2\/","url_meta":{"origin":2483,"position":1},"title":"Definite Clause Grammars in Lisp – Part 2","author":"admin","date":"June 4, 2017","format":false,"excerpt":"In the last post, I showed how we can implement DCGs in LispWorks using the KnowledgeWorks package. The grammar discussed in that post did not take into account subject\/predicate number agreement. This is one of the basic constraints in English grammar. Today I will show how easy it is to\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Prolog Grammar","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2017\/06\/Prolog-Grammar.png?resize=350%2C200","width":350,"height":200},"classes":[]},{"id":2832,"url":"https:\/\/www.rangakrish.com\/index.php\/2022\/06\/12\/definite-clause-grammars-in-lisp-part-4\/","url_meta":{"origin":2483,"position":2},"title":"Definite Clause Grammars in Lisp – Part 4","author":"admin","date":"June 12, 2022","format":false,"excerpt":"In a series of articles\u00a0written earlier, I had shown how it is possible to model Definite Clause Grammars (DCG) in LispWorks Lisp (Enterprise Edition). We use defgrammar\u00a0in Common Prolog (available as part of KnowledgeWorks package) to define our grammar rules. Here is a toy English grammar represented using defgrammar: This\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"DCG Using Defgrammar","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":2467,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/07\/04\/identifying-sentence-types-automatically\/","url_meta":{"origin":2483,"position":3},"title":"Identifying Sentence Types Automatically","author":"admin","date":"July 4, 2021","format":false,"excerpt":"Sentences in English can be classified into the following common types: - Simple sentence (\"I am drinking coffee\") - Compound sentence (\"He came home with his school friend and they had an enjoyable evening\") - Complex sentence (\"Whenever my dog barks, I give him some biscuit\") - Imperative sentence (\"Please\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":"Top-level Predicates","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/07\/code-300x233.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":1285,"url":"https:\/\/www.rangakrish.com\/index.php\/2018\/12\/09\/parsing-text-with-meaningclouds-text-analytics-api\/","url_meta":{"origin":2483,"position":4},"title":"Parsing Text with MeaningCloud’s Text Analytics API","author":"admin","date":"December 9, 2018","format":false,"excerpt":"There is wide-spread interest in Natural Language Processing (NLP) today, and there are several API services available to cater to this demand. See this article for a fairly detailed list of services. All of them support multiple languages, including English. Today, I am going to share my experience in working\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Get Words Function","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/12\/Get-words.png?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/12\/Get-words.png?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/12\/Get-words.png?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":534,"url":"https:\/\/www.rangakrish.com\/index.php\/2017\/05\/22\/definite-clause-grammars-dcg-in-lisp\/","url_meta":{"origin":2483,"position":5},"title":"Definite Clause Grammars (DCG) in Lisp","author":"admin","date":"May 22, 2017","format":false,"excerpt":"Definite Clause Grammars (DCG) are an elegant formalism for specifying context free grammars, and part of their popularity is due to their support in the Prolog language. Most books on Natural Language processing usually include a brief coverage of DCGs, even though Natural languages are not context-free. Because of the\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"DCG Grammar","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2017\/05\/DCG-Grammar.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2017\/05\/DCG-Grammar.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2017\/05\/DCG-Grammar.png?resize=525%2C300 1.5x"},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2483","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=2483"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2483\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=2483"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=2483"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=2483"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}