Efficient Rule-Based Grammar Checker with Word Sequencing

Abstract

A grammar checker is a program which is used to correct the grammar of a sentence or a paragraph. These days, informal writing (communication on social websites and chat applications) has gained a lot of popularity. In informal writing there is no requirement of grammar to be correct. However when we come to formal writing such as research papers, emails, patents etc. then it is required that, English written in these formal writings should be free of grammar errors. Moreover, error free text explains the idea or thought more clearly. In this thesis we present a rule-based grammar checker, which is capable of correcting the word order of a sentence in English language. Our tool first identifies the tense of the input sentence. For every tense we have different categories of sentences. Then based on the tense, it further categorizes the sentence into the category it belongs, and depending on the category of the sentence, corresponding function is called which corrects the sentence. The correction is done with the help of certain rules that we have defined for every category of sentence. The rules are based on the word order of the sentence. Our tool also incorporates the work of existing grammar checkers. This work further checks the grammar of the sentence. If the grammar of sentence is incorrect, then it is corrected after correcting the word order of the sentence. For evaluating the performance of our tool, we have compared it with already existing nine grammar checkers. Results show that the accuracy of our grammar checker is better than these grammar checkers. Moreover, our tool is able to correct the incorrect order of the sentence which in not done by the previous researchers.