{"id":2467,"date":"2021-07-04T20:19:47","date_gmt":"2021-07-04T14:49:47","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=2467"},"modified":"2021-07-04T20:25:59","modified_gmt":"2021-07-04T14:55:59","slug":"identifying-sentence-types-automatically","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2021\/07\/04\/identifying-sentence-types-automatically\/","title":{"rendered":"Identifying Sentence Types Automatically"},"content":{"rendered":"

Sentences in English<\/strong><\/em> can be classified into the following common types:<\/p>\n

– Simple sentence<\/strong><\/em> (“I am drinking coffee”)<\/p>\n

– Compound sentence<\/strong><\/em> (“He came home with his school friend and they had an enjoyable evening”)<\/p>\n

– Complex sentence<\/strong><\/em> (“Whenever my dog barks, I give him some biscuit”)<\/p>\n

– Imperative sentence<\/strong><\/em> (“Please keep quiet”)<\/p>\n

– Interrogative sentence<\/strong><\/em> (“Where did I park my car?”)<\/p>\n

As you can see from the example sentences, there is a distinct grammatical structure for each of the above types. The question now is, how easy is it to identify the type, given a sentence? I guess it is not too hard (note that I am not saying it is easy!) for humans to identify the type. But my interest is in identifying the type programmatically.<\/p>\n

Before I get into the details, I would like to make a reference to an article I wrote over a year ago – “Automatically Converting Active Voice to Passive Voice and Vice Versa”<\/strong><\/em><\/a>. That and the idea that I am discussing today both use traditional parsing (defining the grammar and parsing using DCG<\/strong><\/em>) technique. I am not using any Machine Learning<\/strong><\/em> algorithms in my implementation. I like this approach because I can learn so much in the process. Helping me here is “iLexicon”<\/strong><\/em>, a fairly comprehensive lexicon I have built over the years. It provides the parser with\u00a0<\/span>Part of speech<\/strong><\/em> information as well as the other constraints required for detecting valid English<\/strong><\/em> sentences.<\/p>\n

The top-level logic is contained in the following predicates:<\/p>\n

\"Top-level<\/a>
Top-level Predicates<\/strong><\/figcaption><\/figure>\n

The predicate “sentence_type(Sentence)”<\/strong><\/em> takes a sentence as input and prints the type of the sentence. To make the idea even more interesting, I am allowing the possibility of detecting the type of sentence fragments as well. This is handled by the predicate “sentence_part(SentencePart)”<\/strong><\/em>. This will be clear when you see some examples later.<\/p>\n

The finer details of mapping a valid parsed syntactic structure into the corresponding type is handled by a few auxiliary predicates:<\/p>\n

\"Helper<\/a>
Helper Predicates<\/strong><\/figcaption><\/figure>\n

The extreme case of a “sentence fragment”<\/em><\/strong> being just a single word is also taken into account. In this case, the predicate will print its possible parts of speech<\/strong><\/em>.<\/p>\n

You can see from the above listing, what sentence types, sentence fragments and parts of speech are supported.<\/p>\n

Let us take a look at some actual outputs. The first is categorization of complete sentences.<\/p>\n

\"Categorizing<\/a>
Categorizing Complete Sentences<\/strong><\/figcaption><\/figure>\n

Although both “compound”<\/strong><\/em> and “complex”<\/strong><\/em> sentences contain more than one verb, a compound sentence<\/strong><\/em> may be thought of as having two independent sentences\/clauses<\/strong><\/em>, whereas a complex sentence<\/strong><\/em> has a main clause<\/strong><\/em> and a dependent clause<\/strong><\/em>. The program has correctly identified the types. What is missing in the above is “Interrogative”<\/strong><\/em> type. The following shows that the program is able to detect different interrogative sentences:<\/p>\n

\"Detecting<\/a>
Detecting Interrogative Sentences<\/strong><\/figcaption><\/figure>\n

Note that not all interrogations involve “WH”<\/strong><\/em> type (see my earlier article on WH-Questions<\/strong><\/em><\/a>). An interrogative sentence can start with words such as “Can”, “Are”, “May”, “Would”<\/strong><\/em>, etc. I am not showing the other cases, for want of space.<\/p>\n

The next set of examples pertain to sentence fragments<\/strong><\/em>: phrases<\/strong><\/em> and clauses<\/strong><\/em>.<\/p>\n

\"Phrases\/Clauses\"<\/a>
Phrases\/Clauses<\/strong><\/figcaption><\/figure>\n

What about single words<\/strong><\/em>? The program can handle that as well:<\/p>\n

\"Handling<\/a>
Handling Single Words<\/strong><\/figcaption><\/figure>\n

I know I still have to account for more complex sentence structures (it is fairly good as it is) and it is thus an on-going project. The project uses Sicstus Prolog 4.6.0<\/strong><\/em><\/a> and runs on Windows 10 (64-bit).<\/p>\n

I hope to share more such experiments in the near future.<\/p>\n

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

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 keep quiet”) – Interrogative sentence […]<\/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_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_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},"jetpack_post_was_ever_published":false},"categories":[107,17,147],"tags":[286,203,148],"class_list":["post-2467","post","type-post","status-publish","format-standard","hentry","category-natural-language-processing","category-programming","category-prolog","tag-definte-clause-grammar","tag-english-grammar","tag-prolog"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-DN","jetpack-related-posts":[{"id":2483,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/07\/18\/sentence-negation\/","url_meta":{"origin":2467,"position":0},"title":"Sentence Negation","author":"admin","date":"July 18, 2021","format":false,"excerpt":"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\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":"Parse Tree","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/07\/parsetree-300x24.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/07\/parsetree-300x24.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/07\/parsetree-300x24.jpg?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":2467,"position":1},"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":[]},{"id":1889,"url":"https:\/\/www.rangakrish.com\/index.php\/2020\/02\/16\/automatically-converting-active-voice-to-passive-voice-and-vice-versa\/","url_meta":{"origin":2467,"position":2},"title":"Automatically Converting Active Voice to Passive Voice and Vice Versa","author":"admin","date":"February 16, 2020","format":false,"excerpt":"The iLexicon system can handle active\/passive voice conversion of fairly complex English sentences. I gave examples of the underlying verb conjugation mechanism in this article\u00a0and this one. Today, I am going to give examples of the conversion of complete sentences. Here is an example of active to passive voice conversion:\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":"The Core Conversion Logic","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2020\/02\/Code.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2020\/02\/Code.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2020\/02\/Code.jpg?resize=525%2C300&ssl=1 1.5x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2020\/02\/Code.jpg?resize=700%2C400&ssl=1 2x"},"classes":[]},{"id":1817,"url":"https:\/\/www.rangakrish.com\/index.php\/2019\/12\/08\/using-definite-clause-grammars-dcg-for-information-extraction\/","url_meta":{"origin":2467,"position":3},"title":"Using Definite Clause Grammars (DCG) for Information Extraction","author":"admin","date":"December 8, 2019","format":false,"excerpt":"In the previous article, I showed how we can use ATNs for extracting key information from natural language text. I also pointed out in that article that Definite Clause Grammars (DCG) are a more compact formalism for doing this. That will be the focus of today's article. For a nice\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":"Processing the Text","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/12\/Processing-file-code.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/12\/Processing-file-code.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/12\/Processing-file-code.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":541,"url":"https:\/\/www.rangakrish.com\/index.php\/2017\/06\/04\/definite-clause-grammars-in-lisp-part-2\/","url_meta":{"origin":2467,"position":4},"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":1792,"url":"https:\/\/www.rangakrish.com\/index.php\/2019\/11\/23\/using-augmented-transition-networks-atn-for-information-extraction\/","url_meta":{"origin":2467,"position":5},"title":"Using Augmented Transition Networks (ATN) for Information Extraction","author":"admin","date":"November 23, 2019","format":false,"excerpt":"After Wood\u2019s paper [1], Augmented Transition Networks\u00a0(ATN) became popular in the 1970s, for parsing text. An ATN is a generalized transition network with two major enhancements: Support for recursive transitions, including jumping to other ATNs Performing arbitrary actions when edges are traversed Remembering state through the use of registers See\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"ATN for Modality","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/11\/modality.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/11\/modality.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/11\/modality.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2467","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=2467"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/2467\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=2467"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=2467"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=2467"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}