| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inions (0) - 1 freq minions (1) - 5 freq pinions (1) - 1 freq inion (1) - 1 freq unions (1) - 8 freq onions (1) - 17 freq ions (2) - 3 freq idiots (2) - 20 freq ingans (2) - 9 freq irons (2) - 3 freq ingens (2) - 1 freq injins (2) - 1 freq visions (2) - 7 freq minion (2) - 3 freq union's (2) - 1 freq ations (2) - 1 freq noons (2) - 1 freq inns (2) - 8 freq ixion (2) - 1 freq idioms (2) - 8 freq sinnons (2) - 1 freq minion's (2) - 1 freq inboos (2) - 1 freq ingins (2) - 15 freq union (2) - 192 freq |
inions (0) - 1 freq unions (1) - 8 freq onions (1) - 17 freq inion (2) - 1 freq minions (2) - 5 freq inns (2) - 8 freq noons (2) - 1 freq pinions (2) - 1 freq opinions (3) - 28 freq indians (3) - 11 freq uinion (3) - 1 freq injoys (3) - 1 freq sions (3) - 1 freq ninians (3) - 3 freq lions (3) - 35 freq sinians (3) - 1 freq bunions (3) - 2 freq onion (3) - 14 freq annoys (3) - 4 freq nans (3) - 3 freq nouns (3) - 60 freq nuns (3) - 8 freq enns (3) - 11 freq anns (3) - 1 freq innes (3) - 14 freq |
SoundEx code - I552 inions - 1 freq immense - 14 freq immunised - 2 freq innins - 17 freq immensely - 2 freq i'meenister - 1 freq i'mannie's - 1 freq inimies - 2 freq inemies - 3 freq inning - 1 freq immensities - 1 freq ionamckay - 11 freq |
MetaPhone code - INNS inions - 1 freq innins - 17 freq |
INIONS |
| Time to execute Levenshtein function - 0.372191 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.597207 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.032268 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.040231 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.000897 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. |