| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| occupy (0) - 7 freq occupyd (1) - 1 freq occurt (2) - 1 freq occurs (2) - 7 freq occupyin (2) - 2 freq occur (2) - 7 freq occult (2) - 3 freq caup (3) - 11 freq scrapy (3) - 1 freq occam (3) - 1 freq mccaty (3) - 1 freq obusy (3) - 1 freq cuppy (3) - 3 freq occupeed (3) - 1 freq cuby (3) - 1 freq accur (3) - 1 freq coup (3) - 25 freq acceps (3) - 1 freq oncums (3) - 2 freq oupa (3) - 1 freq coapy (3) - 2 freq cluny (3) - 2 freq cappy (3) - 3 freq occupier (3) - 1 freq oncum (3) - 50 freq |
occupy (0) - 7 freq occupyd (2) - 1 freq accep (3) - 12 freq ccp (3) - 3 freq occur (3) - 7 freq occupyin (3) - 2 freq clup (4) - 1 freq accept (4) - 76 freq accuse (4) - 6 freq copy (4) - 100 freq hiccup (4) - 1 freq occupier (4) - 1 freq corpy (4) - 1 freq occa (4) - 1 freq iccy (4) - 1 freq cup (4) - 316 freq icecap (4) - 1 freq scaup (4) - 5 freq cappy (4) - 3 freq accepp (4) - 3 freq occupied (4) - 20 freq compy (4) - 1 freq occupies (4) - 1 freq occupeed (4) - 1 freq occult (4) - 3 freq |
SoundEx code - O210 occupy - 7 freq okap - 1 freq ohewkuv - 1 freq o'cheap - 1 freq oqkpp - 1 freq oakiv - 1 freq ogyof - 1 freq oqf - 1 freq osp - 2 freq |
MetaPhone code - OKKP occupy - 7 freq oqkpp - 1 freq |
OCCUPY |
| Time to execute Levenshtein function - 0.184013 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.343183 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.028381 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.037397 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.000899 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. |