A while ago I posted a snippet to calculate the 'Discrete Fréchet Distance' between two curves. If we treat a word as a 'curve' by giving each letter an index (with similar-sounding letters having closer indices) we can compare words by the Fréchet distance between them! An alternative to edit-distance...
3 people like thisPosted: 12 years ago by Kit Eason
File parsing, based on multiple lines, using recursive pattern matching with many :: (cons) operator
2 people like thisPosted: 11 years ago by Tuomas Hietanen
Computes Levenshtein (min edit) distance between two strings http://en.wikipedia.org/wiki/Levenstein_Distance
9 people like thisPosted: 12 years ago by Lakret
Given a string containing spinning expressions in the form "{string1|string2|...|stringN}", returns a string content randomly spinned. Spinning expressions can be nested. For instance, the spinned results of string "a{b|{c1|c2}}" will be one of the following : "ab" "ac1" "ac2"
5 people like thisPosted: 8 years ago by Didier Colin