| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootac (0) - 1 freq oota (1) - 53 freq ootae (1) - 83 freq ontac (1) - 2 freq ootht (2) - 4 freq tac (2) - 18 freq footan (2) - 1 freq ooted (2) - 1 freq iota (2) - 2 freq gota (2) - 3 freq ootlan (2) - 1 freq ootfaw (2) - 1 freq oot (2) - 1 freq ootlay (2) - 1 freq ontae (2) - 343 freq entac (2) - 1 freq ootwi (2) - 17 freq orta (2) - 1 freq ontak (2) - 33 freq ootby (2) - 128 freq lotae (2) - 1 freq ooten (2) - 9 freq ooter (2) - 25 freq oobag (2) - 1 freq intac (2) - 2 freq |
ootac (0) - 1 freq oota (2) - 53 freq ontac (2) - 2 freq tac (2) - 18 freq ootae (2) - 83 freq tuc (3) - 1 freq ootd (3) - 2 freq ootdae (3) - 5 freq oots (3) - 22 freq etc (3) - 189 freq outa (3) - 6 freq doac (3) - 19 freq oot (3) - 13735 freq oatae (3) - 1 freq ooto (3) - 85 freq oottae (3) - 1 freq tic (3) - 12 freq toc (3) - 2 freq itc (3) - 1 freq taco (3) - 1 freq tc (3) - 3 freq ootin (3) - 5 freq oot' (3) - 4 freq ootcam (3) - 3 freq ootta (3) - 2 freq |
SoundEx code - O320 ots - 2 freq odds - 89 freq odyssey - 6 freq oots - 22 freq oidhche - 1 freq odes - 5 freq oats - 36 freq oats' - 1 freq outch - 1 freq oothoose - 10 freq ootz - 1 freq ootac - 1 freq o't's - 2 freq oaths - 3 freq otago - 2 freq ootgie - 5 freq o'ts - 2 freq odoak' - 1 freq odious - 4 freq oot-tak - 1 freq oot-hoose - 1 freq oottake - 1 freq odxx - 1 freq otz - 1 freq outs - 1 freq odjs - 1 freq o'those - 1 freq o'thise - 1 freq ohdogoaway - 2 freq odige - 1 freq ottzs - 1 freq otq - 2 freq oates - 1 freq otj - 1 freq |
MetaPhone code - OTK ootac - 1 freq otago - 2 freq odoak' - 1 freq oottake - 1 freq otq - 2 freq |
OOTAC |
| Time to execute Levenshtein function - 0.177550 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.344607 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.028323 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.038132 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.001002 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. |