| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivors (0) - 1 freq ivor (1) - 19 freq ivor's (1) - 2 freq ivory (1) - 8 freq ivorys (1) - 1 freq ior (2) - 1 freq igor (2) - 6 freq vork (2) - 1 freq irons (2) - 3 freq koors (2) - 1 freq ivur (2) - 2 freq ivvry (2) - 20 freq oors (2) - 353 freq avows (2) - 1 freq minors (2) - 1 freq ivr (2) - 1 freq ivry (2) - 124 freq ihor (2) - 1 freq divers (2) - 10 freq ions (2) - 3 freq irs (2) - 1 freq vivers (2) - 1 freq 'oors (2) - 9 freq poors (2) - 30 freq divots (2) - 5 freq |
ivors (0) - 1 freq ivorys (1) - 1 freq vers (2) - 1 freq voars (2) - 3 freq overs (2) - 2 freq ivory (2) - 8 freq ivor's (2) - 2 freq ivor (2) - 19 freq kivers (3) - 3 freq voss (3) - 10 freq rivers (3) - 30 freq a-ors (3) - 1 freq irois (3) - 1 freq livers (3) - 1 freq vore (3) - 2 freq vols (3) - 1 freq ivery (3) - 188 freq ivir (3) - 33 freq vous (3) - 6 freq fivers (3) - 3 freq cors (3) - 1 freq versy (3) - 1 freq veers (3) - 1 freq versa (3) - 4 freq verse (3) - 127 freq |
SoundEx code - I162 iversson - 1 freq iverssons - 1 freq iver-risin - 1 freq ibrox - 10 freq ivergreen - 1 freq iverchyngin - 1 freq ivors - 1 freq ivor's - 2 freq i'first - 1 freq i'briks - 1 freq i'parks - 1 freq i'broch - 1 freq i'park - 2 freq i'press - 1 freq i'brig - 1 freq i'brakfast - 2 freq i'varsity - 2 freq i'fairies - 1 freq iver-gaitherin - 1 freq ibroxioyal - 2 freq iverson - 1 freq ivorys - 1 freq |
MetaPhone code - IFRS ivors - 1 freq ivor's - 2 freq i'fairies - 1 freq ivorys - 1 freq |
IVORS |
| Time to execute Levenshtein function - 0.258627 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.426264 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.027457 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.050029 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.004203 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. |