| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buckled (0) - 7 freq bucklet (1) - 1 freq buckle (1) - 11 freq suckled (1) - 3 freq huckled (1) - 12 freq buckles (1) - 1 freq muckle (2) - 2838 freq hickled (2) - 1 freq mucklef (2) - 1 freq burled (2) - 2 freq bauchled (2) - 6 freq runkled (2) - 17 freq bucket (2) - 75 freq bumfled (2) - 1 freq bucklit (2) - 1 freq heckled (2) - 1 freq runckled (2) - 1 freq knuckled (2) - 4 freq buckie (2) - 45 freq bachled (2) - 1 freq tickled (2) - 8 freq muckles (2) - 1 freq sucked (2) - 5 freq pickled (2) - 10 freq ruckle (2) - 2 freq |
buckled (0) - 7 freq huckled (2) - 12 freq suckled (2) - 3 freq buckles (2) - 1 freq buckle (2) - 11 freq bucklet (2) - 1 freq bucklin (3) - 7 freq keckled (3) - 11 freq cockled (3) - 2 freq pickled (3) - 10 freq teckled (3) - 1 freq cackled (3) - 2 freq binkled (3) - 1 freq rickled (3) - 1 freq becked (3) - 1 freq tickled (3) - 8 freq backed (3) - 27 freq buckhead (3) - 2 freq tackled (3) - 1 freq bucklt (3) - 2 freq bauchled (3) - 6 freq hickled (3) - 1 freq heckled (3) - 1 freq bucklit (3) - 1 freq bachled (3) - 1 freq |
SoundEx code - B243 bauchled - 6 freq bogleheid - 1 freq buckled - 7 freq bauchelt - 3 freq bakelite - 3 freq booklet - 5 freq boggle-eed - 1 freq bachled - 1 freq bucklt - 2 freq bekalite - 1 freq backslide - 1 freq basalt - 2 freq buik-leet - 1 freq buik-leets - 1 freq bauchilt - 2 freq bi-cultural - 1 freq bucklit - 1 freq buckelt - 2 freq becloods - 1 freq backcloth - 1 freq backlit - 1 freq back-claiths - 1 freq backslider - 1 freq backsliders - 1 freq bauchlet - 1 freq bucklet - 1 freq boglet - 1 freq bzlitwvj - 1 freq backsliding - 1 freq bighollywood - 3 freq |
MetaPhone code - BKLT buckled - 7 freq bakelite - 3 freq booklet - 5 freq boggle-eed - 1 freq bucklt - 2 freq bekalite - 1 freq buik-leet - 1 freq bucklit - 1 freq buckelt - 2 freq backlit - 1 freq bucklet - 1 freq boglet - 1 freq |
BUCKLED |
| Time to execute Levenshtein function - 0.279220 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.468315 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.028803 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.040182 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.001146 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. |