| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ïnvitit (0) - 2 freq ïnvitin (1) - 1 freq invitit (2) - 39 freq ïnvite (2) - 3 freq evitit (3) - 2 freq ignitit (3) - 1 freq ïntil (3) - 2 freq invitet (3) - 4 freq unitit (3) - 29 freq invitin (3) - 16 freq invintit (3) - 1 freq convictit (3) - 2 freq skoitit (4) - 1 freq neibit (4) - 3 freq endytit (4) - 1 freq jyntit (4) - 1 freq pentit (4) - 44 freq visit (4) - 147 freq visitit (4) - 2 freq nittit (4) - 1 freq awaitit (4) - 3 freq savitie (4) - 2 freq 'shuitit (4) - 1 freq cantit (4) - 1 freq revisit (4) - 3 freq |
ïnvitit (0) - 2 freq ïnvitin (2) - 1 freq ïnvite (3) - 3 freq invitit (4) - 39 freq invitet (5) - 4 freq ïntil (5) - 2 freq convictit (6) - 2 freq inveetit (6) - 4 freq ïntae (6) - 93 freq invintit (6) - 1 freq invitin (6) - 16 freq evitit (6) - 2 freq unitit (6) - 29 freq ignitit (6) - 1 freq nottit (7) - 3 freq snortit (7) - 16 freq votit (7) - 42 freq inventit (7) - 23 freq unitet (7) - 3 freq uneytit (7) - 1 freq luntit (7) - 3 freq snirtit (7) - 2 freq k'nittit (7) - 1 freq hintit (7) - 2 freq intit (7) - 11 freq |
SoundEx code - N133 naebody'd - 6 freq ïnvitit - 2 freq neepheidit - 1 freq nfutweets - 1 freq |
MetaPhone code - NFTT ïnvitit - 2 freq neepheidit - 1 freq nyght'at - 1 freq knighted - 2 freq |
ÏNVITIT |
| Time to execute Levenshtein function - 0.225684 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.356484 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.029410 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.038398 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.000882 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. |