| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inwith (0) - 11 freq aneith (2) - 8 freq inpit (2) - 49 freq indite (2) - 1 freq anaith (2) - 6 freq incite (2) - 1 freq inwutt (2) - 1 freq inwick (2) - 3 freq sneith (2) - 2 freq intit (2) - 11 freq invite (2) - 43 freq inuits (2) - 2 freq inouth (2) - 1 freq inite (2) - 6 freq upwith (2) - 1 freq swith (2) - 28 freq €œwith (2) - 2 freq with (2) - 856 freq 'with (2) - 1 freq inpits (2) - 5 freq innit (2) - 10 freq €˜with (2) - 1 freq inooth (2) - 1 freq infit (2) - 1 freq init (2) - 1 freq |
inwith (0) - 11 freq swith (3) - 28 freq upwith (3) - 1 freq 'with (3) - 1 freq nith (3) - 12 freq inooth (3) - 1 freq inouth (3) - 1 freq with (3) - 856 freq aneith (3) - 8 freq anaith (3) - 6 freq inwutt (3) - 1 freq waith (4) - 2 freq noth (4) - 5 freq woth (4) - 1 freq fowth (4) - 4 freq wyth (4) - 1 freq rowth (4) - 53 freq neth (4) - 5 freq ootwith (4) - 15 freq anaeth (4) - 1 freq nwatch (4) - 1 freq bawth (4) - 1 freq inthe (4) - 2 freq outwith (4) - 9 freq aneath (4) - 105 freq |
SoundEx code - I530 intae - 4586 freq into - 193 freq int - 31 freq in-the-wey - 1 freq in't - 42 freq inti - 218 freq 'intae - 2 freq inty - 21 freq inte - 129 freq intee - 1 freq inthe - 2 freq inta - 109 freq inate - 1 freq in'tae - 2 freq india' - 1 freq india - 21 freq init - 1 freq indyah - 1 freq intue - 1 freq innit - 10 freq intay - 3 freq inda - 1 freq inwith - 11 freq i'end - 2 freq ineed - 1 freq i'windae - 2 freq i'moothie - 1 freq inde - 4 freq indie - 1 freq inouth - 1 freq imid - 1 freq inhad - 1 freq inwutt - 1 freq €˜into - 1 freq intaa - 1 freq indy - 57 freq innate - 3 freq intaea - 1 freq €˜intae - 1 freq €œintae - 1 freq intiae - 1 freq ianthe - 2 freq i'nt - 1 freq inooth - 1 freq inite - 6 freq indy' - 1 freq imed - 1 freq iand - 1 freq innnit - 1 freq |
MetaPhone code - INW0 inwith - 11 freq |
INWITH |
| Time to execute Levenshtein function - 0.290349 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.617089 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.030752 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.046284 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.001006 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. |