| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| greastest (0) - 1 freq greasiest (1) - 1 freq greatest (1) - 42 freq gretest (2) - 2 freq grettest (2) - 1 freq fastest (3) - 14 freq gritest (3) - 1 freq creates (3) - 9 freq greenest (3) - 2 freq greatness (3) - 2 freq bestest (3) - 5 freq aeasiest (3) - 1 freq reassess (3) - 1 freq gratet (3) - 1 freq gestert (3) - 2 freq orestes (3) - 2 freq greast (3) - 1 freq treatet (3) - 3 freq grandest (3) - 4 freq gresses (3) - 7 freq greased (3) - 3 freq easiest (3) - 17 freq grasses (3) - 8 freq creamiest (3) - 1 freq grease (3) - 12 freq |
greastest (0) - 1 freq greatest (2) - 42 freq greasiest (2) - 1 freq grettest (3) - 1 freq gretest (3) - 2 freq grytest (4) - 4 freq gritest (4) - 1 freq grasses (5) - 8 freq grosset (5) - 2 freq grandest (5) - 4 freq gresses (5) - 7 freq breasts (5) - 2 freq greast (5) - 1 freq greats (5) - 4 freq grates (5) - 5 freq trustiest (5) - 1 freq orestes (5) - 2 freq bestest (5) - 5 freq greenest (5) - 2 freq fastest (5) - 14 freq gestert (5) - 2 freq gratet (5) - 1 freq gytest (6) - 1 freq grats (6) - 1 freq grantt (6) - 1 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 - KRSTST greastest - 1 freq |
GREASTEST |
| Time to execute Levenshtein function - 0.237780 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.441640 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.045697 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.044106 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.002286 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. |