| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| out-cum (0) - 2 freq out-cam (1) - 1 freq outcum (1) - 1 freq ootcum (2) - 20 freq outcam (2) - 1 freq ootcam (3) - 3 freq outrun (3) - 1 freq autocue (3) - 1 freq oancum (3) - 1 freq ootcom (3) - 1 freq owercum (3) - 6 freq outcome (3) - 3 freq tocum (3) - 1 freq outlaun (3) - 1 freq owrecum (3) - 3 freq output (3) - 1 freq oot-come (3) - 1 freq out-by (3) - 1 freq outgaun (3) - 2 freq outcry (3) - 1 freq outch (3) - 1 freq upcum (3) - 2 freq oncum (3) - 50 freq out-fuff (3) - 1 freq out-waw (3) - 1 freq |
out-cum (0) - 2 freq out-cam (1) - 1 freq outcum (2) - 1 freq oot-come (3) - 1 freq ootcum (3) - 20 freq outcam (3) - 1 freq tocum (4) - 1 freq outcome (4) - 3 freq ootcom (4) - 1 freq ootcam (4) - 3 freq out-waw (5) - 1 freq talcum (5) - 1 freq oncum (5) - 50 freq oot-comes (5) - 1 freq bak-cum (5) - 1 freq tae-cup (5) - 3 freq ootcome (5) - 47 freq on-come (5) - 1 freq ootcums (5) - 9 freq upcum (5) - 2 freq out-by (5) - 1 freq owrecum (5) - 3 freq outch (5) - 1 freq owercum (5) - 6 freq oancum (5) - 1 freq |
SoundEx code - O325 ootcome - 47 freq ootgang - 4 freq ootsmert - 1 freq ootcom - 1 freq ootsheens - 1 freq ootcumin - 1 freq ootgane - 1 freq ootgaans - 1 freq ootgans - 1 freq outshine - 1 freq ootcum - 20 freq odyssean - 2 freq outcomes - 2 freq ootshine - 3 freq oot-gansh - 1 freq ootcums - 9 freq out-cum - 2 freq outcum - 1 freq outgaun - 2 freq outcome - 3 freq ootcomes - 9 freq ootgaun - 2 freq ootcomin - 1 freq oot-come - 1 freq ootcam - 3 freq out-cam - 1 freq outcam - 1 freq outgauns - 1 freq ootgaen - 1 freq oot-comes - 1 freq ootshines - 1 freq €˜ootcomes - 1 freq outgoing - 1 freq ootgoin - 1 freq |
MetaPhone code - OTKM ootcome - 47 freq ootcom - 1 freq ootcum - 20 freq out-cum - 2 freq outcum - 1 freq outcome - 3 freq oot-come - 1 freq ootcam - 3 freq out-cam - 1 freq outcam - 1 freq |
OUT-CUM |
| Time to execute Levenshtein function - 0.219308 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.350432 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.029021 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.041142 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.001097 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. |