| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| butler (0) - 8 freq butter (1) - 129 freq buther (1) - 11 freq butcher (2) - 36 freq bugle (2) - 2 freq buile (2) - 1 freq buyer (2) - 8 freq cuter (2) - 1 freq b'iler (2) - 1 freq bunder (2) - 1 freq hitler (2) - 10 freq ruther (2) - 3 freq burley (2) - 1 freq bumper (2) - 3 freq beter (2) - 1 freq builder (2) - 14 freq culler (2) - 1 freq bullet (2) - 32 freq bither (2) - 12 freq bitter (2) - 109 freq burker (2) - 2 freq busker (2) - 2 freq burner (2) - 3 freq butted (2) - 5 freq bunker (2) - 22 freq |
butler (0) - 8 freq butter (2) - 129 freq buther (2) - 11 freq bither (3) - 12 freq bitter (3) - 109 freq buttir (3) - 2 freq byler (3) - 3 freq tytler (3) - 1 freq biyler (3) - 1 freq biter (3) - 1 freq cutlery (3) - 14 freq butlin (3) - 2 freq bother (3) - 322 freq bather (3) - 58 freq beyler (3) - 1 freq beter (3) - 1 freq biler (3) - 8 freq bueller (3) - 1 freq buttery (3) - 24 freq batter (3) - 68 freq b'iler (3) - 1 freq hitler (3) - 10 freq boiler (3) - 4 freq baler (3) - 4 freq better (3) - 1675 freq |
SoundEx code - B346 butler - 8 freq bowdlerised - 1 freq baudelaire - 81 freq baudelairean - 1 freq baudelaires - 14 freq baudelaires' - 1 freq baudelairc - 1 freq butler's - 1 freq battle-hardened - 1 freq bwdlr - 1 freq bottlers - 1 freq |
MetaPhone code - BTLR butler - 8 freq baudelaire - 81 freq bwdlr - 1 freq |
BUTLER |
| Time to execute Levenshtein function - 0.188267 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.335014 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.027523 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.036740 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.000867 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. |