| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grey-bearded (0) - 1 freq greybeard (3) - 2 freq grey-armed (3) - 1 freq grey-bleached (3) - 1 freq grey-gorred (4) - 1 freq reappeared (5) - 1 freq re-added (5) - 1 freq grey-cowled (5) - 1 freq weel-earned (5) - 2 freq gley-eed (5) - 1 freq retreaded (5) - 1 freq grey-blue (5) - 3 freq gey-near (5) - 1 freq grey-gizzed (5) - 1 freq grey-derk (5) - 1 freq rewarded (5) - 2 freq grey-black (5) - 1 freq rehearsed (5) - 4 freq weel-leared (5) - 3 freq grey-heidit (5) - 1 freq regarded (5) - 5 freq bearded (5) - 8 freq embedded (6) - 4 freq green-faced (6) - 1 freq remembered (6) - 24 freq |
grey-bearded (0) - 1 freq grey-armed (5) - 1 freq greybeard (5) - 2 freq grey-gorred (6) - 1 freq grey-bleached (6) - 1 freq grey-black (8) - 1 freq grey-derk (8) - 1 freq grey-heidit (8) - 1 freq grey-gizzed (8) - 1 freq bearded (8) - 8 freq regarded (8) - 5 freq rewarded (8) - 2 freq grey-cowled (8) - 1 freq gerrybraiden (8) - 1 freq re-added (8) - 1 freq grey-blue (8) - 3 freq retreaded (8) - 1 freq hair-brained (9) - 1 freq boarded (9) - 5 freq broon-beard (9) - 1 freq raed-blooded (9) - 1 freq bare-arsed (9) - 1 freq guarded (9) - 2 freq guerded (9) - 1 freq grave-birds (9) - 1 freq |
SoundEx code - G616 graveyaird - 24 freq graveyards - 3 freq greyfriars - 3 freq grey-bearded - 1 freq graveyard - 9 freq graveyairds - 4 freq graverobbers - 2 freq graverobbin - 1 freq graver - 1 freq greybeard - 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 - KRBRTT grey-bearded - 1 freq |
GREY-BEARDED |
| Time to execute Levenshtein function - 0.278660 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.609591 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.032355 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.075061 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.000951 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. |