English Grammar Checker
Keywords:
Natural Language Processing, Context-Free-Grammar, CYK Algorithm, Part-of-Speech Tagging, Syntax ParsingAbstract
Language is the prime means of communication used by the individuals. It is the tool everyone uses to express the greater part of ideas and emotions. The usually poor quality of grammar leaves a bad impression on the reader. Therefore, there is a need for grammar checkers. We propose a grammar checking system by means of ‘Syntax Analysis’. [1][9]Syntax refers to the arrangement of words in a sentence and their relation with each other. The objective of syntactic analysis is to find syntactic structure of a grammar of a natural language. Natural language processing is an area of computer science and linguistics, concerned with the dealings amongst computers and human languages. It processes the data through lexical analysis, Syntax analysis and Semantic analysis. This paper gives various parsing methods. The algorithm specified in the paper splits the English sentences into parts using POS tagger and then parses these sentences using grammar rules of Natural language.
References
Earley Parser, https://en.wikipedia.org/wiki/Earley_parser, 27/11/2015
The Earley Parsing Algorithm, http://demo.clab.cs.cmu.edu/fa2014-11711/images/a/a6/Earley-Parsing.pdf , 27/11/2015
Kinoshita, J.; Salvador, L.N.; Menezes, C.E.D.; Silva, W.D.C., "CoGrOO - An OpenOffice Grammar Checker," in Intelligent Systems Design and Applications, 2007. ISDA 2007. Seventh International Conference on , vol., no., pp.525-530, 20-24Oct.2007 doi: 10.1109/ISDA.2007.145
Jaiswal, U.C.; Kumar, R.; Chandra, S., "A Structure Based Computer Grammar to Understand Compound-Complex, Multiple-Compound and Multiple-Complex English Sentences," in Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on , vol., no., pp.746-751, 28-29Dec.2009 doi:10.1109/ACT.2009.189
Lee, J.; Seneff, S., "An analysis of grammatical errors in non-native speech in English," in Spoken Language Technology Workshop, 2008. SLT 2008. IEEE , vol.,no.,pp.89-92,15-19Dec.2008 doi:10.1109/SLT.2008.4777847
Brian Roark (Oregon Health & Science University), Kristy Hollingshead (University of Maryland), Nathan Bodenstab (Oregon Health & Science University), “Finite-State Chart Constraints for Reduced Complexity Context-Free Parsing Pipelines”, in Journal: Computational Linguistics, Volume 38 Issue 4, December 2012, Pages 719-753 , doi:10.1162/COLI_a_00109
The CYK Algorithm, https://www.cs.wmich.edu/~elise/courses/cs6800/CYK-Algorithm.ppt, 16/11/2015
Earley parser.pdf - Computer Science and Engineering, www.cse.unt.edu/~tarau/teaching/NLP/Earley%20parser.pdf, 16/12/2015
M. A. Tayal, M. M. Raghuwanshi and L. Malik, "Syntax Parsing: Implementation Using Grammar-Rules for English Language," Electronic Systems, Signal Processing and Computing Technologies
(ICESC), 2014 International Conference on, Nagpur, 2014, pp. 376-381. doi: 10.1109/ICESC.2014.71
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
