Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bucklet (0) - 1 freq buckles (1) - 2 freq buckled (1) - 7 freq buckle (1) - 12 freq bucklt (1) - 2 freq bucklit (1) - 1 freq bucket (1) - 75 freq buckt (2) - 1 freq bucklin (2) - 7 freq runklet (2) - 1 freq buckies (2) - 11 freq ruckle (2) - 2 freq bullet (2) - 32 freq muckler (2) - 10 freq muckle' (2) - 3 freq bundlet (2) - 2 freq kuckles (2) - 1 freq muckles (2) - 1 freq hacklet (2) - 1 freq buckelt (2) - 2 freq muckle (2) - 2854 freq mucklef (2) - 1 freq bruckle (2) - 15 freq puckle (2) - 316 freq mucklest (2) - 8 freq |
bucklet (0) - 1 freq bucklt (1) - 2 freq bucklit (1) - 1 freq buckles (2) - 2 freq backlit (2) - 1 freq buckle (2) - 12 freq bucket (2) - 75 freq buckelt (2) - 2 freq buckled (2) - 7 freq backet (3) - 8 freq bauchlet (3) - 1 freq tacklet (3) - 1 freq bucklin (3) - 7 freq buckt (3) - 1 freq hacklet (3) - 1 freq booklet (3) - 5 freq muckletae (4) - 2 freq huckles (4) - 1 freq puckles (4) - 14 freq bachlt (4) - 1 freq suckled (4) - 3 freq backbeat (4) - 1 freq backseat (4) - 6 freq kecklt (4) - 3 freq bickert (4) - 3 freq |
SoundEx code - B243 bauchled - 6 freq bogleheid - 1 freq buckled - 7 freq bauchelt - 3 freq bakelite - 3 freq booklet - 5 freq bachlt - 1 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 |
BUCKLET |
Time to execute Levenshtein function - 0.213579 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.335666 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.027401 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.036643 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.000929 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. |