Author Details

Having an error detection and correction system is a fundamental requirement for any word processing application such as MS Word, Applix Word, JWPce, KWord, etc. Despite various efforts to develop such systems using rule-based, statistical-based, and other machine learning approaches, none of them have been satisfactory. The author of this research proposes an algorithm that utilizes the Hidden Markov Model to detect grammatical errors in input sentences. The Viterby algorithm is used to implement the Hidden Markov Model, and an annotated corpus from ILCI is used to calculate the HMM parameters. The results of testing the system on three types of datasets showed an overall precision of 100%, recall of 93.83%, and an f-measure of 96.7. The proposed algorithm has the potential to be used in the development of similar systems for other Indian languages.

Keywords

Grammar Checker, Syntactic Analyzer, Error Detection, HMM.

Full Text

References

. B. Behera and P. Bhattacharyya, “Automated Grammar Correction Using Hierarchical Phrase-Based Statistical Machine Translation,” Proc. Sixth Int. Jt. Conf. Nat. Lang. Process., pp. 937–941, 2013.

. Holan, T., Kubon, V., & Plátek, M. (1997, March). A prototype of a grammar checker for Czech. In Fifth Conference on Applied Natural Language Processing (pp. 147-154).

. Atwell, E. S. “How to detect grammatical errors in a text without parsing it,” In Proceedings of the third conference on European chapter of the Association for Computational Linguistics, pp38-45,1987

. J. Eeg-olofsson and O. Knutsson, “Automatic Grammar Checking for Second Language Learners – the Use of Prepositions,” 2001.

. G. Fliedner, “A System for Checking NP Agreement in German Texts Correct : seinen Argumenten,” no. July, pp. 12–17, 2002.

. K. M. A. Hasan, A. Mondal, and A. Saha, “Recognizing Bangla Grammar Using Predictive Parser,” vol. 3, no. 6, pp. 61–73, 2011.

. S. S. Hashemi, Automatic Detection of Grammar Errors in Primary School Children’s Texts. 2003.

. S. Hein, “A Chart-Based Framework for Grammar Checking Initial Studies,” no. 1996, pp. 1–12, 1998.

. Kubon, V., & Plátek, M. (1994). A grammar based approach to a grammar checking of free word order languages. In COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics.

. Paggio, P. (2000, April). Spelling and grammar correction for Danish in SCARRIE. In Proceedings of the sixth conference on applied natural language processing (pp. 255-261). Association for Computational Linguistics.

. Park, J. C., Palmer, M. S., & Washburn, C. (1997, March). An English Grammar Checker as a Writing Aid for Students of English as a Second Language. In ANLP (Vol. 24, No. 10.3115, pp. 974281-974296).

. Tschichold, C., Bodmer, F., Cornu, E., Grosjean, F., Grosjean, L., Kübler, N. & Tschumi, C. (1997). Developing a new grammar checker for English as a second language. In From Research to Commercial Applications: Making NLP Work in Practice.

. T. Vosse and P. O. Box, “Detecting and Correcting Morpho-syntactic Errors in Real Texts Nijmegen Institute for Cognition and Information University of Nijmegen Cognitive Technology Foundation,” pp. 111–118, 1990.

. Young-soog, “Improvement of Korean Proofreading System Using Corpus and Collocation Rules,” pp. 328–333, 1998.

. M. S. Gill, “A Grammar Checking System for Punjabi,” no. August, pp. 149–152, 2008.

. Schmidt-Wigger, “Grammar and Style Checking for German,” Proc. Second Int. Work. Control Lang. Appl. CLAW1998, no. Ii, pp. 76–86, 1998.

. L. Bopche and G. Dhopavakar, “Rule Based Grammar Checking System for Hindi,” vol. 3, no. 1, pp. 45–47, 2012.

. Arppe, “Developing a grammar checker for Swedish,” 12th Nord. Conf. Comput. Linguist. pp. 13–27, 2000.

. R. Bustamante and F. S. León, “GramCheck: A Grammar and Style Checker,” 1996.

. J. Carlberger and R. Domeij, “A Swedish Grammar Checker,” 2002.

. H. Kabir, S. Nayyer, J. Zaman, and S. Hussain, “Two Pass Parsing Implementation for an Urdu Grammar Checker."

Using Sentence Simplification to Generate Paraphrase for Low Resource Punjabi Language

Abstract Views :122 | PDF Views:0

Authors

Ravinder Mohan Jindal ¹, Leekha Jindal ¹, Sanjeev Kumar Sharma ²

Affiliations
1 Research Scholar, SBBS University, Jalandhar, IN
2 Associate Professor, DAV University, Jalandhar, IN

Source

Research Cell: An International Journal of Engineering Sciences, Vol 35, No SP (2023), Pagination: 137-145

Abstract

The field of natural language processing is growing in computer science, and generating paraphrases is a difficult task, especially for languages like Hindi, Punjabi, and Urdu, which are morphologically rich and have limited resources. This research article focuses on generating paraphrases for Punjabi, a morphologically rich Indian language, using a sentence simplification approach. The author employed several sentence simplification algorithms to simplify long Punjabi sentences and used antonym-synonym replacement to generate the paraphrases. The sentence simplification component of the system achieved a precision of 100%, recall of 95%, and an f-measure of 97.43% when tested with a set of data. The developed system's performance was analyzed using various complexity measurement parameters, and it was observed that a combination of lexical and syntactic simplifications yielded the best results.

Keywords

NLP, Punjabi Language Processing, Paraphrasing, Syntactic Simplification, Lexical Simplification.

Full Text

References

. Lehal, G. S. (2007). Design and implementation of Punjabi spell checker. International Journal of Systemics, Cybernetics and Informatics, 3(8), 70-75.

. Gill, M. S., Lehal, G. S., & Joshi, S. S. (2008). A punjabi grammar checker. In Proceedings of the Third International Joint Conference on Natural Language Processing: Volume-II.

. Gill, M. S., Lehal, G. S., & Joshi, S. S. (2009). Part of speech tagging for grammar checking of Punjabi. The Linguistic Journal, 4(1), 6-21.

. Singh, D. M. (2010). A Punjabi Morphological Analyzer and Generator. Advanced Centre for Technical Development of Punjabi Language, Literature and Culture, Punjabi University.

. Lehal, G. S. (2009). A Gurmukhi to Shahmukhi transliteration system. In proceedings of ICON-2009: 7th international conference on Natural Language Processing (pp. 167-173).

. Goyal, V., &Lehal, G. S. (2009). Hindi-Punjabi Machine Transliteration System (For Machine Translation System). George Ronchi Foundation Journal, Italy, 64(1), 2009.

. Josan, G. S., &Lehal, G. S. (2008, August). A Punjabi to Hindi machine translation system. In 22nd International Conference on on Computational Linguistics: Demonstration Papers (pp. 157-160). Association for Computational Linguistics.

. Lehal, G. S., & Singh, C. (2000, September). A Gurmukhi script recognition system. In Proceedings 15th International Conference on Pattern Recognition. ICPR-2000 (Vol. 2, pp. 557-560). IEEE.

. Gupta, V., &Lehal, G. S. (2012, December). Automatic Punjabi text extractive summarization system. In Proceedings of COLING 2012: Demonstration Papers (pp. 191-198).

. Kevin Knight and Daniel Marcu. 2000. Statisticsbased summarization-step one: Sentence compression. In Proceedings of AAAI-IAAI.

. Trevor Cohn and Mirella Lapata. 2008. Sentence compression beyond word deletion. In Proceedings of COLING.

. Katja Filippova and Michael Strube. 2008. Dependency tree based sentence compression. In Proceedings of INLG

. Emily Pitler. 2010. Methods for sentence compression. Technical report, University of Pennsylvania.

. Katja Filippova, Enrique Alfonseca, Carlos Colmenares, Lukasz Kaiser, and Oriol Vinyals. 2015. Sentence compression by deletion with LSTMs. In Proceedings of EMNLP.

. Kristina Toutanova, Chris Brockett, Ke M. Tran, and SaleemaAmershi. 2016. A dataset and evaluation metrics for abstractive compression of sentences and short paragraphs. In Proceedings of EMNLP.

. Kathleen McKeown, Sara Rosenthal, Kapil Thadani, and Coleman Moore. 2010. Time-efficient creation of an accurate sentence fusion corpus. In Proceedings of NAACL-HLT.

. Katja Filippova. 2010. Multi-sentence compression: Finding shortest paths in word graphs. In Proceedings of COLING.

. Dras, Mark. 1997a. Representing Paraphrases Using S-TAGs. Proceedings of the 35th Meeting of the Association for Computational Linguistics, 516-518.

. Mark Dras. 1999. Tree adjoining grammar and the reluctant paraphrasing of text. Ph.D. thesis, Macquarie University, Australia

. Regina Barzilay and Kathleen R McKeown. 2001. Extracting paraphrases from a parallel corpus. In Proceedings of ACL.

. Colin Bannard and Chris Callison-Burch. 2005. Paraphrasing with bilingual parallel corpora. In Proceedings of ACL.

. Sander Wubben, Antal Van Den Bosch, and Emiel Krahmer. 2010. Paraphrase generation as monolingual translation: Data and evaluation. In Proceedings of INLG.

. Jonathan Mallinson, Rico Sennrich, and Mirella Lapata. 2017. Paraphrasing revisited with neural machine translation. In Proceedings of EACL.

. AdvaithSiddharthan. 2010. Complex lexico-syntactic reformulation of sentences using typed dependency representations. In Proceedings of INLG.

Username
Password
Remember me