| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| related (0) - 31 freq relayed (1) - 1 freq relatet (1) - 2 freq relates (1) - 4 freq belated (1) - 6 freq relate (1) - 18 freq elated (1) - 3 freq relaxed (1) - 29 freq reeted (2) - 4 freq slated (2) - 1 freq released (2) - 31 freq renamed (2) - 5 freq relegated (2) - 6 freq pelted (2) - 5 freq plated (2) - 3 freq deleted (2) - 4 freq redacted (2) - 3 freq relented (2) - 4 freq replaced (2) - 52 freq unrelated (2) - 2 freq debated (2) - 3 freq heated (2) - 11 freq reamed (2) - 1 freq delayed (2) - 4 freq reacted (2) - 4 freq |
related (0) - 31 freq relate (2) - 18 freq elated (2) - 3 freq belated (2) - 6 freq relaxed (2) - 29 freq relates (2) - 4 freq relayed (2) - 1 freq relatet (2) - 2 freq belted (3) - 15 freq dilated (3) - 1 freq relatit (3) - 34 freq relatin (3) - 9 freq beleted (3) - 1 freq rated (3) - 3 freq reled (3) - 1 freq rented (3) - 5 freq reisted (3) - 1 freq elted (3) - 1 freq rested (3) - 12 freq melted (3) - 10 freq recited (3) - 2 freq refuted (3) - 1 freq relaided (3) - 1 freq repeated (3) - 32 freq relocated (3) - 1 freq |
SoundEx code - R433 realhty--the - 1 freq relatit - 34 freq related - 31 freq relatet - 2 freq relaided - 1 freq |
MetaPhone code - RLTT relatit - 34 freq related - 31 freq relatet - 2 freq relaided - 1 freq |
RELATED |
| Time to execute Levenshtein function - 0.252671 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.668438 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.029244 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.089964 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.000900 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. |