| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wikipedia (0) - 25 freq qikipedia (1) - 5 freq wikipedia's (2) - 2 freq wikimediauk (3) - 1 freq wipped (4) - 1 freq wiida (4) - 1 freq wimperin (4) - 1 freq wisped (4) - 1 freq nicomedia (4) - 1 freq wiped (4) - 23 freq wikein (4) - 2 freq wiceia (4) - 1 freq lilied (5) - 1 freq kezia (5) - 5 freq winged (5) - 5 freq skippin (5) - 21 freq likenin (5) - 2 freq wakkenin (5) - 2 freq stampedin (5) - 1 freq widged (5) - 1 freq dividit (5) - 7 freq tipexin (5) - 1 freq wised (5) - 1 freq riviera (5) - 1 freq skippit (5) - 8 freq |
wikipedia (0) - 25 freq qikipedia (2) - 5 freq wikipedia's (4) - 2 freq wisped (5) - 1 freq wiped (5) - 23 freq wipped (5) - 1 freq wikimediauk (5) - 1 freq wikend (6) - 10 freq wak'ed (6) - 3 freq warped (6) - 5 freq wapped (6) - 5 freq wykened (6) - 1 freq whooped (6) - 1 freq wupped (6) - 7 freq wheeped (6) - 5 freq wikkday (6) - 1 freq waikened (6) - 3 freq wakked (6) - 5 freq wakened (6) - 9 freq wikeind (6) - 1 freq wikein (6) - 2 freq wiida (6) - 1 freq wknd (7) - 2 freq skipta (7) - 1 freq biked (7) - 1 freq |
SoundEx code - W213 whuskie-bottle - 1 freq wikipedia - 25 freq wikipedia's - 2 freq weighpad - 2 freq wisped - 1 freq wgxbt - 1 freq |
MetaPhone code - WKPT wikipedia - 25 freq |
WIKIPEDIA |
| Time to execute Levenshtein function - 0.332253 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.715634 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.061568 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.076559 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.000894 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. |