| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ziofx (0) - 1 freq zif (2) - 13 freq zion (2) - 2 freq zio (2) - 1 freq sioux (2) - 2 freq uiox (2) - 1 freq iof (2) - 1 freq zfoqx (2) - 1 freq coff (3) - 19 freq hoof (3) - 15 freq sion (3) - 1 freq 'of' (3) - 1 freq rio (3) - 5 freq coft (3) - 9 freq zinc (3) - 5 freq tion (3) - 1 freq zool (3) - 7 freq biffo (3) - 2 freq zino (3) - 1 freq croft (3) - 53 freq coofs (3) - 5 freq soft (3) - 52 freq tiefe (3) - 1 freq fiot (3) - 1 freq coof (3) - 7 freq |
ziofx (0) - 1 freq zfoqx (3) - 1 freq zif (3) - 13 freq foax (4) - 1 freq izx (4) - 1 freq zf (4) - 2 freq zfe (4) - 1 freq airfix (4) - 1 freq fox (4) - 73 freq uorfx (4) - 1 freq zx (4) - 1 freq yifoox (4) - 1 freq sioux (4) - 2 freq zio (4) - 1 freq zion (4) - 2 freq uiox (4) - 1 freq fx (4) - 4 freq fix (4) - 70 freq iof (4) - 1 freq zippo (5) - 1 freq iffy (5) - 1 freq loff (5) - 2 freq knox (5) - 34 freq sif (5) - 4 freq jix (5) - 1 freq |
SoundEx code - Z120 zfoqx - 1 freq zebwc - 1 freq ziofx - 1 freq zvhsw - 1 freq zvs - 1 freq zbji - 1 freq zfjq - 1 freq zgzbqc - 1 freq |
MetaPhone code - SFKS suffix - 20 freq ceefax - 1 freq ziofx - 1 freq |
ZIOFX |
| Time to execute Levenshtein function - 0.186879 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.345227 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.027701 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.037125 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.000877 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. |