| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gooseberry (0) - 9 freq skooshberry (3) - 3 freq gooseberries (3) - 3 freq blueberry (4) - 13 freq jakeberry (4) - 1 freq goosey (4) - 6 freq 'blueberry (4) - 1 freq blaeberry (4) - 2 freq daveberry (4) - 2 freq goosers (4) - 2 freq raspberry (4) - 15 freq goosebumps (4) - 2 freq hoosebay (4) - 3 freq whosever (5) - 1 freq forebeers (5) - 5 freq gowsteri (5) - 1 freq hostelry (5) - 7 freq gousterie (5) - 1 freq roosters (5) - 3 freq pooskered (5) - 3 freq poothery (5) - 1 freq hooseie (5) - 1 freq hoosoever (5) - 4 freq roodery (5) - 1 freq canterberry (5) - 1 freq |
gooseberry (0) - 9 freq gooseberries (4) - 3 freq daveberry (6) - 2 freq goosers (6) - 2 freq blaeberry (6) - 2 freq raspberry (6) - 15 freq blueberry (6) - 13 freq jakeberry (6) - 1 freq skooshberry (6) - 3 freq gossamer (7) - 4 freq berry (7) - 17 freq sherry (7) - 26 freq gerry (7) - 13 freq gouster (7) - 5 freq snooerry (7) - 1 freq gousters (7) - 3 freq skerry (7) - 7 freq mulberry (7) - 4 freq siferry (7) - 4 freq tuimberry (7) - 1 freq gossaburn (7) - 1 freq gorebrig (7) - 1 freq swerry (7) - 1 freq carberry (7) - 2 freq auskerry (7) - 1 freq |
SoundEx code - G216 gooseberry - 9 freq gossaburn - 1 freq geezabrek - 1 freq gooseberries - 3 freq gusbracks - 1 freq |
MetaPhone code - KSBR gooseberry - 9 freq |
GOOSEBERRY |
| Time to execute Levenshtein function - 0.492690 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 - 1.093841 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.104047 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.118343 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.070196 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. |