Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
royalties (0) - 2 freq loyalties (1) - 3 freq royalty's (2) - 1 freq royales (2) - 1 freq loyaltie (2) - 1 freq ryaltie (2) - 2 freq roasties (2) - 1 freq royals (3) - 9 freq rollies (3) - 1 freq realities (3) - 9 freq roadies (3) - 4 freq romanies (3) - 1 freq tomaties (3) - 1 freq rivalries (3) - 2 freq foalies (3) - 1 freq foaties (3) - 1 freq groaties (3) - 2 freq penalties (3) - 11 freq royalist (3) - 2 freq rotates (3) - 2 freq doylies (3) - 1 freq royalists (3) - 2 freq ratties (3) - 2 freq royalty (3) - 24 freq polaties (3) - 1 freq |
royalties (0) - 2 freq loyalties (2) - 3 freq roasties (3) - 1 freq realities (3) - 9 freq ryaltie (3) - 2 freq royalty's (3) - 1 freq royales (3) - 1 freq relates (4) - 4 freq royalists (4) - 2 freq royalty (4) - 24 freq ratties (4) - 2 freq rollies (4) - 1 freq loyaltie (4) - 1 freq royals (4) - 9 freq rotates (4) - 2 freq polaties (4) - 1 freq rallies (4) - 7 freq routes (5) - 11 freq cruelties (5) - 1 freq kilties (5) - 3 freq rates (5) - 18 freq frailties (5) - 1 freq realitie (5) - 2 freq realises (5) - 9 freq roles (5) - 12 freq |
SoundEx code - R432 realities - 9 freq royalty's - 1 freq royalties - 2 freq relates - 4 freq |
MetaPhone code - RYLTS royalty's - 1 freq royalties - 2 freq |
ROYALTIES |
Time to execute Levenshtein function - 0.260818 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.400736 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.029896 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.044524 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.001116 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. |