Advertisement

Accelerating the CKY Parsing Using FPGAs

  • Jacir L. Bordim
  • Yasuaki Ito
  • Koji Nakano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2552)

Abstract

The main contribution of this paper is to present an FPGAbased implementation of an instance-specific hardware which accelerates the CKY (Cook-Kasami-Younger) parsing for context-free grammars. Given a context-free grammar G and a string x, the CKY parsing determines if G derives x. We have developed a hardware generator that creates a Verilog HDL source to perform the CKY parsing for any given context-free grammar G. The created source is embedded in an FPGA using the design software provided by the FPGA vendor. We evaluated the instance-specific hardware, generated by our hardware generator, using a timing analyzer and tested it using the Altera FPGAs. The generated hardware attains a speed-up factor of approximately 750 over the software CKY parsing algorithm. Hence, we believe that our approach is a promising solution for the CKY parsing.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho and J.D. Ullman. The Theory of Parsing Translation and Compiling. Prentice Hall, 1972. 42Google Scholar
  2. [4]
    J. Chang, O. Ibarra, and M. Palis. Parallel parsing on a one-way array of finitestate machines. IEEE Transactions on Computers, C-36(1):64–75, 1987. 42CrossRefGoogle Scholar
  3. [5]
    E. Charniak. Statistical Language Learning. MIT Press, Cambridge, Massachusetts, 1993. 42Google Scholar
  4. [6]
    C. Ciressan, E. Sanchez, M. Rajman, and J.-C. Chappelier. An FPGA-based coprocessor for the parsing of context-free grammars. In Proc. of IEEE Symposium on Field-Programmable Custom Computing Machines, 2000. 42Google Scholar
  5. [7]
    C. Ciressan, E. Sanchez, M. Rajman, and J.-C. Chappelier. An FPGA-based syntactic parser for real-life almost unrestricted context-free grammars. In Proc. of International Conference on Field Programmable Logic and Applications (FPL), pages 590–594, 2001. 42Google Scholar
  6. [8]
    Y. Futamura, K. Nogi, and A. Takano. Essence of generalized partial computation. Theoretical Computer Science, 90:61–79, 1991. 42zbMATHCrossRefGoogle Scholar
  7. [9]
    A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988. 42Google Scholar
  8. [10]
    N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993. 41Google Scholar
  9. [11]
    S.R. Kosaraju. Speed of recognition of context-free languages by array automata. SIAM J. on Computers, 4:331–340, 1975. 42zbMATHCrossRefMathSciNetGoogle Scholar
  10. [12]
    J. C. Martin. Introduction to languages and the theory of computation (2nd Edition). Mac-Graw Hill, 1996. 42Google Scholar
  11. [13]
    Y. Sakakibara, M. Brown, R. Hughey, I. S. Mian, K. Sjölander, R.C. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research, 22:5112–5120, 1994. 42CrossRefGoogle Scholar
  12. [14]
    M.P. van Lohuizen. Survey on parallel context-free parsing techniques. Technical Report IMPACT-NLI-1997-1, Delft University of Technology, 1997. 42Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Jacir L. Bordim
    • 1
  • Yasuaki Ito
    • 1
  • Koji Nakano
    • 1
  1. 1.School of Information ScienceJapan Advanced Institute of Science and TechnologyTatsunokuchiJapan

Personalised recommendations