| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grottybuckies (0) - 1 freq grotti-buckie (3) - 1 freq grottie-buckie's (4) - 2 freq grottie-buckie (4) - 6 freq goodbucket (6) - 1 freq stuckies (6) - 2 freq grottie (6) - 1 freq arbuckles (6) - 1 freq buckies (6) - 11 freq groaties (6) - 2 freq trowlybuses (6) - 1 freq onybuddies (6) - 1 freq rockies (6) - 1 freq grotesques (6) - 1 freq gritty-like (6) - 1 freq robberies (7) - 2 freq rottankind (7) - 1 freq gottfried (7) - 1 freq guckie (7) - 1 freq proteckit (7) - 1 freq guckie's (7) - 1 freq trackies (7) - 8 freq nott-wurdie (7) - 1 freq groupie (7) - 3 freq arbuckle (7) - 9 freq |
grottybuckies (0) - 1 freq grotti-buckie (5) - 1 freq grottie-buckie (6) - 6 freq grottie-buckie's (6) - 2 freq gritty-like (9) - 1 freq pratticks (9) - 10 freq grotesques (10) - 1 freq proticks (10) - 1 freq grottie (10) - 1 freq starbucks (10) - 2 freq rockies (10) - 1 freq goodbucket (10) - 1 freq arbuckles (10) - 1 freq buckies (10) - 11 freq groaties (10) - 2 freq stuckies (10) - 2 freq gritters (11) - 1 freq draabacks (11) - 1 freq restricks (11) - 1 freq irthquakes (11) - 1 freq strickies (11) - 1 freq brickies (11) - 2 freq gutties (11) - 11 freq buttocks (11) - 2 freq vratchies (11) - 1 freq |
SoundEx code - G631 grateful - 33 freq gratfu' - 1 freq gratefu - 28 freq gratified - 1 freq gratefoo - 4 freq gratefoo's - 1 freq gratefu' - 1 freq gratefully - 3 freq girthpooch - 1 freq gratefil - 1 freq grotti-buckie - 1 freq grottie-buckie - 6 freq grottie-buckie's - 2 freq graetful - 1 freq gardyveen - 2 freq gratefull - 2 freq gratification - 1 freq grateffu - 1 freq grytfu - 1 freq growed-up - 1 freq growed-ups - 1 freq guard-pickets - 1 freq greatfu - 1 freq greattv - 1 freq gqkourdfug - 1 freq grottybuckies - 1 freq garethbale - 1 freq |
MetaPhone code - KRTBKS grottie-buckie's - 2 freq grottybuckies - 1 freq |
GROTTYBUCKIES |
| Time to execute Levenshtein function - 0.246748 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.464715 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.028983 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.046443 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.000937 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. |