| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| killiecrankie (0) - 6 freq hallierackit (5) - 5 freq collieshangie (5) - 15 freq haillierakkit (5) - 1 freq pilliewinks (6) - 2 freq walkie-talkie (6) - 12 freq killiestandard (6) - 4 freq allie-ballie (6) - 2 freq hallirackit (6) - 1 freq williedrennan (6) - 11 freq willmackie (6) - 1 freq dillie-like (6) - 2 freq illiterate (6) - 3 freq collieshange (6) - 1 freq collieshangies (6) - 2 freq kil-crack (6) - 1 freq killerguile (6) - 1 freq billie-gait (6) - 6 freq yallicrack (6) - 1 freq williemackenzie (6) - 3 freq killiedrummer (6) - 1 freq colliebuckie (6) - 1 freq sillerie (6) - 15 freq haillerackit (6) - 2 freq krankie (6) - 2 freq |
killiecrankie (0) - 6 freq yallicrack (8) - 1 freq kil-crack (8) - 1 freq killerguile (9) - 1 freq krankie (9) - 2 freq dillderan (9) - 1 freq collieshangie (9) - 15 freq hallierackit (9) - 5 freq haillierakkit (9) - 1 freq killagan (10) - 4 freq kilcoyne (10) - 1 freq killymain (10) - 1 freq killing (10) - 7 freq killer (10) - 23 freq killin (10) - 61 freq killan (10) - 2 freq killers (10) - 9 freq killertron (10) - 1 freq colleckin (10) - 1 freq tillydrone (10) - 2 freq sillerin (10) - 4 freq killins (10) - 1 freq willick (10) - 2 freq kellerman (10) - 3 freq rollickin (10) - 1 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.209138 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.371989 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.027360 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.036983 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.000931 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. |