Welcome to the InfoSci Platform
Parsing Bangla Grammar Using Context Free Grammar

Parsing Bangla Grammar Using Context Free Grammar

Al-Mahmud, Bishnu Sarker, K. M. Azharul Hasan
Copyright: © 2014 |Pages: 18
ISBN13: 9781466660427|ISBN10: 1466660422|EISBN13: 9781466660434
DOI: 10.4018/978-1-4666-6042-7.ch044
Cite Chapter Cite Chapter

MLA

Al-Mahmud, et al. "Parsing Bangla Grammar Using Context Free Grammar." Computational Linguistics: Concepts, Methodologies, Tools, and Applications, edited by Information Resources Management Association, IGI Global, 2014, pp. 933-950. https://doi.org/10.4018/978-1-4666-6042-7.ch044

APA

Al-Mahmud, Sarker, B., & Hasan, K. M. (2014). Parsing Bangla Grammar Using Context Free Grammar. In I. Management Association (Ed.), Computational Linguistics: Concepts, Methodologies, Tools, and Applications (pp. 933-950). IGI Global. https://doi.org/10.4018/978-1-4666-6042-7.ch044

Chicago

Al-Mahmud, Bishnu Sarker, and K. M. Azharul Hasan. "Parsing Bangla Grammar Using Context Free Grammar." In Computational Linguistics: Concepts, Methodologies, Tools, and Applications, edited by Information Resources Management Association, 933-950. Hershey, PA: IGI Global, 2014. https://doi.org/10.4018/978-1-4666-6042-7.ch044

Export Reference

Mendeley
Favorite

Abstract

Parsing plays a very prominent role in computational linguistics. Parsing a Bangla sentence is a primary need in Bangla language processing. This chapter describes the Context Free Grammar (CFG) for parsing Bangla language, and hence, a Bangla parser is proposed based on the Bangla grammar. This approach is very simple to apply in Bangla sentences, and the method is well accepted for parsing grammar. This chapter introduces a parser for Bangla language, which is, by nature, a predictive parser, and the parse table is constructed for recognizing Bangla grammar. Parse table is an important tool to recognize syntactical mistakes of Bangla sentences when there is no entry for a terminal in the parse table. If a natural language can be successfully parsed then grammar checking of this language becomes possible. The parsing scheme in this chapter works based on a top-down parsing method. CFG suffers from a major problem called left recursion. The technique of left factoring is applied to avoid the problem.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.