| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relieve (0) - 2 freq believe (1) - 596 freq relive (1) - 1 freq relieved (1) - 38 freq relievt (1) - 1 freq relieves (1) - 2 freq belteve (2) - 1 freq rieve (2) - 1 freq relievin (2) - 3 freq bealieve (2) - 1 freq belive (2) - 2 freq relief (2) - 105 freq reive (2) - 5 freq beleeve (2) - 5 freq beleve (2) - 6 freq reeve (2) - 1 freq lieve (2) - 1 freq serieve (2) - 3 freq 'believe (2) - 3 freq baelieve (2) - 6 freq eelive (2) - 1 freq elieven (2) - 3 freq revive (2) - 7 freq relievit (2) - 1 freq relies (2) - 1 freq |
relieve (0) - 2 freq relive (1) - 1 freq relieves (2) - 2 freq relievt (2) - 1 freq relieved (2) - 38 freq believe (2) - 596 freq revive (3) - 7 freq eelive (3) - 1 freq baelieve (3) - 6 freq relievit (3) - 1 freq relietive (3) - 1 freq lieve (3) - 1 freq relied (3) - 4 freq rileev (3) - 1 freq relies (3) - 1 freq slieve (3) - 1 freq belive (3) - 2 freq relief (3) - 105 freq relievin (3) - 3 freq rieve (3) - 1 freq reeve (3) - 1 freq reive (3) - 5 freq bealieve (3) - 1 freq beleeve (3) - 5 freq beleve (3) - 6 freq |
SoundEx code - R410 relief - 105 freq rileev - 1 freq rolf - 1 freq rely-foe - 1 freq raellife - 1 freq roll-up - 4 freq relive - 1 freq real-life - 1 freq ralph - 5 freq relieve - 2 freq rlffa - 1 freq rrlfyw - 1 freq |
MetaPhone code - RLF relief - 105 freq rileev - 1 freq rolf - 1 freq rely-foe - 1 freq raellife - 1 freq relive - 1 freq raleigh - 2 freq ralph - 5 freq relieve - 2 freq rlffa - 1 freq rrlfyw - 1 freq |
RELIEVE |
| Time to execute Levenshtein function - 0.213074 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.395392 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.035067 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.040052 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.000851 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. |