| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inions (0) - 1 freq pinions (1) - 1 freq onions (1) - 17 freq minions (1) - 5 freq unions (1) - 8 freq inion (1) - 1 freq ingans (2) - 9 freq idiots (2) - 20 freq ations (2) - 1 freq sions (2) - 1 freq ninians (2) - 3 freq inns (2) - 8 freq lions (2) - 35 freq invious (2) - 1 freq ingens (2) - 1 freq idioms (2) - 7 freq noons (2) - 1 freq bunions (2) - 2 freq innins (2) - 16 freq sinnons (2) - 1 freq infors (2) - 1 freq injoys (2) - 1 freq minion's (2) - 1 freq icons (2) - 9 freq union (2) - 188 freq |
inions (0) - 1 freq unions (1) - 8 freq onions (1) - 17 freq inns (2) - 8 freq noons (2) - 1 freq inion (2) - 1 freq pinions (2) - 1 freq minions (2) - 5 freq onion (3) - 14 freq ions (3) - 3 freq injins (3) - 1 freq indians (3) - 11 freq inboos (3) - 1 freq sinians (3) - 1 freq ingins (3) - 14 freq irons (3) - 3 freq union' (3) - 1 freq nans (3) - 3 freq nines (3) - 12 freq annoys (3) - 4 freq innes (3) - 14 freq nuns (3) - 8 freq enns (3) - 11 freq linins (3) - 1 freq nouns (3) - 60 freq |
SoundEx code - I552 inions - 1 freq immense - 11 freq immunised - 2 freq innins - 16 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 - 16 freq |
INIONS |
| Time to execute Levenshtein function - 0.305473 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.386763 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.037642 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.041116 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.000859 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. |