We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition

by Mehrnoosh Bazrafkan, Ali Broumandnia
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 17
Year of Publication: 2013
Authors: Mehrnoosh Bazrafkan, Ali Broumandnia
10.5120/12157-7943

Mehrnoosh Bazrafkan, Ali Broumandnia . A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition. International Journal of Computer Applications. 70, 17 ( May 2013), 9-12. DOI=10.5120/12157-7943

@article{ 10.5120/12157-7943,
author = { Mehrnoosh Bazrafkan, Ali Broumandnia },
title = { A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 17 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 9-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number17/12157-7943/ },
doi = { 10.5120/12157-7943 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:34:11.467846+05:30
%A Mehrnoosh Bazrafkan
%A Ali Broumandnia
%T A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 17
%P 9-12
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches:the decision-theoretic approach and the syntactic (structural) approach. In this paper,at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in syntactic pattern recognition called top –down tabular parser known as Earley's algorithm Earley's tabular parser is one of the methods of context -free grammar parsing for syntactic pattern recognition. Earley's algorithm uses array data structure for implementing, which is the main problemand for this reasontakes a lots of time,searching in array and grammar parsing,and wasting lots of memory. In order to solve these problems and most important,the cubic time complexity,in this article,a new algorithm has been introduced,which reduces wasting the memory to zero, with using linked list data structure. Also, withthe changes in the implementation and performance of the algorithm,cubic time complexity has transformed into O (n*R) order.

References
  1. Bunke, Horst. Syntactic and structural pattern recognition: theory and applications. Vol. 7. World Scientific Publishing Company Incorporated, 1990.
  2. K. S. Fu ,Syntactic Pattern Recognition And Application,Chapter 5,Prentice hall ,Engelwood Cliffs,NJ,1982
  3. Jain, Anil K. , Robert P. W. Duin, and Jianchang Mao. "Statistical pattern recognition: A review. " Pattern Analysis and Machine Intelligence, IEEE Transactions on 22. 1 (2000): 4-37.
  4. Kandel, Abraham. Introduction to Pattern Recognition, Sta: Statistical, Structural, Neural and Fuzzy Logic Approaches. Vol. 32. World Scientific Publishing Company, 1999.
  5. Bunke, Horst. "Recent advances in structural pattern recognition with applications to visual form analysis. " Visual Form 2001. Springer Berlin Heidelberg, 2001. 11-23.
  6. Suganthan, Ponnuthurai N. "Structural pattern recognition using genetic algorithms. " Pattern Recognition 35. 9 (2002): 1883-1893.
  7. Mitra Basu, Horst Bunke, and Alberto Del Bimbo ,Guest Editors' Introduction to the Special Section on Syntactic and Structural Pattern Recognition IEEE TRANSACTIONS VOL. 27, NO. 7, JULY 2005.
  8. Suganthan, Ponnuthurai N. "Structural pattern recognition using genetic algorithms. " Pattern Recognition 35. 9 (2002): 1883-1893.
  9. Civera, Jorge, et al. "A syntactic pattern recognition approach to computer assisted translation. " Structural, Syntactic, and Statistical Pattern Recognition. Springer Berlin Heidelberg, 2004. 207-215.
  10. Conte, Donatello, et al. "Thirty years of graph matching in pattern recognition. "International journal of pattern recognition and artificial intelligence 18. 03 (2004): 265-298.
  11. A. V. Aho and J. D. Ullman,The theory of parsing ,Translation , and compiling ,Vol 1:parsing,(prentice –hall, Englewood cliffs ,NJ ,1972).
  12. E. Tanaka, M. Ikeda and k. esure,"direct parsing",pattern recognition 1986. 315-323
  13. Miclet, Laurent. Grammatical inference. World Scientific, 1990.
  14. Earley, J. : An Efficient Context-flee Parsing Algorithm Ph. D. Thesis (Carnegie- Mellon University, 1968).
  15. Aho, A. V. and Ullman, J. D ,The Theory of Parsing, Translation, and Compiling, Parsing, vol. I (Prentice-Hall, 1972).
  16. L. Miclat,Structural Methods in Pattern recognition (Springer-verlag,New York 1986)
Index Terms

Computer Science
Information Sciences

Keywords

Syntactic pattern recognition tabular parser context –free grammar time complexity linked list data structure

Powered by PhDFocusTM