Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oootby (0) - 1 freq ootby (1) - 128 freq ootbye (2) - 98 freq doonby (2) - 20 freq booby (2) - 9 freq sooty (2) - 9 freq goodby (2) - 1 freq footy (2) - 3 freq footba (2) - 2 freq gooby (2) - 2 freq ootby' (2) - 1 freq outby (2) - 20 freq roothy (2) - 1 freq ooty (2) - 21 freq pootsy (2) - 1 freq toothy (2) - 4 freq opoty (2) - 1 freq booty (2) - 1 freq looby (2) - 1 freq out-by (3) - 1 freq skooty (3) - 2 freq dooter (3) - 3 freq robby (3) - 5 freq googly (3) - 3 freq ootae (3) - 83 freq |
oootby (0) - 1 freq ootby (1) - 128 freq outby (2) - 20 freq ootbye (2) - 98 freq toby (3) - 7 freq ooty (3) - 21 freq looby (3) - 1 freq outbye (3) - 10 freq gooby (3) - 2 freq ootby' (3) - 1 freq booby (3) - 9 freq otb (3) - 1 freq footba (3) - 2 freq ootz (4) - 1 freq toot (4) - 33 freq ooto (4) - 85 freq oorbye (4) - 1 freq oob (4) - 1 freq tbe (4) - 1 freq yooth (4) - 6 freq onby (4) - 1 freq boaby (4) - 5 freq aitbo (4) - 1 freq oota (4) - 53 freq outty (4) - 2 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 |
OOOTBY |
Time to execute Levenshtein function - 0.168828 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.351532 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.027941 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.036442 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.000829 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. |