Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ootby (0) - 128 freq oootby (1) - 1 freq ooty (1) - 21 freq ootbye (1) - 98 freq outby (1) - 20 freq ootby' (1) - 1 freq footy (2) - 3 freq orty (2) - 1 freq onty (2) - 3 freq ootwi (2) - 17 freq footba (2) - 2 freq totey (2) - 20 freq cosby (2) - 1 freq ooted (2) - 1 freq opoty (2) - 1 freq ootht (2) - 4 freq bothy (2) - 48 freq forby (2) - 491 freq sooty (2) - 9 freq dotty (2) - 1 freq oorbye (2) - 1 freq ooto (2) - 85 freq onby (2) - 1 freq oot- (2) - 1 freq looby (2) - 1 freq |
ootby (0) - 128 freq ootbye (1) - 98 freq oootby (1) - 1 freq outby (1) - 20 freq toby (2) - 7 freq outbye (2) - 10 freq otb (2) - 1 freq ootby' (2) - 1 freq ooty (2) - 21 freq gooby (3) - 2 freq ootd (3) - 2 freq oot' (3) - 4 freq oota (3) - 53 freq roby (3) - 1 freq outty (3) - 2 freq ooten (3) - 9 freq ootz (3) - 1 freq out-by (3) - 1 freq ootin (3) - 5 freq oob (3) - 1 freq loaby (3) - 3 freq tb (3) - 14 freq tbe (3) - 1 freq utb (3) - 1 freq toyboy (3) - 1 freq |
SoundEx code - O310 ootby - 128 freq outbye - 10 freq outby - 20 freq ootby' - 1 freq ootbye - 98 freq out-by - 1 freq ootfaw - 1 freq otb - 1 freq oootby - 1 freq odf - 1 freq |
MetaPhone code - OTB ootby - 128 freq outby - 20 freq ootby' - 1 freq out-by - 1 freq otb - 1 freq oootby - 1 freq |
OOTBY |
Time to execute Levenshtein function - 0.182828 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.384501 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.032597 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.039252 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.000804 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. |