| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| realities (0) - 9 freq realitie (1) - 2 freq legalities (2) - 1 freq qualities (2) - 9 freq realises (2) - 9 freq geocities (3) - 12 freq vanities (3) - 1 freq abilities (3) - 6 freq beauties (3) - 9 freq banalities (3) - 1 freq recipies (3) - 1 freq fearties (3) - 4 freq entities (3) - 15 freq reality (3) - 115 freq relishes (3) - 1 freq penalties (3) - 11 freq relies (3) - 1 freq ceities (3) - 8 freq ralphies (3) - 1 freq revsitied (3) - 1 freq qualitie (3) - 12 freq lealtie (3) - 9 freq versities (3) - 4 freq realised (3) - 167 freq ralatives (3) - 1 freq |
realities (0) - 9 freq realitie (2) - 2 freq royalties (3) - 2 freq relates (3) - 4 freq realises (3) - 9 freq qualities (3) - 9 freq ratties (4) - 2 freq rallies (4) - 7 freq raelitie (4) - 2 freq reliques (4) - 1 freq relatives (4) - 17 freq leilties (4) - 1 freq elites (4) - 5 freq relies (4) - 1 freq abeilities (4) - 2 freq ralatives (4) - 1 freq felties (4) - 1 freq abilities (4) - 6 freq roasties (4) - 1 freq retaliates (4) - 2 freq legalities (4) - 1 freq rareities (4) - 1 freq reality-e (4) - 1 freq realise (4) - 119 freq reality (4) - 115 freq |
SoundEx code - R432 realities - 9 freq royalty's - 1 freq royalties - 2 freq relates - 4 freq |
MetaPhone code - RLTS realities - 9 freq relates - 4 freq |
REALITIES |
| Time to execute Levenshtein function - 0.195553 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.366881 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.027949 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.037700 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.001049 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. |