Advertisement

Natural and formal language processing

  • Michael Hess
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 636)

Abstract

Natural Language Processing, one of the most important branches of Artificial Intelligence, has close links with Logic Programming. It is one of the two roots from which Logic Programming developed, and still shares important core concepts with it (e.g. unification). The concepts and techniques used for two of its main tasks, viz. syntax analysis and semantic analysis, are illustrated with concrete examples. For syntax analysis, it is the notations of Definite Clause Grammars and Extraposition Grammars, for semantic analysis, the concepts of Montague Grammar and Generalized Quantifier Theory. Some of these techniques can also be applied to the analysis of formal languages.

Keywords

Natural Language Logic Program Noun Phrase Machine Translation Generalize Quantifier 
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.

Literature

  1. Barwise 1981.
    Barwise, J. and Cooper, R., “Generalized Quantifiers and Natural Language,” Linguistics and Philosophy, no. 4, pp. 159–219, 1981.Google Scholar
  2. Clocksin 1984.
    Clocksin, W.F. and Mellish, C.S., Programming in Prolog, Springer, Berlin etc., 1984.Google Scholar
  3. Colmerauer 1982.
    Colmerauer, Alain, “An interesting subset of natural language,” in: Logic Programming, ed. Keith L. Clark and Sten-Ake Tarnlund, pp. 45–66, Academic Press, London, 1982.Google Scholar
  4. Gaerdenfors 1987.
    Gaerdenfors, P. ed., Generalized Quantifiers, Studies in Linguistics and Philosophy, 31, Reidel, Dordrecht/Boston/Lancaster/Tokyo, 1987.Google Scholar
  5. Gal 1991.
    Gal, Annie, Lapalme, Guy, Saint-Dizier, Patrick, and Somers, Harry, Prolog for Natural Language Processing, Wiley, Chichester etc., 1991.Google Scholar
  6. Gazdar 1989.
    Gazdar, G. and Mellish, Ch., Natural Language Processing in Prolog, Addison-Wesley, Wokingham etc., 1989.Google Scholar
  7. McTear 1987.
    McTear, Michael, The Articulate Computer, Blackwell, Oxford, 1987.Google Scholar
  8. Pereira 1983.
    Pereira, F.C.N., “Logic for Natural Language Analysis,” SRI International Technical Note 275, January 1983.Google Scholar
  9. Pereira 1987.
    Pereira, F.C.N. and Shieber, S.M., Prolog and Natural Language Analysis, CSLI Lecture Notes, 10, Center for the Study of Language and Information, Menlo Park/Stanford/Palo Alto, 1987.Google Scholar
  10. Shapiro 1987.
    Shapiro, Stuart C., Encyclopedia of Artificial Intelligence, John Wiley, 1987.Google Scholar
  11. Smith 1991.
    Smith, George W., Computers and Human Language, Oxford University Press, New York, 1991.Google Scholar
  12. Warren 1983.
    Warren, David S., “Using lambda-calculus to represent meanings in logic grammars,” ACL Proceedings, 21st Annual Meeting, pp. 51–56, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Michael Hess
    • 1
  1. 1.ISSCOUniversity of GenevaSwitzerland

Personalised recommendations