Elsevier

Information Processing Letters

Volume 43, Issue 4, 28 September 1992, Pages 207-212
Information Processing Letters

Lazy dynamic-programming can be eager

https://doi.org/10.1016/0020-0190(92)90202-7Get rights and content

Abstract

Lazy evaluation in a functional language is exploited to make the simple dynamic-programming algorithm for the edit-distance problem run quickly on similar strings: being lazy can be fast.

References (11)

  • P.H. Sellers

    An algorithm for the distance between two finite sequences

    J. Combin. Theory

    (1974)
  • L. Allison

    Circular programs and self-referential structure

    Software - Practice and Experience

    (1989)
  • L. Augustsson et al.

    Lazy ML user's manual

  • R.S. Bird

    Using circular programs to eliminate multiple traversals of data

    Acta Inform.

    (1984)
There are more references available in the full text version of this article.
View full text