CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

To Design a English Language Recognizer by using Nondeterministic Pushdown Automata (ELR-NPDA)

by Madiha Khurram Pasha, M. Sadiq Ali Khan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 105 - Number 1
Year of Publication: 2014
Authors: Madiha Khurram Pasha, M. Sadiq Ali Khan
10.5120/18345-9467

Madiha Khurram Pasha, M. Sadiq Ali Khan . To Design a English Language Recognizer by using Nondeterministic Pushdown Automata (ELR-NPDA). International Journal of Computer Applications. 105, 1 ( November 2014), 36-43. DOI=10.5120/18345-9467

@article{ 10.5120/18345-9467,
author = { Madiha Khurram Pasha, M. Sadiq Ali Khan },
title = { To Design a English Language Recognizer by using Nondeterministic Pushdown Automata (ELR-NPDA) },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 105 },
number = { 1 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 36-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume105/number1/18345-9467/ },
doi = { 10.5120/18345-9467 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:36:35.089521+05:30
%A Madiha Khurram Pasha
%A M. Sadiq Ali Khan
%T To Design a English Language Recognizer by using Nondeterministic Pushdown Automata (ELR-NPDA)
%J International Journal of Computer Applications
%@ 0975-8887
%V 105
%N 1
%P 36-43
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Natural language recognization is a popular topic of research as it covers many areas such as computer science, artificial intelligence, theory of computation, and machine leaning etc. Many of the techniques are used for natural language recognization by the researchers, parsing is one of them. The aim to propose this paper is to implement nondeterministic pushdown automata (NPDA) for the English Language (ELR-NPDA) that can modernize Context Free Grammar (CFG) for English language and then refurbish into Nondeterministic Pushdown Automata (NPDA). This converting procedure can uncomplicatedly parse legitimate English language sentences. Parsing can be organized by Nondeterministic Pushdown Automata (NPDA) that used push down stack and input tape for recognizing English language sentences. To formulate this NPDA convertor we have to exchange Context Free Grammar into Chomsky Normal Form (CNF). The move toward this is more appropriate because it uses nondeterministic approach of PDA that can improve language recognizing capabilities as compare to other parsing approach.

References
  1. Ratnagiri, Ichalkanji, Recognizing English grammar using predictive parser, IJERA, Vol. 3, Issuen4, Jul-Aug 2013, pp. 306-312
  2. K. M. Azharul Hasan, Al-Mahmud, Amit Mondal, Amit Saha, Recognizing Bangla grammar using predictive parser, IJCSIT, Vol 3, No 6, Dec 2011, pp-61-73.
  3. Manuel Vilares Ferro, An efficient context-free backbone for natural language analyzers.
  4. Stefan Andrei, Hikyoo Koh, A fixed-point approach towards efficient models conversion, No. 2, June 2008.
  5. Afra Zomorodian, Context-Free Language Induction by Evolution of Deterministic Push-Down Automata Using Genetic Programming.
  6. Aditi Barthwal1, Michael Norrish, Mechanisation of PDA and Grammar Equivalence for Context-Free Languages.
  7. www. jflap. org
  8. Robert C. Moore, Removing Left Recursion Form context Free Grammar.
  9. http://hol. sourceforge. net.
  10. Ahmed Al-Taani, Mohammed Msallan and Sana Wedian, A top-Down chart Parser for Analyzing Arabic Sentences.
  11. Dick G. and Ceriel H. , Paring Techniques, a Practical Guide, Technical Report, England, 1990.
  12. Richard A. Frost and Rahmatullah Hafiz, A New Top-Down Parsing Algorithm to Accommodate Ambiguity and left Recursion in Polynomial Time.
  13. Richard A. Frost, Rahmatullah Hafiz and Paul C-Callaghan, Modular and Efficient Top-down Parsing for Ambiguous Left-Recursive Grammars, Proceedings of the 10th Conference on Parsing Technologies, pages 109–120,
  14. Laurence Tratt, Direct Left-Recursive Parsing Expression Grammars.
  15. Pankaj Sharma, Naveen Malik, Naeem Akhter, Rahul, Hardep Rohilla, Parsing Techniques: A Review.
  16. Arianna D Ulizia, Fernando Ferri, and Patrizia Grifoni, A Survey of Grammatical inference Methods for Natural Language Learning.
  17. Georgios Petaris, Vangelis Karkaletsis, Georgios Paliouras and Contantine D. Spyropoulos, Learning Context-Free Grammars to Extract Relations Form text".
  18. Robert Moore and John Dowding, Efficient Bottom-up Parsing.
  19. Nazir Ahmad Zafar, LR(K) Parser Constraction Using Bottom Up Formal Analysis.
  20. David Carter, Efficient Disjunctive Unification for Bottom-Up Parsing.
  21. J. C. M. Beaten, P. J. L. Cuipers and P. J. A Van Tilburg, A Context-Free Process as a Pushdown Automata.
  22. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. compilers: principles, techniques, and tools: (Addison-Wesley Publishing Company, 1988).
  23. Kenneth C. Louden. compiler construction principles and practice. (San Jose State University: Galgotia Publication pvt. ltd, 2002)
Index Terms

Computer Science
Information Sciences

Keywords

English Language Recognizer - Nondeterministic Pushdown Automata (ELR-NPDA)

Powered by PhDFocusTM