| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relieved (0) - 38 freq relieves (1) - 2 freq relieve (1) - 2 freq believed (1) - 49 freq believet (2) - 1 freq relievin (2) - 3 freq reived (2) - 5 freq believer (2) - 4 freq reeved (2) - 2 freq retrieved (2) - 3 freq believe (2) - 600 freq relied (2) - 4 freq relive (2) - 1 freq relievit (2) - 1 freq beleved (2) - 2 freq relievt (2) - 1 freq elieven (2) - 3 freq believes (2) - 18 freq rileeved (2) - 1 freq baelieved (2) - 1 freq reviewed (2) - 7 freq revived (2) - 6 freq recleeved (2) - 1 freq re-lived (2) - 1 freq elided (3) - 1 freq |
relieved (0) - 38 freq believed (2) - 49 freq rileeved (2) - 1 freq relieve (2) - 2 freq relieves (2) - 2 freq baelieved (3) - 1 freq relievit (3) - 1 freq relievt (3) - 1 freq revived (3) - 6 freq re-lived (3) - 1 freq recleeved (3) - 1 freq relive (3) - 1 freq beleved (3) - 2 freq reived (3) - 5 freq relied (3) - 4 freq reeved (3) - 2 freq relievin (3) - 3 freq remuived (4) - 5 freq gleeved (4) - 1 freq relaided (4) - 1 freq resaived (4) - 2 freq removed (4) - 17 freq leeved (4) - 55 freq relaxed (4) - 29 freq lived (4) - 150 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.226167 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.386974 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.027197 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.041191 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.000950 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. |