| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unites (0) - 4 freq unitet (1) - 3 freq units (1) - 21 freq unite (1) - 11 freq united (1) - 75 freq unter (2) - 1 freq unit (2) - 41 freq untee (2) - 1 freq inite (2) - 6 freq uizes (2) - 7 freq 'united (2) - 1 freq writes (2) - 44 freq invites (2) - 11 freq nite (2) - 87 freq unkit's (2) - 1 freq mites (2) - 1 freq nives (2) - 2 freq knifes (2) - 3 freq snite (2) - 2 freq skites (2) - 15 freq cites (2) - 12 freq snipes (2) - 3 freq nit's (2) - 1 freq knives (2) - 19 freq evites (2) - 1 freq |
unites (0) - 4 freq units (1) - 21 freq notes (2) - 113 freq anits (2) - 2 freq nits (2) - 21 freq united (2) - 75 freq unitet (2) - 3 freq unite (2) - 11 freq unity (3) - 45 freq sites (3) - 22 freq unions (3) - 8 freq knits (3) - 3 freq nats (3) - 2 freq unitin (3) - 2 freq ints (3) - 1 freq kites (3) - 6 freq suites (3) - 2 freq elites (3) - 5 freq nines (3) - 12 freq undies (3) - 3 freq notis (3) - 1 freq unter (3) - 1 freq inuits (3) - 2 freq aunties (3) - 16 freq gites (3) - 1 freq |
SoundEx code - U532 untwist - 3 freq untouched - 5 freq untaigelt - 3 freq untouchable - 3 freq unites - 4 freq undisturbed - 3 freq undeservin - 1 freq untiques - 3 freq undies - 3 freq undesirable - 1 freq ummidius - 2 freq undescendit - 1 freq untucked - 2 freq units - 21 freq unthack - 1 freq undistinguishable - 1 freq undisguisit - 1 freq unnoticed - 3 freq un-educatit - 1 freq uneducatit - 2 freq unthocht - 2 freq unmatchin - 1 freq unmatched - 1 freq undignifeed - 1 freq unethical - 1 freq undesirables - 1 freq undecidit - 1 freq undecidtit - 1 freq uneddicate - 1 freq uneddicatit - 1 freq uneducated - 2 freq undecided - 2 freq uunhddaky - 1 freq undisclosed - 2 freq |
MetaPhone code - UNTS unites - 4 freq undies - 3 freq units - 21 freq |
UNITES |
| Time to execute Levenshtein function - 0.199702 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.359877 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.028094 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.038320 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.000804 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. |