| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gratetul (0) - 1 freq grateful (1) - 33 freq graetful (2) - 1 freq gratefu' (2) - 1 freq gratet (2) - 1 freq graceful (2) - 10 freq gratefull (2) - 2 freq gratefu (2) - 28 freq gratefil (2) - 1 freq gratefully (3) - 3 freq gratfu' (3) - 1 freq sattul (3) - 1 freq grate's (3) - 1 freq grates (3) - 5 freq grated (3) - 1 freq craetur (3) - 2 freq graetly (3) - 1 freq rattult (3) - 2 freq hateful (3) - 4 freq rattil (3) - 1 freq gratefoo (3) - 4 freq gracefu (3) - 5 freq gratitude (3) - 16 freq trateur (3) - 1 freq grate (3) - 18 freq |
gratetul (0) - 1 freq grateful (2) - 33 freq gratefil (3) - 1 freq gratet (3) - 1 freq graetful (3) - 1 freq graetly (4) - 1 freq gratitude (4) - 16 freq gretel (4) - 2 freq brattil (4) - 1 freq rattil (4) - 1 freq gratefu' (4) - 1 freq gratefu (4) - 28 freq graceful (4) - 10 freq gratefull (4) - 2 freq grottie (5) - 1 freq grett (5) - 34 freq grotty (5) - 1 freq grettir (5) - 3 freq gretter (5) - 2 freq grittin (5) - 3 freq grotto (5) - 3 freq glottal (5) - 11 freq gratiteid (5) - 2 freq groattie (5) - 1 freq prattle (5) - 29 freq |
SoundEx code - G633 guairdit - 6 freq greeted - 28 freq graithed - 12 freq gairdit - 6 freq greetit - 10 freq graduate - 11 freq gairded - 3 freq gratitude - 16 freq guarded - 2 freq garrottit - 1 freq gratetul - 1 freq gritted - 3 freq graduated - 2 freq gratet - 1 freq geordietta - 17 freq gyrated - 1 freq graduates - 3 freq guardit - 1 freq graduation - 2 freq garthdee - 7 freq greitit - 1 freq graduatin - 2 freq girded - 1 freq gradyooit - 2 freq guairded - 3 freq garritted - 1 freq gradations - 1 freq graded - 3 freq garrotted - 1 freq gratiteid - 2 freq graddad - 1 freq grey-heidit - 1 freq graduatit - 1 freq gratiteed - 1 freq guerded - 1 freq grated - 1 freq graduating - 1 freq gordaidh - 3 freq gerrydotp - 1 freq geordiedentist - 1 freq |
MetaPhone code - KRTTL gratetul - 1 freq |
GRATETUL |
| Time to execute Levenshtein function - 0.236030 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.423315 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.028029 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.037561 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.000854 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. |