| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scurtfoos (0) - 3 freq skurtfoo (2) - 1 freq curroos (3) - 2 freq scroos (3) - 1 freq spurious (4) - 2 freq scorpions (4) - 3 freq cerfoo (4) - 1 freq scrogs (4) - 4 freq shutdoon (4) - 2 freq sour-dook (4) - 1 freq spurts (4) - 1 freq scuilhoose (4) - 1 freq curdoo (4) - 1 freq scuffles (4) - 2 freq courtroom (4) - 3 freq curtains (4) - 79 freq scartins (4) - 2 freq snurts (4) - 1 freq scarrows (4) - 1 freq scarfs (4) - 4 freq curtins (4) - 5 freq cartoons (4) - 12 freq curious (4) - 75 freq scroosh (4) - 1 freq curators (4) - 1 freq |
scurtfoos (0) - 3 freq skurtfoo (4) - 1 freq scarts (5) - 9 freq scarfs (5) - 4 freq scartins (5) - 2 freq scerfs (5) - 1 freq scroos (5) - 1 freq scarf's (6) - 1 freq scraat's (6) - 1 freq scurrilous (6) - 2 freq scrious (6) - 1 freq curtsies (6) - 1 freq scurrie's (6) - 1 freq spurtles (6) - 1 freq escorts (6) - 1 freq certifies (6) - 1 freq scurry's (6) - 1 freq skurtfu (6) - 2 freq scrows (6) - 1 freq security's (6) - 1 freq scairts (6) - 1 freq scuffs (6) - 1 freq scurries (6) - 5 freq cartons (6) - 1 freq secretions (6) - 1 freq |
SoundEx code - S631 sword-fechtin - 1 freq screwtaps - 1 freq shortbread - 6 freq shortbreid - 12 freq screwed-up - 3 freq shortfaw - 1 freq scurtfoos - 3 freq shortbreed - 3 freq skurtfoo - 1 freq shoartbreid - 1 freq screw-tap-dancin - 1 freq skurtfu - 2 freq scarredparrot - 1 freq |
MetaPhone code - SKRTFS scurtfoos - 3 freq |
SCURTFOOS |
| Time to execute Levenshtein function - 0.217925 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.390515 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.034580 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.051584 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001000 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |