Skip to main content

Parallel GLR Parsing Based on Logic Programming

  • Chapter
Generalized LR Parsing
  • 84 Accesses

Abstract

To provide an efficient parser for natural language sentences, a parallel parsing algorithm is desirable. By realizing this fact, this paper presents an efficient parallel parser which analyzes syntactic ambiguities of a natural language sentence parallely.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A.V. and Ulman, J. D. (1972). The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  • Aho, A. V., Senthi, R., and Ulman, J. D. (1985). Compilers Principles, Techniques, and Tools, Addison-Wesley.

    Google Scholar 

  • Fuch, K., Furukawa, K., and Mizoguchi, F. (1987). Heiretu Ronri Gala Gengo GHC To Sono Ouyou, Kyoritsu Syuppan (Japanese).

    Google Scholar 

  • Knuth, D. E. On the translation of languages from left to right. Information and Control 8:6, pp. 607–639.

    Google Scholar 

  • Konno, A. and Tanaka, H. (1986). Hidari Gaichi Wo Kouryo Shita Bottom Up Koubun Kaiseki, Computer Softwear, Vol. 3, No. 2, pp. 115–125 (Japanese).

    Google Scholar 

  • Nakata, I. (1981). Compiler, Sangyo Tosyo (Japanese).

    Google Scholar 

  • Matsumoto, Y. and Sugimura, R. (1986). Ronri Gata Gengo Ni Motodsuku Koubun Kaiseki System SAX, Computer Softwear, Vol. 3, No. 4, pp. 4–11 (Japanese).

    Google Scholar 

  • Matsumoto, Y. (1987). A Parallel Parsing System for Natural Language Analysis, New Generation Computing, Vol. 5, No. 1, pp. 63–78.

    Article  MATH  Google Scholar 

  • Matsumoto, Y. (June 1989). Natural Language Parsing Systems based on Logic Programming, Ph.D thesis of Kyoto University.

    Google Scholar 

  • Mellish, C.S. (1985). Computer Interpretation of Natural Language Descriptions, Ellis Horwood Limited.

    Google Scholar 

  • Nilsson, U. (1986). AID: An Alternative Implementation of DCGs, New Generation Computing, 4, pp. 383–399.

    Article  MATH  Google Scholar 

  • Tanaka, H. and Numazaki, H. (1989). Parallel Generalized LR Parsing based on Logic Programming, International Workshop on Parsing Technologies, pp. 329–338.

    Google Scholar 

  • Okumura, M. (1989). Sizengengo Kaiseki Ni Okeru Imiteki Aimaisei Wo Zoushinteki Ni Kaisyou Swu Keisan Model, Natural Language Analysis Working Group, Information Processing Society of Japan, NL 71-1 (Japanese).

    Google Scholar 

  • Pereira, F. and Warren, D. (1980). Definite Clause Grammar for Language Analysis — A Survey of the Formalism and a Comparison with Augmented Transition Networks, Artif. Intell, Vol. 13, No. 3, pp.231–278.

    Article  MathSciNet  MATH  Google Scholar 

  • Tokunaga, T., Iwayama, M., Kamiwaki, T., and Tanaka, H. (1988). Natural Language Analysis System LangLAB, Transactions of Information Processing Society of Japan, Vol. 29, No. 7, pp. 703–711 (Japanese).

    Google Scholar 

  • Tomita, M. (1986). Efficient Parsing for Natural Language, Kluwer Academic Publishers.

    Google Scholar 

  • Tomita, M. (1987). An Efficien Augmented-Context-Free Parsing Algorithm, Computational Linguistics, Vol. 13, Numbers 1-2, pp. 31–46.

    Google Scholar 

  • Ueda, K. (1985). Guarded Horn Clauses, Proc. The Logic Programming Conference, Lecture Notes in Computer Science, 221.

    Google Scholar 

  • Uehara, K. and Toyoda, J. (1983). Sakiyomi To Yosokukinou Wo Motsu Jutugo Ronri Gala Koubun Kaiseki Program: PAMPS, Transactions of Information Processing Society of Japan, Vol. 24, No. 4, pp. 496–504 (Japanese).

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Tanaka, H., Numazaki, H. (1991). Parallel GLR Parsing Based on Logic Programming. In: Tomita, M. (eds) Generalized LR Parsing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4034-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4034-2_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6804-5

  • Online ISBN: 978-1-4615-4034-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics