| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| killiecrankie (0) - 6 freq collieshangie (5) - 14 freq hallierackit (5) - 5 freq haillierakkit (5) - 1 freq yallicrack (6) - 1 freq illiterate (6) - 3 freq walkie-talkie (6) - 12 freq kil-crack (6) - 1 freq hallirackit (6) - 1 freq pilliewinks (6) - 2 freq killiestandard (6) - 4 freq haillerackit (6) - 2 freq sillerie (6) - 15 freq colliebuckie (6) - 1 freq billie-cans (6) - 2 freq williemackenzie (6) - 3 freq dillderan (6) - 1 freq williedrennan (6) - 11 freq allie-ballie (6) - 2 freq killerguile (6) - 1 freq willmackie (6) - 1 freq collieshange (6) - 1 freq killiedrummer (6) - 1 freq krankie (6) - 2 freq dillie-like (6) - 2 freq |
killiecrankie (0) - 6 freq yallicrack (8) - 1 freq kil-crack (8) - 1 freq krankie (9) - 2 freq killerguile (9) - 1 freq dillderan (9) - 1 freq collieshangie (9) - 14 freq hallierackit (9) - 5 freq haillierakkit (9) - 1 freq willick (10) - 2 freq killin (10) - 61 freq rollickin (10) - 1 freq killeen (10) - 1 freq killertron (10) - 1 freq killers (10) - 9 freq kilcoyne (10) - 1 freq killagan (10) - 4 freq kilngranny (10) - 1 freq kelliewynd (10) - 1 freq killins (10) - 1 freq killer (10) - 22 freq killymain (10) - 1 freq tillydrone (10) - 2 freq colleckin (10) - 1 freq killen (10) - 4 freq |
SoundEx code - K426 killiecrankie - 6 freq kolgref - 1 freq kil-crack - 1 freq kellycreighto - 3 freq |
MetaPhone code - KLKRNK killiecrankie - 6 freq |
KILLIECRANKIE |
| Time to execute Levenshtein function - 0.204816 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.406975 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.028195 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.037388 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.000851 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. |