| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goosers (0) - 2 freq goose's (1) - 1 freq coosers (1) - 1 freq troosers (2) - 77 freq glouers (2) - 1 freq boolers (2) - 1 freq glowers (2) - 9 freq mowsers (2) - 1 freq tooners (2) - 1 freq lousers (2) - 1 freq pooders (2) - 3 freq growers (2) - 1 freq goers (2) - 3 freq grocers (2) - 3 freq gooder' (2) - 1 freq dooters (2) - 2 freq guysers (2) - 2 freq choosers (2) - 2 freq goners (2) - 1 freq guisers (2) - 8 freq tooers (2) - 6 freq boozers (2) - 4 freq hooers (2) - 2 freq hooses (2) - 255 freq sookers (2) - 2 freq |
goosers (0) - 2 freq guysers (2) - 2 freq geysers (2) - 2 freq guisers (2) - 8 freq goose's (2) - 1 freq coosers (2) - 1 freq goers (3) - 3 freq goners (3) - 1 freq gousters (3) - 3 freq lousers (3) - 1 freq posers (3) - 5 freq glouers (3) - 1 freq losers (3) - 3 freq misers (4) - 1 freq gushers (4) - 1 freq gorse (4) - 6 freq gyokeres (4) - 1 freq osiers (4) - 1 freq gaiters (4) - 1 freq looser (4) - 3 freq goose (4) - 28 freq hooters (4) - 3 freq roosters (4) - 3 freq hoose's (4) - 5 freq golfers (4) - 2 freq |
SoundEx code - G262 gushers - 1 freq goosers - 2 freq gawkers - 1 freq geiger-coonter - 1 freq geysers - 2 freq guysers - 2 freq guisers - 8 freq gocharger - 1 freq gkixrqsl - 1 freq gowkairse - 7 freq gowkairsey - 2 freq gowkairserie - 7 freq gowkairsy - 2 freq gowkairses - 1 freq gyokeres - 1 freq |
MetaPhone code - KSRS goosers - 2 freq caesar's - 4 freq kaiser's - 2 freq cowsers - 1 freq czars - 2 freq guysers - 2 freq guisers - 8 freq coosers - 1 freq |
GOOSERS |
| Time to execute Levenshtein function - 0.274953 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.427977 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.029617 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.040598 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.000874 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. |