| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| out-by (0) - 1 freq outby (1) - 20 freq outty (2) - 2 freq cum-by (2) - 1 freq outcry (2) - 1 freq pit-by (2) - 1 freq outbye (2) - 10 freq ootby (2) - 128 freq out-cum (3) - 2 freq putey (3) - 3 freq cubby (3) - 1 freq utb (3) - 1 freq outch (3) - 1 freq ootlay (3) - 1 freq ootcry (3) - 1 freq buty (3) - 3 freq cutey (3) - 1 freq fuit-boy (3) - 1 freq outins (3) - 1 freq foutery (3) - 1 freq ruby (3) - 8 freq outlet (3) - 3 freq outa (3) - 6 freq output (3) - 2 freq but-in (3) - 1 freq |
out-by (0) - 1 freq outby (2) - 20 freq ootby (3) - 128 freq outbye (3) - 10 freq pit-by (3) - 1 freq tubby (4) - 1 freq ootbye (4) - 98 freq oot- (4) - 1 freq youtube (4) - 54 freq toby (4) - 7 freq oot-bak (4) - 1 freq up-bye (4) - 1 freq otb (4) - 1 freq lay-by (4) - 3 freq let-be (4) - 1 freq go-by (4) - 2 freq oootby (4) - 1 freq otsb (4) - 1 freq oot-lay (4) - 1 freq outcry (4) - 1 freq utb (4) - 1 freq cum-by (4) - 1 freq fuit-boy (4) - 1 freq outty (4) - 2 freq it- (5) - 5 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 |
OUT-BY |
| Time to execute Levenshtein function - 0.509349 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.648212 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.032332 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.043263 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.001192 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. |