| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| graveyairds (0) - 4 freq graveyaird (1) - 24 freq graveyards (1) - 3 freq grave-birds (2) - 1 freq grave-yaird (2) - 2 freq graveyard (2) - 9 freq graifyaird (3) - 1 freq grave-yird (3) - 1 freq granbairns (4) - 11 freq graff-yaird (4) - 2 freq rewairds (4) - 1 freq greenyaird (4) - 1 freq kailyairds (4) - 1 freq orkneywirds (4) - 3 freq grandbairns (4) - 3 freq rawyards (4) - 1 freq regairds (4) - 15 freq bravehairt (4) - 1 freq vineyairds (4) - 2 freq graveside (4) - 1 freq ravelings (5) - 1 freq gravestones (5) - 6 freq travlirs (5) - 1 freq graveslabs (5) - 1 freq remairks (5) - 3 freq |
graveyairds (0) - 4 freq graveyards (1) - 3 freq graveyaird (2) - 24 freq graveyard (3) - 9 freq grave-birds (4) - 1 freq grave-yaird (4) - 2 freq grave-yird (5) - 1 freq graifyaird (5) - 1 freq rawyards (6) - 1 freq graveside (6) - 1 freq regairds (6) - 15 freq rewairds (6) - 1 freq greenyaird (6) - 1 freq coortyairds (7) - 1 freq regards (7) - 11 freq travers (7) - 4 freq gabbards (7) - 1 freq draver's (7) - 1 freq graved (7) - 1 freq graver (7) - 1 freq gairds (7) - 16 freq retards (7) - 1 freq gravitas (7) - 2 freq graves (7) - 31 freq gravits (7) - 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 - KRFYRTS graveyards - 3 freq graveyairds - 4 freq |
GRAVEYAIRDS 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.237429 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.414504 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.027394 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.040359 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.000897 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. |