| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relieved (0) - 38 freq believed (1) - 48 freq relieves (1) - 2 freq relieve (1) - 2 freq rileeved (2) - 1 freq recleeved (2) - 1 freq elieven (2) - 3 freq baelieved (2) - 1 freq relied (2) - 4 freq believer (2) - 4 freq beleved (2) - 2 freq revived (2) - 6 freq believet (2) - 1 freq believes (2) - 17 freq retrieved (2) - 3 freq reeved (2) - 2 freq relievin (2) - 3 freq relievt (2) - 1 freq believe (2) - 596 freq reviewed (2) - 7 freq relievit (2) - 1 freq relive (2) - 1 freq re-lived (2) - 1 freq reived (2) - 5 freq serieve (3) - 3 freq |
relieved (0) - 38 freq believed (2) - 48 freq relieve (2) - 2 freq rileeved (2) - 1 freq relieves (2) - 2 freq relievin (3) - 3 freq reeved (3) - 2 freq relievt (3) - 1 freq relievit (3) - 1 freq re-lived (3) - 1 freq reived (3) - 5 freq beleved (3) - 2 freq relied (3) - 4 freq relive (3) - 1 freq revived (3) - 6 freq baelieved (3) - 1 freq recleeved (3) - 1 freq renoved (4) - 1 freq realized (4) - 15 freq realeesed (4) - 1 freq remuived (4) - 5 freq releeased (4) - 1 freq reeled (4) - 6 freq resaived (4) - 2 freq leeved (4) - 55 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 |
RELIEVED |
| Time to execute Levenshtein function - 0.193710 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.361097 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.028471 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.037409 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.000809 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. |