Advertisement

A parallel parsing system for natural language analysis

  • Yuji Matsumoto
Session 4a: Parallel Applications And Implementations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)

Keywords

Noun Phrase Grammar Rule Prolog Program Nonterminal Symbol Parsing System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Aho 72]
    Aho, A.V. and J.D.Ullman, ‘The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing, ‘Prentice-Hall, 1972.Google Scholar
  2. [Clark 81]
    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 84]
    Clark, K.L. and S. Gregory, “PARLOG: Parallel Programming in Logic,” Research Report DOC 84/4, Imperial College, April 1984.Google Scholar
  4. [Gazdar 85]
    Gazdar, G., E.Klein, G.K.Pullum and I.A.Sag, ‘Generalized Phrase Structure Grammar,’ Basil Blackwell Publisher Ltd, 1985.Google Scholar
  5. [Gregory 84]
    Gregory, S., “How to Use Parlog (C-Prolog Version),” Department of Computing, Imperial College, Oct. 1984.Google Scholar
  6. [Kaplan 82]
    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 80]
    Kay, M., “Algorithm Schemata and Data Structures in Syntactic Processing,” XEROX Palo Alto Research Center, CSL-80-12, Oct. 1980.Google Scholar
  8. [Marcus 80]
    Marcus, M.P., ‘A Theory of Syntactic Recognition for Natural Language,’ The MIT Press, 1980.Google Scholar
  9. [Matsumoto 83]
    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 84]
    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 80]
    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.CrossRefGoogle Scholar
  12. [Pratt 75]
    Pratt, V.R., “LINGOL — A Progress Report,” Proc. the 4th IJCAI, pp.422–428, 1975.Google Scholar
  13. [Pullum 82]
    Pullum, G.K. and G. Gazdar, “Natural Languages and Context-free Languages,” Linguistic and Philosophy 4, pp.471–504, 1982.Google Scholar
  14. [Shapiro 83]
    Shapiro, E.Y., “A Subset of Concurrent Prolog and Its Interpreter,” ICOT Technical Report, TR-003, Feb. 1983.Google Scholar
  15. [Ueda 85]
    Ueda, K., “Guarded Horn Clauses,” Proc. The Logic Programming Conference, ICOT, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Yuji Matsumoto
    • 1
  1. 1.ICOT Research Center Institute for New Generation Computer TechnologyTokyoJapan

Personalised recommendations