Parsing struktur semantik soal cerita matematika berbahasa indonesia menggunakan recursive neural network

Authors

  • Agung Prasetya Institut Teknologi Sepuluh Nopember, Surabaya
  • Chastine Fatichah Institut Teknologi Sepuluh Nopember, Surabaya
  • Umi Laili Yuhana Institut Teknologi Sepuluh Nopember, Surabaya

DOI:

https://doi.org/10.26594/register.v5i2.1537

Keywords:

parsing, pohon biner, Recursive Neural Network, soal cerita, struktur semantik, binary tree, math word problem, semantic structure

Abstract

Soal cerita berperan penting untuk kemajuan pengembangan kecerdasan buatan. Hal ini karena penyelesaian soal cerita melibatkan pengembangan sebuah sistem yang mampu memahami bahasa alami. Pembentukan sistem penyelesaian soal memerlukan mekanisme untuk mendekomposisikan teks soal ke segmen-segmen teks untuk diterjemahkan ke jenis operasi hitung. Segmen-segmen tersebut ditentukan melalui proses parsing semantik struktur soal agar menghasilkan segmen-segmen yang maknanya menunjuk operasi hitung. Sejumlah metode usulan saat ini sesuai untuk diterapkan pada soal cerita berbahasa Inggris dan belum diterapkan pada soal cerita berbahasa Indonesia. Dampaknya adalah segmen-segmen yang dihasilkan belum tentu menghasilkan urutan pengerjaan operasi yang sesuai makna cerita. Penelitian ini mengusulkan penggunaaan Recursive Neural Network (RNN) sebagai parser struktur semantik soal cerita berbahasa Indonesia. Pengujian parser struktur semantik soal dilakukan terhadap soal-soal yang berasal dari Buku Sekolah Elektronik (BSE) Sekolah Dasar (SD) dari Pusat Perbukuan Kementerian Pendidikan dan Kebudayaan. Hasil pengujian menunjukkan akurasi akhir sebesar 86,4%.

 

 

Math word problems play an important role for the development of artificial intelligent. This is because solving word problems involves the development of a system that can understand natural language.  Designing a system for solving math word problems requires a mechanism for decomposing a text into segments of text to be translated into math operation. The segments are categorized through the process of parsing the semantic structure of the word problems to obtain segments whose meanings refer to math operation. A number of current proposed methods are suitable to be applied to English math word problems and have never been applied to Indonesian math word problems. The impact is that the segments produced are not necessarily in line with the sequences of operations appropriate with the meaning of the story.  This study proposed the use of Recursive Neural Network (RNN) as a parser of semantic structure of Indonesian math word problems. The testing of the parser was carried out on the math word problems taken from the Elementary School’s Electronic School Book  (BSE) published by the Book Center of the Ministry of Education and Culture. The result of the testing showed that the final accuracy was 86.4%.

Author Biographies

Agung Prasetya, Institut Teknologi Sepuluh Nopember, Surabaya

Teknik Informatika

Chastine Fatichah, Institut Teknologi Sepuluh Nopember, Surabaya

Teknik Informatika

Umi Laili Yuhana, Institut Teknologi Sepuluh Nopember, Surabaya

Teknik Informatika

References

Clark, P. (2015). Elementary School Science and Math Tests as a Driver for AI: Take the Aristo Challenge! Proceedings of the Twenty-Seventh Conference on Innovative Applications of Artificial Intelligence (pp. 4019-4021). Austin, Texas, USA: AAAI Press.

Clark, P., & Etzioni, O. (2016). My Computer Is an Honor Student — but How Intelligent Is It? Standardized Tests as a Measure of AI. AI Magazine, 37(1), 5-12.

Koncel-Kedziorski, R., Hajishirzi, H., Sabharwal, A., Etzioni, O., & Ang, S. D. (2015). Parsing Algebraic Word Problems into Equations. Transactions of the Association for Computational Linguistics, 3, 585-597.

Kushman, N., Artzi, Y., Zettlemoyer, L., & Barzilay, R. (2014). Learning to Automatically Solve Algebra Word Problems. Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (pp. 271-281). Baltimore, Maryland, USA: Association for Computational Linguistics.

Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013, January 16). Efficient Estimation of Word Representations in Vector Space. Retrieved from Arxiv: https://arxiv.org/pdf/1301.3781.pdf

Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., & Dean, J. (2013). Distributed Representations of Words and Phrases and their Compositionality. Advances in Neural Information Processing Systems 26 (NIPS 2013). Lake Tahoe, Nevada, USA: Neural Information Processing Systems (NIPS).

Mitra, A., & Baral, C. (2016). Learning To Use Formulas To Solve Simple Arithmetic Problems. Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (pp. 2144-2153). Berlin, Germany: Association for Computational Linguistics.

O'Donnell, M. (2000). RSTTool 2.4 - A Markup Tool for Rhetorical Structure Theory. INLG'2000 Proceedings of the First International Conference on Natural Language Generation, (pp. 253-256).

Ratlif, N. D., Bagnell, J. A., & Zinkevich, M. A. (2006). Maximum Margin Planning. International Conference on Machine Learning. Pittsburgh, USA: International Machine Learning Society - ICML.

Roy, S., Vieira, T., & Roth, D. (2015). Reasoning about Quantities in Natural Language. Transactions of the Association for Computational Linguistics, 3, 1-13.

Socher, R., Huang, E. H., Pennington, J., Ng, A. Y., & Manning, C. D. (2011). Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection. Advances in Neural Information Processing Systems 24 (NIPS 2011) (pp. 1-9). Granada, Spain: Neural Information Processing Systems (NIPS).

Socher, R., Lin, C. C.-Y., Ng, A. Y., & Manning, C. D. (2011). Parsing Natural Scenes and Natural Language with Recursive Neural Networks. International Conference on Machine Learning (ICML). Bellevue, Washington, USA: International Machine Learning Society (IMLS).

Socher, R., Pennington, J., Huang, E. H., Ng, A. Y., & Manning, C. D. (2011). Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions. Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing (pp. 151-161). Edinburgh, Scotland, UK: Association for Computational Linguistics.

Socher, R., Perelygin, A., Wu, J. Y., Chuang, J., Manning, C. D., Ng, A. Y., & Potts, C. (2013). Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank. . Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing (pp. 1631-1642). Seattle, Washington, USA: Association for Computational Linguistics.

Taskar, B., Klein, D., Collins, M., Koller, D., & Manning, C. (2004). Max-Margin Parsing. Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing.

Upadhyay, S., Chang, M.-W., Chang, K.-W., & Yih, W.-t. (2016). Learning from Explicit and Implicit Supervision Jointly For Algebra Word Problems. Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (pp. 297-306). Austin, Texas: Association for Computational Linguistics.

Wang, L., Zhang, D., Gao, L., Song, J., Guo, L., & Shen, H. T. (2018). MathDQN: Solving Arithmetic Word Problems via Deep Reinforcement Learning. The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18) (pp. 5545-5552). New Orleans, Louisiana, USA: AAAI Press.

Wang, Y., Liu, X., & Shi, S. (2017). Deep Neural Solver for Math Word Problems. Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing (pp. 845-854). Copenhagen, Denmark: Association for Computational Linguistics.

Zhou, L., Dai, S., & Chen, L. (2015 ). Learn to Solve Algebra Word Problems Using Quadratic Programming. Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing (pp. 817–822). Lisbon, Portugal: Association for Computational Linguistics.

Zhu, M., Zhang, Y., Chen, W., Zhang, M., & Zhu, J. (2013). Fast and Accurate Shift-Reduce Constituent Parsing. Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (pp. 434-443). Sofia, Bulgaria: Association for Computational Linguistics.

Downloads

Published

2019-06-27

How to Cite

[1]
A. Prasetya, C. Fatichah, and U. L. Yuhana, “Parsing struktur semantik soal cerita matematika berbahasa indonesia menggunakan recursive neural network”, regist. j. ilm. teknol. sist. inf., vol. 5, no. 2, pp. 106–115, Jun. 2019.

Issue

Vol. 5 No. 2 (2019): July

Section

Article

License


Please find the rights and licenses in Register: Jurnal Ilmiah Teknologi Sistem Informasi. By submitting the article/manuscript of the article, the author(s) agree with this policy. No specific document sign-off is required.

1. License

The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

2. Author(s)' Warranties

The author warrants that the article is original, written by stated author(s), has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author(s).

3. User/Public Rights

Register's spirit is to disseminate articles published are as free as possible. Under the Creative Commons license, Register permits users to copy, distribute, display, and perform the work for non-commercial purposes only. Users will also need to attribute authors and Register on distributing works in the journal and other media of publications. Unless otherwise stated, the authors are public entities as soon as their articles got published.

4. Rights of Authors

Authors retain all their rights to the published works, such as (but not limited to) the following rights;

Copyright and other proprietary rights relating to the article, such as patent rights,
The right to use the substance of the article in own future works, including lectures and books,
The right to reproduce the article for own purposes,
The right to self-archive the article (please read out deposit policy),
The right to enter into separate, additional contractual arrangements for the non-exclusive distribution of the article's published version (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal (Register: Jurnal Ilmiah Teknologi Sistem Informasi).
5. Co-Authorship

If the article was jointly prepared by more than one author, any authors submitting the manuscript warrants that he/she has been authorized by all co-authors to be agreed on this copyright and license notice (agreement) on their behalf, and agrees to inform his/her co-authors of the terms of this policy. Register will not be held liable for anything that may arise due to the author(s) internal dispute. Register will only communicate with the corresponding author.

6. Royalties

Being an open accessed journal and disseminating articles for free under the Creative Commons license term mentioned, author(s) aware that Register entitles the author(s) to no royalties or other fees.

7. Miscellaneous

Register will publish the article (or have it published) in the journal if the article’s editorial process is successfully completed. Register's editors may modify the article to a style of punctuation, spelling, capitalization, referencing and usage that deems appropriate. The author acknowledges that the article may be published so that it will be publicly accessible and such access will be free of charge for the readers as mentioned in point 3.