| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buttonholes (0) - 1 freq buttonhole (1) - 2 freq buttons (4) - 57 freq boat-holes (4) - 1 freq bulletholes (4) - 1 freq ratton-hole (4) - 1 freq buit-soles (4) - 1 freq buttoned (4) - 11 freq bunnles (5) - 3 freq bottles (5) - 115 freq consoles (5) - 1 freq butterfleas (5) - 4 freq guttypole (5) - 1 freq button-buits (5) - 1 freq butterflies (5) - 10 freq bottoals (5) - 1 freq tholes (5) - 17 freq buttocks (5) - 2 freq buttonin (5) - 4 freq bottomless (5) - 1 freq bolt-hole (5) - 1 freq mrtomcoles (5) - 1 freq buttcher's (5) - 1 freq bumhole (5) - 1 freq muttontief (5) - 11 freq |
buttonholes (0) - 1 freq buttonhole (2) - 2 freq boat-holes (6) - 1 freq buttons (6) - 57 freq butterfleas (7) - 4 freq butterflies (7) - 10 freq battles (7) - 26 freq butterflees (7) - 14 freq bottoals (7) - 1 freq bottles (7) - 115 freq ratton-hole (7) - 1 freq bulletholes (7) - 1 freq buit-soles (7) - 1 freq buttoned (7) - 11 freq buttherflees (8) - 1 freq butteries (8) - 23 freq pot-holes (8) - 1 freq buttries (8) - 3 freq bungles (8) - 1 freq rationales (8) - 1 freq bottils (8) - 1 freq battailyies (8) - 1 freq battels (8) - 1 freq button (8) - 92 freq boattles (8) - 7 freq |
SoundEx code - B354 bottomless - 1 freq buttonhole - 2 freq boddamless - 1 freq boddomless - 3 freq badinloskin - 3 freq bedinloskin - 1 freq buttonholes - 1 freq |
MetaPhone code - BTNHLS buttonholes - 1 freq |
BUTTONHOLES |
| Time to execute Levenshtein function - 0.239467 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.410723 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.034014 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.042367 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.000873 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. |