Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 1986: Third International Conference on Logic Programming pp 396–409Cite as

A parallel parsing system for natural language analysis

  • Session 4a: Parallel Applications And Implementations
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 225))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V. and J.D.Ullman, ‘The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing, ‘Prentice-Hall, 1972.

    Google Scholar 

  2. Clark, K.L. and S.Gregory, “A Relational Language for Parallel Programming,” Imperial College Research Report DOC 81/16, July 1981.

    Google Scholar 

  3. Clark, K.L. and S. Gregory, “PARLOG: Parallel Programming in Logic,” Research Report DOC 84/4, Imperial College, April 1984.

    Google Scholar 

  4. Gazdar, G., E.Klein, G.K.Pullum and I.A.Sag, ‘Generalized Phrase Structure Grammar,’ Basil Blackwell Publisher Ltd, 1985.

    Google Scholar 

  5. Gregory, S., “How to Use Parlog (C-Prolog Version),” Department of Computing, Imperial College, Oct. 1984.

    Google Scholar 

  6. Kaplan, R.M. and J.Bresnan, “Lexical-Functional Grammar: A Formal System for Grammatical Representation,” Chap.4 of ‘The Mental Representation of Grammatical Relations’ J. Bresnan (ed.), MIT Press, pp.173–281, 1982.

    Google Scholar 

  7. Kay, M., “Algorithm Schemata and Data Structures in Syntactic Processing,” XEROX Palo Alto Research Center, CSL-80-12, Oct. 1980.

    Google Scholar 

  8. Marcus, M.P., ‘A Theory of Syntactic Recognition for Natural Language,’ The MIT Press, 1980.

    Google Scholar 

  9. Matsumoto, Y., et al., “BUP: A Bottom-Up Parser Embedded in Prolog,” New Generation Computing, vol.1, no.2, pp.145–158, 1983.

    Google Scholar 

  10. Matsumoto, Y., M.Kiyono and H. Tanaka, “Facilitie of the BUP Parsing System,” Proceedings of Natural Language Understanding and Logic Programming, Rennes, 1984.

    Google Scholar 

  11. Pereira, F.C.N. and D.H.D. Warren, “Definite Clause Grammars for Language Analysis — A Survey of the Formalism and a Comparison with Augmented Transition Networks,” Artificial Intelligence, 13, pp.231–278, 1980.

    Article  Google Scholar 

  12. Pratt, V.R., “LINGOL — A Progress Report,” Proc. the 4th IJCAI, pp.422–428, 1975.

    Google Scholar 

  13. Pullum, G.K. and G. Gazdar, “Natural Languages and Context-free Languages,” Linguistic and Philosophy 4, pp.471–504, 1982.

    Google Scholar 

  14. Shapiro, E.Y., “A Subset of Concurrent Prolog and Its Interpreter,” ICOT Technical Report, TR-003, Feb. 1983.

    Google Scholar 

  15. Ueda, K., “Guarded Horn Clauses,” Proc. The Logic Programming Conference, ICOT, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICOT Research Center Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, 108, Tokyo, Japan

    Yuji Matsumoto

Authors
  1. Yuji Matsumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsumoto, Y. (1986). A parallel parsing system for natural language analysis. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation