NameSpaceDSSSLindex

Askemos functions

• entry-name
• fetch
• find
• read-locator, write-locator
• public-context
• service-level

General

(levenshtein-distance s1 s2 ) => number

(levenshtein< s1 s2 number ) => boolean

[The "edit distance", or "close string compare", see http://www.merriampark.com/ld.htm ]

Since the levenshtein algorithm is quadratic, computing big distances is a sure way to exceed any time limit. It's often possible to avoid an exact calculation of the difference, if it's only interesting, whether that difference is below limit. levenshtein< does just that.

(md5-digest s), (sha256-digest s), ...