| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| garscadden (0) - 2 freq tlscadden (3) - 1 freq scadded (4) - 1 freq arcades (4) - 2 freq pluscarden (4) - 1 freq grandadden (4) - 1 freq cascadin (4) - 5 freq cascade (4) - 3 freq arcade (4) - 8 freq garden (4) - 67 freq cascaded (4) - 1 freq rossmadden (4) - 1 freq asudden (4) - 1 freq scaddit (5) - 1 freq parades (5) - 7 freq bastardin (5) - 3 freq saracen (5) - 1 freq scalder (5) - 2 freq groanen (5) - 1 freq barricade (5) - 1 freq scudded (5) - 6 freq graven (5) - 1 freq discardin (5) - 4 freq adden (5) - 1 freq roadmen (5) - 1 freq |
garscadden (0) - 2 freq tlscadden (5) - 1 freq grandadden (6) - 1 freq garden (7) - 67 freq asudden (7) - 1 freq scuddin (7) - 5 freq rossmadden (7) - 1 freq cascaded (7) - 1 freq scadded (7) - 1 freq pluscarden (7) - 1 freq cascadin (7) - 5 freq gledden (8) - 1 freq rodden (8) - 15 freq gairdeen (8) - 4 freq sudden (8) - 213 freq kirkcaddy (8) - 1 freq graddol (8) - 2 freq graddad (8) - 1 freq forbidden (8) - 15 freq orcadian (8) - 51 freq gerdeen (8) - 10 freq persuaadin (8) - 1 freq gosden (8) - 1 freq perswaddit (8) - 1 freq persuadin (8) - 9 freq |
SoundEx code - G623 grazed - 5 freq grossit - 2 freq grushed - 1 freq grosets - 3 freq gairsty - 2 freq goargit - 1 freq groustie - 2 freq grayssed - 1 freq grist - 36 freq greased - 3 freq grectin - 1 freq graced - 4 freq grassed - 5 freq greased-back - 1 freq greasy-heidit - 1 freq gurged - 1 freq gorged - 2 freq gristle - 3 freq greast - 1 freq grogged - 1 freq gree-get - 1 freq greastest - 1 freq girst - 2 freq grossets - 1 freq gourgaud - 1 freq grosset - 2 freq gorsedh - 1 freq garscadden - 2 freq garygatesmusic - 1 freq georgethepoet - 1 freq grctjk - 1 freq grozet - 1 freq greggwatson - 1 freq |
MetaPhone code - KRSKTN garscadden - 2 freq |
GARSCADDEN |
| Time to execute Levenshtein function - 0.469007 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.602212 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.034990 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.093969 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.001068 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. |