Reviewing Techniques For Automatic Response Grading Via Language Processing
Simran Agrawal1, Avinash J. Agrawal2
1Simran Agrawal Bachelor of Engineering, Degree in Computer Science and Engineering, from Shri Balaji Institute of Science and Technology, Rajiv Gandhi Proudyogiki Vishwavidyalaya University, Betul (M.P), India.
2Dr. Avinash J. Agrawal Received Bachelor of Engineering, Degree in Computer Technology from Nagpur University, India and Master of Technology degree in Computer Technology from National Institute of Technology, Raipur (Chhattisgarh) India.
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1415-1420 | Volume-8 Issue-7, May 2019 | Retrieval Number: G5591058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Automatic grading of student answers via natural language processing is a boon for the faculties and educational system in both technical and non-technical fields. It helps the students to get their document evaluation done irrespective of the state of mind of the examiner, and also helps in speeding up the process for grading, and eventually saving a lot of time and effort for the overall examination process. In this paper we have analyzed various methods which are useful in automatic grading of student answers (both long and short), most of them are based on mathematical variations in natural language processing techniques. Via this text we aim to assist researchers to decide which kind of base methods can be used in which kind of document scenarios, so that it helps them in selection of algorithms based on the input type, and speedup their macro-level research.
Keyword: Document, Grading, Response, Natural, Language, Answers
Scope of the Article: Natural Language Processing.