| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| related (0) - 28 freq elated (1) - 3 freq relayed (1) - 1 freq relates (1) - 4 freq relate (1) - 15 freq relaxed (1) - 28 freq relatet (1) - 2 freq belated (1) - 6 freq reamed (2) - 1 freq regaled (2) - 2 freq plated (2) - 3 freq recited (2) - 2 freq reeted (2) - 4 freq replayed (2) - 1 freq rented (2) - 4 freq rested (2) - 11 freq dilated (2) - 1 freq delayed (2) - 4 freq relaided (2) - 1 freq relatin (2) - 9 freq rated (2) - 3 freq berated (2) - 1 freq seated (2) - 11 freq sedated (2) - 1 freq pelted (2) - 5 freq |
related (0) - 28 freq relaxed (2) - 28 freq relatet (2) - 2 freq relate (2) - 15 freq belated (2) - 6 freq relates (2) - 4 freq elated (2) - 3 freq relayed (2) - 1 freq beleted (3) - 1 freq relatit (3) - 34 freq reled (3) - 1 freq reisted (3) - 1 freq refuted (3) - 1 freq elted (3) - 1 freq belted (3) - 14 freq released (3) - 31 freq repeated (3) - 32 freq relocated (3) - 1 freq slated (3) - 1 freq relented (3) - 4 freq melted (3) - 10 freq relied (3) - 4 freq reacted (3) - 4 freq relegated (3) - 6 freq deleted (3) - 5 freq |
SoundEx code - R433 realhty--the - 1 freq relatit - 34 freq related - 28 freq relatet - 2 freq relaided - 1 freq |
MetaPhone code - RLTT relatit - 34 freq related - 28 freq relatet - 2 freq relaided - 1 freq |
RELATED |
| Time to execute Levenshtein function - 0.182965 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.384608 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.026984 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.037289 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.000830 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. |