| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| greatfu (0) - 1 freq dreadfu (2) - 7 freq great (2) - 1293 freq greater (2) - 20 freq grytfu (2) - 1 freq gratefu (2) - 28 freq greats (2) - 4 freq greatguy (2) - 1 freq greattv (2) - 1 freq gratfu' (2) - 1 freq greatly (2) - 10 freq fruitfu (3) - 5 freq hertfu (3) - 1 freq dreidfu (3) - 20 freq gret'r (3) - 1 freq 'greatly (3) - 1 freq wreaths (3) - 6 freq creates (3) - 9 freq weafu (3) - 1 freq groats (3) - 5 freq grated (3) - 1 freq treatie (3) - 2 freq treats (3) - 21 freq greff (3) - 6 freq preat (3) - 1 freq |
greatfu (0) - 1 freq gratefu (2) - 28 freq grytfu (2) - 1 freq gratfu' (3) - 1 freq greatly (3) - 10 freq greatguy (3) - 1 freq greats (3) - 4 freq great (3) - 1293 freq greater (3) - 20 freq gratis (4) - 3 freq gettafu (4) - 1 freq greetit (4) - 10 freq gret (4) - 148 freq graf (4) - 1 freq grats (4) - 1 freq grateffu (4) - 1 freq graif (4) - 3 freq greetie (4) - 2 freq greeted (4) - 28 freq gratefu' (4) - 1 freq greetan (4) - 10 freq grat (4) - 59 freq grett (4) - 34 freq grefe (4) - 2 freq grateful (4) - 33 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 |
GREATFU |
| Time to execute Levenshtein function - 0.202519 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.582324 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.028552 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.068388 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.000869 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. |