| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| graveyard (0) - 9 freq graveyards (1) - 3 freq graveyaird (1) - 24 freq grave-yird (2) - 1 freq grave-yaird (2) - 2 freq graveyairds (2) - 4 freq graifyaird (3) - 1 freq gravelled (3) - 1 freq gravelbed (3) - 1 freq kaleyard (3) - 1 freq graved (3) - 1 freq gravesend (3) - 1 freq graver (3) - 1 freq gracelan (4) - 4 freq gravel (4) - 6 freq surveyar (4) - 1 freq regard (4) - 16 freq orkneyrd (4) - 5 freq graced (4) - 4 freq grammars (4) - 4 freq grated (4) - 1 freq grazer (4) - 1 freq gracemaryk (4) - 1 freq traversed (4) - 2 freq rayshard (4) - 1 freq |
graveyard (0) - 9 freq graveyaird (1) - 24 freq graveyards (2) - 3 freq grave-yaird (3) - 2 freq graveyairds (3) - 4 freq grave-yird (3) - 1 freq graved (4) - 1 freq graifyaird (4) - 1 freq graver (4) - 1 freq gruinard (5) - 2 freq graived (5) - 1 freq graveside (5) - 1 freq garnard (5) - 1 freq greenyaird (5) - 1 freq gerard (5) - 2 freq gravesend (5) - 1 freq gravelbed (5) - 1 freq gravelled (5) - 1 freq greybeard (5) - 2 freq graddad (6) - 1 freq greyer (6) - 1 freq graned (6) - 2 freq graart (6) - 1 freq bravery (6) - 6 freq graven (6) - 1 freq |
SoundEx code - G616 graveyaird - 24 freq graveyards - 3 freq grey-bearded - 1 freq graveyard - 9 freq graveyairds - 4 freq graverobbers - 2 freq graverobbin - 1 freq graver - 1 freq greybeard - 2 freq greyfriars - 2 freq grave-yaird - 2 freq grayfriars - 2 freq grave-robbers - 1 freq grave-yird - 1 freq graifyaird - 1 freq graff-yaird - 2 freq gorvrenment - 1 freq gerrybraiden - 1 freq gorebrig - 1 freq |
MetaPhone code - KRFYRT graveyaird - 24 freq graveyard - 9 freq grave-yaird - 2 freq grave-yird - 1 freq graifyaird - 1 freq graff-yaird - 2 freq |
GRAVEYARD graveyaird - 24 freq graveyard - 9 freq graveyards - 3 freq grave-yird - 1 freq grave-yaird - 2 freq graff-yaird - 2 freq graveyairds - 4 freq graifyaird - 1 freq |
| Time to execute Levenshtein function - 0.269403 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.430989 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.029434 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.038909 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.000978 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. |