| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootower (0) - 22 freq outower (1) - 5 freq oot-ower (1) - 1 freq ootowre (2) - 6 freq out-ower (2) - 1 freq stower (2) - 1 freq soower (2) - 1 freq kowtower (2) - 1 freq ooter (2) - 25 freq atower (2) - 1 freq tower (2) - 44 freq oktober (2) - 2 freq october (2) - 87 freq €œower (3) - 4 freq towe (3) - 21 freq otter (3) - 3 freq ooto (3) - 85 freq poorer (3) - 5 freq ooted (3) - 1 freq tottier (3) - 2 freq coothier (3) - 2 freq ootset (3) - 15 freq poother (3) - 5 freq €œfower (3) - 2 freq hooiwer (3) - 1 freq |
ootower (0) - 22 freq outower (1) - 5 freq atower (2) - 1 freq tower (2) - 44 freq ootowre (2) - 6 freq oot-ower (2) - 1 freq outowre (3) - 1 freq ooter (3) - 25 freq out-ower (3) - 1 freq stower (3) - 1 freq soower (3) - 1 freq bower (4) - 10 freq takower (4) - 1 freq totier (4) - 1 freq dower (4) - 2 freq otder (4) - 1 freq wooer (4) - 3 freq towes (4) - 6 freq layower (4) - 1 freq to'oer (4) - 2 freq towers (4) - 19 freq oot-owre (4) - 1 freq ootward (4) - 6 freq fyower (4) - 1 freq touer (4) - 60 freq |
SoundEx code - O360 other - 530 freq ooter - 25 freq ootower - 22 freq out-throu - 6 freq oot-throu - 8 freq 'out-throu - 1 freq odder - 1 freq odour - 3 freq outdoor - 7 freq otder - 1 freq otter - 3 freq ootowre - 6 freq 'other - 1 freq oot-thru - 1 freq other' - 2 freq owder - 1 freq odhar - 1 freq outer - 4 freq ootdoor - 8 freq ootthrou - 9 freq owthar - 5 freq oh-tuh-rah - 7 freq outower - 5 freq owider - 1 freq owthor - 11 freq othir - 1 freq outhir - 1 freq owther - 5 freq oot-ower - 1 freq oot-owre - 1 freq 'other' - 1 freq out-ower - 1 freq outowre - 1 freq outdoory - 1 freq €˜other - 1 freq odoir - 3 freq o'their - 1 freq |
MetaPhone code - OTWR ootower - 22 freq outower - 5 freq oot-ower - 1 freq out-ower - 1 freq |
OOTOWER |
| Time to execute Levenshtein function - 0.575599 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.909807 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.027851 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.084281 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.000846 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. |