| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glabber (0) - 1 freq clabber (1) - 13 freq slabber (1) - 9 freq slabbern (2) - 1 freq jabber (2) - 4 freq slabbery (2) - 7 freq clobber (2) - 6 freq clabbert (2) - 2 freq grabben (2) - 1 freq blubber (2) - 9 freq glaumer (2) - 1 freq slubber (2) - 1 freq clamber (2) - 5 freq grabbed (2) - 77 freq slabbers (2) - 5 freq clabbers (2) - 1 freq dabber (2) - 3 freq glacier (2) - 2 freq clabbery (2) - 2 freq glazier (2) - 1 freq glimmer (3) - 15 freq lapper (3) - 1 freq plaster (3) - 14 freq glaciers (3) - 2 freq plainer (3) - 3 freq |
glabber (0) - 1 freq clabber (2) - 13 freq slabber (2) - 9 freq blubber (3) - 9 freq slubber (3) - 1 freq clabbery (3) - 2 freq clobber (3) - 6 freq slabbery (3) - 7 freq clabbers (4) - 1 freq slebbery (4) - 1 freq dabber (4) - 3 freq slabbers (4) - 5 freq glacier (4) - 2 freq glazier (4) - 1 freq slabbern (4) - 1 freq grabbed (4) - 77 freq jabber (4) - 4 freq clabbert (4) - 2 freq clamber (4) - 5 freq glaumer (4) - 1 freq grabben (4) - 1 freq labour (5) - 276 freq gabby (5) - 1 freq glenboor (5) - 1 freq glaur (5) - 100 freq |
SoundEx code - G416 gale-force' - 1 freq gilbert - 15 freq golfer - 1 freq glaiberin - 1 freq gilbert's - 1 freq gilberto - 1 freq golfers - 2 freq gulliver's - 3 freq gilbertese - 1 freq gallowayforestpark - 1 freq galbraith - 2 freq galbraith's - 1 freq galbraiths - 1 freq glabber - 1 freq €˜gilbert - 1 freq gulberwick - 1 freq gilbertsongrant - 1 freq gallowayforest - 1 freq |
MetaPhone code - KLBR clobber - 6 freq calabar - 1 freq clabber - 13 freq calibre - 3 freq glabber - 1 freq clábar - 1 freq clabbery - 2 freq |
GLABBER |
| Time to execute Levenshtein function - 0.229433 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.489529 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.030011 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.045432 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.001069 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. |