| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oot-come (0) - 1 freq ootcome (1) - 48 freq oot-comes (1) - 1 freq ootcom (2) - 1 freq on-come (2) - 1 freq outcome (2) - 4 freq ootcomes (2) - 9 freq oot-hoose (3) - 1 freq oorisome (3) - 1 freq dootsome (3) - 1 freq oot-ower (3) - 1 freq oncome (3) - 40 freq ootcomin (3) - 1 freq dooncome (3) - 1 freq oot-d'ye (3) - 1 freq ootcam (3) - 3 freq oercome (3) - 1 freq oot-owre (3) - 1 freq ower-come (3) - 1 freq douncome (3) - 2 freq o'er-come (3) - 1 freq ootcum (3) - 20 freq outcomes (3) - 2 freq owrecome (3) - 1 freq oot-foxed (3) - 1 freq |
oot-come (0) - 1 freq oot-comes (2) - 1 freq ootcome (2) - 48 freq out-cum (3) - 2 freq outcome (3) - 4 freq out-cam (3) - 1 freq on-come (3) - 1 freq ootcom (3) - 1 freq ootcam (4) - 3 freq ootcomes (4) - 9 freq ootcum (4) - 20 freq overcome (5) - 2 freq doun-come (5) - 1 freq t-name (5) - 1 freq oncome (5) - 40 freq outcam (5) - 1 freq ootcums (5) - 9 freq oot-hoose (5) - 1 freq outcum (5) - 1 freq owercome (5) - 22 freq outcomes (5) - 2 freq owrecome (5) - 1 freq oercome (5) - 1 freq oot-d'ye (5) - 1 freq dooncome (5) - 1 freq |
SoundEx code - O325 ootcome - 48 freq ootgang - 4 freq ootsmert - 1 freq ootcom - 1 freq ootsheens - 1 freq ootcumin - 1 freq ootgane - 1 freq ootgaans - 1 freq outcome - 4 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 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 - 48 freq ootcom - 1 freq outcome - 4 freq ootcum - 20 freq out-cum - 2 freq outcum - 1 freq oot-come - 1 freq ootcam - 3 freq out-cam - 1 freq outcam - 1 freq |
OOT-COME |
| Time to execute Levenshtein function - 0.704169 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 - 1.585145 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.088132 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.091539 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.001103 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. |