Skip to main content
SpringerLink
Log in

E

  • Chapter
Catalogue of Artificial Intelligence Techniques

Part of the book series: Symbolic Computation ((1064))

Abstract

The first published algoritm to bring the worst case asymptotic time complexity of recognition for unrestricted context-free grammars <45> down to cubic order in the number of words in the string to be parsed. Makes use of a well-formed substring table. See caching <27>.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Earley, J. An efflcient context-free parsing algorithm.

    Google Scholar 

  • Marr, D. and Hildreth, E. Theory of edge detection. Proc. R. Soc. Lond., B207:187–217, 1980.

    Article  Google Scholar 

  • Pearl, J. Probabilistic Reasoning in Intelligent Systems: networks of plausible inference, Morgan Kaufmann, San Mateo, California, 1988 (Chapter 10).

    Google Scholar 

  • Pearl, J. Probabilistic Semantics for Nonmonotonic Reasoning: A survey. In Proceedings of First Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR’89), pages 505–516, 1989

    Google Scholar 

  • Hayes-Roth, F., Waterman, D.A. and Lenat, D.B. (editors). Building Expert Systems, Volume 1. Addison-Wesley, Reading, Mass. and London, 1983

    Google Scholar 

  • DeJong, G. and Mooney, R. Explanation-based learning: an alternative view. Machine Learning, 1(2): 145–176, 1986.

    Google Scholar 

  • Mitchell, T.M., Keller, R.M. and Kedar-Cabelli, S.T. Explanation-based generalisation: a unifying view. Machine Learing, 1(1):47–80, 1986.

    Google Scholar 

  • Horn, B.K.P. Robot Vision. MIT Press, Cambridge, Mass., 1986 (Chapter 16).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, Scotland, UK

    Alan Bundy

Authors
  1. Alan Bundy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh, EH1 1HN, Scotland, UK

    Alan Bundy

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bundy, A. (1990). E. In: Bundy, A. (eds) Catalogue of Artificial Intelligence Techniques. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97276-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-97276-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-97278-2

  • Online ISBN: 978-3-642-97276-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation