| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| krankie (0) - 2 freq frankie (1) - 10 freq skrankie (1) - 4 freq brankie (1) - 2 freq mankie (2) - 6 freq crackie (2) - 1 freq trackie (2) - 9 freq bankie (2) - 2 freq kranky (2) - 109 freq skraikie (2) - 1 freq drinkie (2) - 4 freq branie (2) - 1 freq brankin (2) - 5 freq tankie (2) - 1 freq crannie (2) - 11 freq swankie (2) - 6 freq grannie (2) - 328 freq rancie (2) - 1 freq trannie (2) - 5 freq prankin (2) - 1 freq shankie (2) - 1 freq kraikin (2) - 1 freq grandie (2) - 1 freq rackie (2) - 1 freq frunkie (2) - 1 freq |
krankie (0) - 2 freq kranky (2) - 109 freq frankie (2) - 10 freq brankie (2) - 2 freq skrankie (2) - 4 freq ranke (3) - 1 freq kronik (3) - 1 freq skrinkie (3) - 1 freq drinkie (3) - 4 freq frunkie (3) - 1 freq randie (4) - 8 freq rankin (4) - 16 freq cranky (4) - 1 freq drankit (4) - 1 freq rankit (4) - 1 freq crankit (4) - 1 freq yankie (4) - 3 freq hankie (4) - 15 freq crank (4) - 7 freq krone (4) - 2 freq frank (4) - 66 freq drank (4) - 59 freq karaoke (4) - 6 freq skrank (4) - 2 freq rank (4) - 43 freq |
SoundEx code - K652 karnak - 2 freq koreans - 1 freq karen's - 9 freq kirns - 2 freq kranky - 109 freq kranky's - 2 freq kronykil - 1 freq keyring - 2 freq kronik - 1 freq kermack - 4 freq kermack's - 1 freq karmic - 1 freq kerrying - 2 freq €œkronikill - 1 freq kieran's - 1 freq krankie - 2 freq krings - 1 freq karenisathome - 6 freq karnegie - 1 freq karencotter - 1 freq kieranjack - 1 freq karengdonald - 1 freq karenstasks - 1 freq |
MetaPhone code - KRNK greenock - 40 freq guernica - 1 freq crank - 7 freq crunk - 5 freq curing - 1 freq karnak - 2 freq kranky - 109 freq crang - 2 freq crannog - 2 freq keyring - 2 freq kronik - 1 freq caring - 5 freq krankie - 2 freq carnock - 1 freq cranky - 1 freq |
KRANKIE |
| Time to execute Levenshtein function - 0.394014 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.687911 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.029863 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.054849 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.000869 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. |