Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
realities (0) - 9 freq realitie (1) - 2 freq qualities (2) - 9 freq realises (2) - 6 freq legalities (2) - 1 freq recipies (3) - 1 freq realiset (3) - 1 freq roasties (3) - 1 freq relieves (3) - 1 freq fearties (3) - 3 freq vanities (3) - 1 freq entities (3) - 15 freq realistic (3) - 8 freq mealtimes (3) - 2 freq penalties (3) - 11 freq ralphies (3) - 1 freq reality (3) - 110 freq relatives (3) - 16 freq realised (3) - 160 freq beasties (3) - 45 freq relates (3) - 4 freq reality-e (3) - 1 freq realized (3) - 15 freq retaliates (3) - 2 freq lealtie (3) - 8 freq |
realities (0) - 9 freq realitie (2) - 2 freq relates (3) - 4 freq royalties (3) - 2 freq qualities (3) - 9 freq realises (3) - 6 freq reality-e (4) - 1 freq elites (4) - 4 freq relatives (4) - 16 freq relies (4) - 1 freq retaliates (4) - 2 freq raelitie (4) - 2 freq abilities (4) - 5 freq reality (4) - 110 freq ralatives (4) - 1 freq realise (4) - 104 freq roasties (4) - 1 freq relieves (4) - 1 freq ryaltie (4) - 2 freq rareities (4) - 1 freq legalities (4) - 1 freq ratties (4) - 2 freq reliques (4) - 1 freq felties (4) - 1 freq abeilities (4) - 2 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.418709 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.824255 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.050944 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.083631 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.001077 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. |