Skip to main content

A Parsing System based on a Deductive Database

  • Conference paper
  • 114 Accesses

Part of the book series: Informatik-Fachberichte ((2252,volume 216))

Abstract

In this paper a set-oriented bottom-up parsing system based on a deductive database is presented. The system allows the purely declarative specification of Definite Clause Grammar rules as a logic program. The parser applies a set-oriented bottom-up evaluation strategy. It is therefore particularly wellsuited for the analysis of language ambiguities. Furthermore the system can easily be connected to a relational database. The impedance mismatch between a tuple-oriented PROLOG system and a set-oriented relational database system is avoided. Thus a number of drawbacks which PROLOG based parsers suffer from have been overcome.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bayer R.: Database Technology for Expert Systems, in: Informatik-Fachberichte 112: Wissensbasierte Systeme, Springer-Verlag, Berlin Heidelberg, 1985

    Google Scholar 

  2. Been C., Ramakrishnan R.: On the Power of Magic, Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, 1987

    Google Scholar 

  3. Codd E.F.: A Relational Model of Data for Large Shared Data Banks, Communications of the ACM, 13 (6), 1970 pp. 377–387

    Article  MATH  Google Scholar 

  4. Eckardt W.: Computergestützte Analyse althebräischer Texte: Algorithmische Erkennung der Morphologie, Arbeiten zu Text und Sprache im Alten Testament, 29.Band, EOS Verlag, St. Ottilien 1987

    Google Scholar 

  5. Eiben G.: Ubersetzung von rekursiven Hornklauseln in eine relationale Algebra, Diploma Thesis, Technische Universität München, Mai 1988

    Google Scholar 

  6. Gardarin G., Valduriez P.: Relational Databases and Knowledge Bases, Addison-Wesley, Massachusetts 1989

    MATH  Google Scholar 

  7. Database Systems by Efficient Differential Fixpoint Iteration, Proc. 3rd International Conference on Data Engineering, Los Angeles, 1987

    Google Scholar 

  8. Holzner J.: Optimierung rekursiver Logik-Programme durch die Magic-Set Methode, Diplo-ma Thesis, Technische Universität München, Februar 1989

    Google Scholar 

  9. Jarke M., Clifford J., Vassiliou Y.: An Optimizing Prolog Front-End to a Relational Query System, Proc. ACM SIGMOD Intl. Conf. on Management of Data, Boston 1984

    Google Scholar 

  10. Jasper H.: Interfacing Prolog and External Data Management Systems: a Model, GWAI-87, Springer, Berlin Heidelberg 1987

    Google Scholar 

  11. Lang B.: Datalog Automata, Proc. Third international Conference on Data and Knowledge Bases: Improving Usability and Responsiveness, Proceedings, Jerusalem 1988, pp. 389–404.

    Google Scholar 

  12. Matsumoto Y, Sugimura R.:A Parsing system based on logic programming, IJCAI 87, Proceedings Vol. 2, 1987, pp. 671–674.

    Google Scholar 

  13. Nuiding B.: Regelbasierter Otimierer für nicht-rekursive Hornklauseln in R-Lisp, Diploma Thesis, Technische Universität München, Februar 1987

    Google Scholar 

  14. Pereira F., Shieber S.: Prolog and Natural-Language Analysis, CSLI Lecture Notes Nr. 10, Centre for the Study of Language and Information, Stanford 1987

    Google Scholar 

  15. Pereira/Warren 1980] Pereira F., Warren D.:Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks, in: Artificial Intelligence 13 (1980), pp.231–278.

    Google Scholar 

  16. Richter W.: Grundlagen einer althebräischen Grammatik: B. Die Beschreibungsebenen, II. Die Wortfügung (Morphosyntax). f Arbeiten zu Text und Sprache im Alten Testament, 10.Band, EOS Verlag, St. Ottilien 1979

    Google Scholar 

  17. Schmidt H., Kiessling W., Güntzer U., Bayer, R.: Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration, Proc. Symposium on Logic Programming, San Fran-cisco, 1987

    Google Scholar 

  18. Specht 1987a] Specht G.: Salomo - Ein System zur morphologischen Analyse althebräischer Texte, Rundbrief des Fachausschusses 1.2 Künstliche Intelligenz und Mustererkennung in der Gesellschaft für Informatik, St. Augustin München, 1987 (2) pp.83–84

    Google Scholar 

  19. Specht G.: Konzeption und Implementation eines Expertensystems zur morphosyntaktischen Analyse althebräischer Texte, Diploma Thesis, Technische Universität München, November 1987

    Google Scholar 

  20. TransBase Relational Database System Version 3.0 System Guide, Manual, TransAction Software GmbH, Theresienstr. 128, D-8000 Munich 2, 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freitag, B., Specht, G. (1989). A Parsing System based on a Deductive Database. In: Metzing, D. (eds) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75100-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-75100-4_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51743-6

  • Online ISBN: 978-3-642-75100-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics