skip to main content
article
Free Access

A CYK approach to parsing in parallel: a case study

Published:01 March 1991Publication History
First page image

References

  1. Harbusch, K, "An Efficient Parsing Algorithm for Tree Adjoining Grammars", in Proceedings of the Conference of the Association for Computational Linguistics,1990, pp.284-291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Hopcroft, j.E. and Ullman, J.D., Introduction to Automata Theory~ Languages. and Computation, Addison-Wesley, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Kasami, T., "An Efficient Recognition and Syntax Algortihm for Context-Free Languages", Scientific Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford MA, 1965.Google ScholarGoogle Scholar
  4. Vijay-Shanker, K. and Weir, D.J., "Polynomial Time Parsing of Combinatory Categorial Grammars" in Proceedings of the Conference of the Association .for Computational Linguistics, 1990, pp. 1-8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Younger, D.H., "Recognition and Parsing of Context-Free Languages in Time O (n3)'', Information and Control, 10(2): 189-208, 1967.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A CYK approach to parsing in parallel: a case study

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in

                  Full Access

                  • Published in

                    cover image ACM SIGCSE Bulletin
                    ACM SIGCSE Bulletin  Volume 23, Issue 1
                    Mar. 1991
                    369 pages
                    ISSN:0097-8418
                    DOI:10.1145/107005
                    Issue’s Table of Contents
                    • cover image ACM Conferences
                      SIGCSE '91: Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
                      March 1991
                      392 pages
                      ISBN:0897913779
                      DOI:10.1145/107004

                    Copyright © 1991 ACM

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 March 1991

                    Check for updates

                    Qualifiers

                    • article

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader
                  About Cookies On This Site

                  We use cookies to ensure that we give you the best experience on our website.

                  Learn more

                  Got it!