| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rileeved (0) - 1 freq bileeved (1) - 1 freq sleeved (2) - 3 freq rileev (2) - 1 freq reeved (2) - 2 freq recleeved (2) - 1 freq bileeve (2) - 4 freq gleeved (2) - 1 freq leeved (2) - 55 freq relieved (2) - 38 freq relented (3) - 4 freq fleeced (3) - 3 freq sieved (3) - 1 freq screeved (3) - 2 freq cleeked (3) - 11 freq reeted (3) - 4 freq relieve (3) - 2 freq riveted (3) - 1 freq deeved (3) - 6 freq riever (3) - 2 freq leived (3) - 11 freq tiltered (3) - 1 freq redeemed (3) - 5 freq rived (3) - 20 freq pleeped (3) - 2 freq |
rileeved (0) - 1 freq relieved (2) - 38 freq bileeved (2) - 1 freq leeved (3) - 55 freq recleeved (3) - 1 freq gleeved (3) - 1 freq rileev (3) - 1 freq reeved (3) - 2 freq sleeved (3) - 3 freq beleved (4) - 2 freq received (4) - 53 freq released (4) - 31 freq cleaved (4) - 2 freq relieves (4) - 2 freq riled (4) - 9 freq believed (4) - 49 freq rived (4) - 20 freq reeseeved (4) - 1 freq realeesed (4) - 1 freq reived (4) - 5 freq reeled (4) - 6 freq releeased (4) - 1 freq outleeved (4) - 1 freq relieve (4) - 2 freq leived (4) - 11 freq |
SoundEx code - R413 relieved - 38 freq relievt - 1 freq rileeved - 1 freq re-lived - 1 freq relievit - 1 freq releifit - 1 freq realpetebennett - 1 freq |
MetaPhone code - RLFT relieved - 38 freq relievt - 1 freq rileeved - 1 freq re-lived - 1 freq relievit - 1 freq releifit - 1 freq |
RILEEVED |
| Time to execute Levenshtein function - 0.228987 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.410675 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.028822 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.040217 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.000903 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. |