Automated Answer Extraction for Reading Comprehension System Based on Matching Approach
Article Sidebar
-
Automated linguistic processing, Information Extraction (IE), Matching approach, Natural Language Processing (NLP), Natural Language Understanding (NLU), Question Answering (QA), Reading comprehension system (RCS)
Abstract
One of the Reading Comprehension (RC) tasks is inspired by the Information Extraction (IE) application to extract a set of features from a natural language text. Since reading comprehension tests were created to judge the reading ability of humans, there are challenges in using language understanding systems to extract information from comprehension stories. The questions and answer keys already exist in the story. The challenge is how to use the language understanding system to automatically find an answer for questions. The main target in this study is to review the matching approach of natural language processing techniques to extract information from reading comprehension; the information would be able to answer the WH questions of reading comprehension texts. The matching approach decomposed the story sentences and questions into a container of words that were augmented with additional automated linguistic processing, and then the answering engine stage was applied to the matching process after representing the information into a bag of words. Because the answer to a question must come from the given document, the story structure has to be examined in the context of responding to test questions. On WH questions, the experiment tested 15 children’s stories that contained 262 sentences (with an average of 18 sentences per story) and 75 WH questions. The result achieved was 67.3% human sent accuracy of the correct answer on the questions pertaining to the children’s stories.
Full text article
References
[1]-Shelza,Lalit, Priti Aggarwal, and Geetanjali Sharma, 2017. Questioning Answering Mechanism Using Natural Language Processing. InternationalJournal of Engineering and Computer Science (IJECS), https://www.ijecs.in, Volume 6 Issue 7, July 2017, 22020-22026,DOI: 10.18535/ijecs/v6i7.20.
[2]-Du, Y.P. and M. He, 2008. Multi-strategy to improve reading comprehensioncis International Conference on Computational Intelligence and Security, vol. 1, pp.86-89.
[3]-Du, Y.P., He, Ming, Ye and Naiwen, 2007. Mining the Semantic Information to Facilitate Reading Comprehension. In Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, Ed by Huang, D.S., Heutte, L. and Loog, M. Berlin / Heidelberg: Springer.
[4]-Arivuchelvan, K. M.; and Lakahmi, K.,2017. Reading comprehension system–a review.Indian J. Sci. Res, 2017, 14.1: 83-90.
[5]-Pakray, P., 2007. Multilingual restricted domain qa system with dialogue management department of computer science and engineering . Kolkata: Jadavpur University.
[6]-Rabiah, A.K., 2008. Question Answering for Reading Comprehension Using Logical Inference Model, Malaysia: University Kebangsaan Malaysia.
[7]-Lehnert, W.G., 1978. A conceptual theory of question answering. In Proceedings of the 5th International joint Conference on Artificial Intelligence USA: Morgan Kaufmann Publishers Inc.
[8]-Hirschman, L., M. Light, E. Breck and J.D. Burger, 1999. Deep Read: a reading comprehension system. In Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics.
[9]-Riloff, E. and M. Thelen, 2000. A rule-based question answering system for reading comprehension tests. Proceeding of the In ANLP/NAACL 2000 Workshop on Reading comprehension tests as evaluation for computer-based language understanding sytems Washington.
[10]-Ng, H.T., L.H. Teo and J.L.P. Kwan, 2000. A Machine Learning Approach to Answering Questions for Reading Comprehension Tests. Proceedings of the 2000 Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora (EMNLP/VLC-2000).
[11]-Charniak, E., et al., 2000. Reading comprehension programs in a statistical-language-processing class. Proceeding of the In ANLP/NAACL 2000 Workshop on Reading comprehension tests. Seattle:Washington: Association for Computational Linguistics.
[12]-Xu, K. and M. Helen, 2005b. Using verb dependency matching in a reading comprehension system. Infor. Retrieval Technol., 3411: 190-201.
[13]-Du,Y. M. Helen, X. Huang and L. Wu, 2005. The use of metadata, web-derived answer patterns and passage context to improve reading comprehension performance. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing. Vancouver, British Columbia, Canada.
[14]-Christy, A. and P. Thambidurai, 2008. A Tool for Efficient information extraction with soft matching rules for text mining. J. Comput. Sci. 4: 375-381.
[15]-Porter, M.F., 1980. An algorithm for suffix stripping. 14: 130-137.
[16]-Xu, K. and M. Helen, 2005a. Design and development of a bilingual reading omprehension Corpus. Int. J. Computational Linguistics Chinese Language Processing, 10: 251-276.
Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
In a brief statement, the rights relate to the publication and distribution of research published in the journal of the University of Sebha where authors who have published their articles in the journal of the university of Sebha should how they can use or distribute their articles. They reserve all their rights to the published works, such as (but not limited to) the following rights:
- Copyright and other property rights related to the article, such as patent rights.
- Research published in the journal of the University of Sebha and used in its future works, including lectures and books, the right to reproduce articles for their own purposes, and the right to self-archive their articles.
- The right to enter a separate article, or for a non-exclusive distribution of their article with an acknowledgment of its initial publication in the journal of Sebha University.
Privacy Statement The names and e-mail addresses entered on the Sabha University Journal site will be used for the aforementioned purposes only and for which they were used.