Eve: An Automated Question Answering System for Events Information
DOI:
https://doi.org/10.21512/comtech.v8i1.3781Keywords:
closed domain, question answering system, event informationAbstract
The objective of this research was to create a closed-domain of automated question answering system specifically for events called Eve. Automated Question Answering System (QAS) is a system that accepts question input in the form of natural language. The question will be processed through modules to finally return the most appropriate answer to the corresponding question instead of returning a full document as an output. Thescope of the events was those which were organized by Students Association of Computer Science (HIMTI) in Bina Nusantara University. It consisted of 3 main modules namely query processing, information retrieval, and information extraction. Meanwhile, the approaches used in this system included question classification, document indexing, named entity recognition and others. For the results, the system can answer 63 questions for word matching technique, and 32 questions for word similarity technique out of 94 questions correctly.
Plum Analytics
References
Bhatia, P., Madaan, R., Sharma, A. K., & Dixit, A. (2015).
A comparison study of question answering systems. Journal of Network Communications and Emerging Technologies, 5(2), 192-198
Buscaldi, D., Rosso, P., Gómez-Soriano, J. M., & Sanchis, E. (2010). Answering questions with an n-gram based passage retrieval engine. Journal of Intelligent Information Systems, 34(2), 113-134.
Craswell, N. (2009). Encyclopedia of database systems: Mean Reciprocal Rank. US: Springer.
Hartawan, A., & Suhartono, D. (2015). Using Vector Space
Model in Question Answering System. Procedia Computer Science, 59, 305-311.
Islam, A., Milios, E., & Kešelj, V. (2012). Comparing word relatedness measures based on Google n-grams. Proceedings of COLING 2012: Posters, 495–506.
Jurafsky, D., & Martin, J. H. (2008). Speech and language
processing. Englewood Cliffs: Prentice Hall
Kaur, H., & Rimpi. (2013). A review on novel scoring system for identify accurate answers for factoid questions. International Journal of Science and Research (IJSR), 2(9), 154-157.
Mollá, D. (2009). From minimal logical forms for answer extraction to logical graphs for question answering. In Searching answers: Festschrift in Honour of Michael Hess on the Occasion of His 60th Birthday (pp. 101-108).
Mollá, D., Van Zaanen, M., & Cassidy, S. (2007). Named entity recognition in question answering of speech data. In Proceedings of the Australasian Language Technology Workshop (pp. 57-65).
Rinaldi, F., Dowdall, J., Kaljurand, K., Hess, M., & Mollá, D. (2003, July). Exploiting paraphrases in a Question Answering System. In Proceedings of the second international workshop on Paraphrasing-Volume 16 (pp.25-32). Association for Computational Linguistics.
Russell, S., & Norvig, P. (2010). Artificial intelligence: A
modern approach (3rd ed.). New Jersey: Prentice Hall.
Salahli, M. A. (2009). An approach for measuring semantic
relatedness between words via related terms. Mathematical and Computational Applications, 14(1), 55-64.
Stoyanchev, S., Song, Y. C., & Lahti, W. (2008, August). Exact phrases in information retrieval for question answering. In Coling 2008: Proceedings of the 2nd workshop on Information Retrieval for Question Answering (pp. 9-16). Association for Computational Linguistics.
Zulen, A. A., & Purwarianti, A. (2011). Study and Implementation of Monolingual Approach on Indonesian Question Answering for Factoid and Non-Factoid Question. In 25th Pacific Asia Conference on Language, Information and Computation (pp. 622-
.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows:
