| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grammarly (0) - 1 freq grammar's (2) - 2 freq grammarly's (2) - 1 freq grammars (2) - 4 freq grammar (2) - 132 freq glammery (3) - 1 freq granary (3) - 1 freq grammer (3) - 3 freq cramary (3) - 1 freq 'grammar' (3) - 1 freq gremmars (3) - 1 freq graimmar (3) - 1 freq gramarie (3) - 1 freq grammarless (3) - 1 freq crammassy (3) - 1 freq gramarye (3) - 1 freq gradwally (3) - 1 freq gradually (3) - 17 freq gremmar (3) - 52 freq hammarby (3) - 1 freq grampa (4) - 8 freq rascally (4) - 1 freq grummle (4) - 4 freq rammage (4) - 1 freq brammer (4) - 7 freq |
grammarly (0) - 1 freq grammar (3) - 132 freq grammars (3) - 4 freq graimmar (4) - 1 freq gremmar (4) - 52 freq grammer (4) - 3 freq gremmars (4) - 1 freq grammarly's (4) - 1 freq grammar's (4) - 2 freq grummel (5) - 1 freq grimmer (5) - 1 freq grammarless (5) - 1 freq gramarye (5) - 1 freq gramarie (5) - 1 freq glammery (5) - 1 freq 'grammar' (5) - 1 freq grummle (5) - 4 freq grumpily (6) - 1 freq gramaire (6) - 1 freq brammle (6) - 2 freq gracemaryk (6) - 1 freq crummly (6) - 4 freq rammle (6) - 3 freq grimly (6) - 13 freq primarily (6) - 2 freq |
SoundEx code - G656 grammar - 132 freq grammar's - 2 freq gramarie - 1 freq granary - 1 freq grannier - 1 freq gremmar - 52 freq greeneree - 1 freq garrynarea - 1 freq grimmer - 1 freq greener - 12 freq greenery - 7 freq grammer - 3 freq garnard - 1 freq gremmar-can - 1 freq grammarly - 1 freq grammarly's - 1 freq gruinard - 2 freq groanery - 1 freq grammar-checkin - 1 freq gramarye - 1 freq gramaire - 1 freq graimmar - 1 freq grammars - 4 freq grammarless - 1 freq greenyaird - 1 freq grainery - 1 freq gremmars - 1 freq grahamwarke - 1 freq girner - 1 freq grahamrorie - 1 freq groomer - 1 freq 'grammar' - 1 freq garymor - 1 freq graemeherriot - 2 freq greenerie - 1 freq |
MetaPhone code - KRMRL grammarly - 1 freq cromar'll - 1 freq |
GRAMMARLY |
| Time to execute Levenshtein function - 0.207396 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.364873 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.028864 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.043409 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.001081 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. |