| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grahamwarke (0) - 1 freq grahamrorie (3) - 1 freq grahamgarden (3) - 1 freq gramarie (4) - 1 freq gramarye (4) - 1 freq grassmarket (4) - 4 freq grassmairket (5) - 1 freq grundwark (5) - 1 freq gramaire (5) - 1 freq grammar's (5) - 2 freq graham's (5) - 1 freq gracemaryk (5) - 1 freq hamewark (5) - 5 freq grahams (5) - 2 freq grammar (5) - 132 freq grammars (5) - 4 freq hamwlqke (5) - 2 freq grahammaloney (5) - 8 freq ramarks (5) - 1 freq orrawark (5) - 1 freq graimmar (5) - 1 freq framewark (5) - 10 freq grandfare (5) - 1 freq graham (5) - 38 freq grammarly (5) - 1 freq |
grahamwarke (0) - 1 freq grahamrorie (5) - 1 freq grahamgarden (6) - 1 freq grundwark (7) - 1 freq hamewark (7) - 5 freq gracemaryk (7) - 1 freq framewark (7) - 10 freq gramarie (7) - 1 freq gramarye (7) - 1 freq hamework (8) - 10 freq graham (8) - 38 freq hamewurk (8) - 1 freq grammarly (8) - 1 freq framewirk (8) - 3 freq hamewirk (8) - 2 freq framework (8) - 7 freq orrawark (8) - 1 freq framewaark (8) - 29 freq graimmar (8) - 1 freq grahams (8) - 2 freq gramaire (8) - 1 freq graham's (8) - 1 freq grammars (8) - 4 freq grammar (8) - 132 freq grahammaloney (8) - 8 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 - KRHMWRK grahamwarke - 1 freq |
GRAHAMWARKE |
| Time to execute Levenshtein function - 0.228643 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.393582 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.028069 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.038752 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.000864 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. |