| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gratefu (0) - 28 freq gracefu (1) - 5 freq grateful (1) - 33 freq gratefu' (1) - 1 freq grateffu (1) - 1 freq gratfu' (2) - 1 freq ungratefu (2) - 6 freq grate (2) - 18 freq graceful (2) - 10 freq grates (2) - 5 freq gratet (2) - 1 freq grate's (2) - 1 freq gratefil (2) - 1 freq gratefull (2) - 2 freq gracefu' (2) - 1 freq gratefoo (2) - 4 freq gratetul (2) - 1 freq grytfu (2) - 1 freq platefu (2) - 4 freq hatefu (2) - 5 freq greatfu (2) - 1 freq grycefu (2) - 1 freq grated (2) - 1 freq fatefu (2) - 5 freq reefu (3) - 1 freq |
gratefu (0) - 28 freq greatfu (2) - 1 freq grytfu (2) - 1 freq gratefoo (2) - 4 freq grateffu (2) - 1 freq gratefu' (2) - 1 freq gracefu (2) - 5 freq grateful (2) - 33 freq grycefu (3) - 1 freq grated (3) - 1 freq gratefil (3) - 1 freq gratet (3) - 1 freq grates (3) - 5 freq gratfu' (3) - 1 freq grate (3) - 18 freq ungratefu (3) - 6 freq grats (4) - 1 freq graeter (4) - 1 freq greff (4) - 6 freq grefe (4) - 2 freq graif (4) - 3 freq gratna (4) - 1 freq grat (4) - 59 freq gyrated (4) - 1 freq gettafu (4) - 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 - KRTF creative - 102 freq gratfu' - 1 freq gratefu - 28 freq gratefoo - 4 freq gratefu' - 1 freq creative' - 1 freq 'creative - 4 freq cardiff - 1 freq grateffu - 1 freq grytfu - 1 freq greatfu - 1 freq greattv - 1 freq |
GRATEFU |
| Time to execute Levenshtein function - 0.188720 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.334858 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.027967 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.038032 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.000872 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. |