| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootcomes (0) - 9 freq ootcome (1) - 47 freq outcomes (1) - 2 freq oot-comes (1) - 1 freq €˜ootcomes (2) - 1 freq ootcom (2) - 1 freq ootcums (2) - 9 freq ootcomin (2) - 1 freq outcome (2) - 3 freq oot-come (2) - 1 freq ootcumin (3) - 1 freq ootcasts (3) - 1 freq oonces (3) - 3 freq welcomes (3) - 3 freq ootcottj (3) - 1 freq ootgies (3) - 1 freq ootdoors (3) - 9 freq ootwales (3) - 1 freq walcomes (3) - 5 freq ootlives (3) - 1 freq ootlines (3) - 6 freq ootmest (3) - 1 freq oncome (3) - 40 freq ootcam (3) - 3 freq notches (3) - 1 freq |
ootcomes (0) - 9 freq outcomes (1) - 2 freq oot-comes (2) - 1 freq ootcums (2) - 9 freq ootcome (2) - 47 freq ootcomin (3) - 1 freq outcome (3) - 3 freq ootcom (3) - 1 freq oncoms (4) - 1 freq upcomes (4) - 1 freq ootcam (4) - 3 freq becomes (4) - 42 freq oatcakes (4) - 22 freq ootcum (4) - 20 freq comes (4) - 926 freq incomes (4) - 1 freq ootcumin (4) - 1 freq oot-come (4) - 1 freq €˜ootcomes (4) - 1 freq oothooses (5) - 3 freq outcum (5) - 1 freq touches (5) - 21 freq owercomes (5) - 8 freq termes (5) - 1 freq toms (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 - OTKMS outcomes - 2 freq ootcums - 9 freq ootcomes - 9 freq oot-comes - 1 freq €˜ootcomes - 1 freq |
OOTCOMES |
| Time to execute Levenshtein function - 0.226192 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.394670 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.027600 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.040443 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.001081 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. |