Skip to main content
SpringerLink
Log in

A Prolog-based natural language front-end system

  • Short Notes
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

A Prolog-based natural language front-end system is described with the following major issues of discussion: Domain independence of the syntax analyser was achieved by the ‘generate-and-test’ notion and the domain independent semantic representation; Determiners were treated as higher order predicates; A technique called ‘syntactic feature’ was employed to write a readable parser in Prolog.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Clocksin, W. F. and Mellish, C. S.: “Programming in Prolog” (Springer, 1981).

  2. Colmerauer, A.: “Metamorphosis Grammars”, in Bolc (ed.), Natural Language Communication with Computers, Lecture Note in Computer Science,63 (Springer-Verlag, 1978).

  3. Dahl, V.: “Quantification in a Three-valued Logic for Natural Language Question-answering Systems”, Proceeding of 6th International Joint Conference on Artificial Intelligence (Tokyo, 1979).

  4. Maruyama, H.: “Natural Language Understanding System Using Prolog”, Proceedings of The Logic Programming Conference ’83 (1983) [in Japanese].

  5. Matsumoto, Y., Tanaka, H., Hirakawa, H., Miyoshi, H. and Yasukawa, H.: “BUP: A Bottom-Up Parser Embedded in Prolog,” New Generation Computing,1 (1983) 145–158.

    Article  MATH  Google Scholar 

  6. McCord, M. C.: “Using Slots and Modifiers in Logic Grammars for Natural Language,” Artificial Intelligence,18 (1982) 327–367.

    Article  Google Scholar 

  7. Pereira, F.: “Extraposition Grammars,” American Journal of Computational Linguistics,7 (1981) 243–256.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Warren, D. H. D. and Pereira, F. C. N.: “An Efficient Easily Adaptable System for Interpreting Natural Language Queries,” American Journal of Computational Linguistics,8 (1982) 110–122.

    Google Scholar 

  10. Winograd, T.: “Understanding Natural Language,” (Academic Press, New York, 1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Science Institute, IBM Japan, Ltd., Sanban-cho, Chiyoda-ku, 102, Tokyo, Japan

    Hiroshi Maruyama

  2. Department of Information Science, Tokyo Institute of Technology, Ookayama, Meguro-ku, 152, Tokyo, Japan

    Akinori Yonezawa

Authors
  1. Hiroshi Maruyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akinori Yonezawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work reported here was done while the author was at the Tokyo Institute of Technology, Dept. of Information Science.

About this article

Cite this article

Maruyama, H., Yonezawa, A. A Prolog-based natural language front-end system. NGCO 2, 91–99 (1984). https://doi.org/10.1007/BF03037054

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037054

Keywards

Search

Navigation