| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| realhty--the (0) - 1 freq reality-e (4) - 1 freq rashes-the (5) - 1 freq reeds--the (5) - 1 freq babby-the (6) - 1 freq realtimvine (6) - 1 freq ready-het (6) - 1 freq realty (6) - 1 freq mealtith (6) - 1 freq real-life (6) - 1 freq echty-echt (6) - 1 freq wean-the (6) - 1 freq realitie (6) - 2 freq reality (6) - 115 freq alba-the (6) - 1 freq ready-made (6) - 3 freq teachin'the (6) - 1 freq eichty-three (6) - 1 freq eichty-nine (6) - 1 freq echty-five (6) - 1 freq echty-nine (6) - 1 freq rely-foe (6) - 1 freq reinstate (7) - 1 freq belt--i (7) - 1 freq realize (7) - 6 freq |
realhty--the (0) - 1 freq rashes-the (8) - 1 freq reeds--the (8) - 1 freq reality-e (8) - 1 freq alba-the (10) - 1 freq eichty-three (10) - 1 freq mealtith (10) - 1 freq rat-a-tat (10) - 7 freq relatit (11) - 34 freq richt-oot (11) - 3 freq eichteenth (11) - 3 freq righty-o (11) - 1 freq echteenth (11) - 7 freq least-at (11) - 3 freq relatet (11) - 2 freq belt-ish (11) - 1 freq meltith (11) - 5 freq babby-the (11) - 1 freq but-the (11) - 1 freq realty (11) - 1 freq lhttle (11) - 1 freq richt-like (11) - 2 freq realoztweets (11) - 2 freq eichty-fit (11) - 1 freq richt-side (11) - 1 freq |
SoundEx code - R433 realhty--the - 1 freq relatit - 34 freq related - 31 freq relatet - 2 freq relaided - 1 freq |
MetaPhone code - RLT0 realhty--the - 1 freq |
REALHTY--THE |
| Time to execute Levenshtein function - 0.253035 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.506484 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.037514 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.041088 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.000984 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. |