| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| royalty (0) - 24 freq royally (1) - 2 freq loyalty (1) - 10 freq royal (2) - 174 freq royalty's (2) - 1 freq royales (2) - 1 freq royals (2) - 9 freq ronalt (2) - 32 freq roasty (2) - 2 freq realty (2) - 1 freq roosty (3) - 23 freq rousty (3) - 1 freq cobalt (3) - 1 freq realiy (3) - 1 freq rivalry (3) - 2 freq roly (3) - 8 freq toyal (3) - 1 freq boaty (3) - 7 freq royaal (3) - 1 freq rokelay (3) - 1 freq malty (3) - 6 freq totally (3) - 121 freq morally (3) - 3 freq fealty (3) - 4 freq rochly (3) - 3 freq |
royalty (0) - 24 freq realty (2) - 1 freq loyalty (2) - 10 freq royally (2) - 2 freq ryaltie (3) - 2 freq rolt (3) - 8 freq roasty (3) - 2 freq reality (3) - 115 freq ronalt (3) - 32 freq royal (3) - 174 freq royales (3) - 1 freq royals (3) - 9 freq ryall (4) - 1 freq rult (4) - 1 freq really (4) - 1231 freq orally (4) - 2 freq raelity (4) - 1 freq toalt (4) - 1 freq royle (4) - 1 freq ratty (4) - 6 freq salty (4) - 11 freq realy (4) - 2 freq morality (4) - 8 freq royalist (4) - 2 freq railt (4) - 1 freq |
SoundEx code - R430 rolled - 55 freq raelity - 1 freq reality - 115 freq ruled - 25 freq relate - 18 freq riled - 9 freq roll't - 1 freq rollt - 4 freq rallied - 6 freq reel'd - 2 freq railed - 2 freq rulit - 2 freq ruld - 1 freq rilit - 1 freq relait - 1 freq realty - 1 freq royalty - 24 freq reeled - 6 freq roulette - 3 freq relied - 4 freq rolt - 8 freq ruled' - 1 freq rowlt - 5 freq rult - 1 freq re-load - 1 freq reled - 1 freq relt - 1 freq roald - 8 freq roulled - 1 freq railt - 1 freq realitie - 2 freq reality-e - 1 freq relayed - 1 freq raelitie - 2 freq ruilled - 1 freq ryaltie - 2 freq rollit - 1 freq €œrolled - 1 freq |
MetaPhone code - RYLT royalty - 24 freq ryaltie - 2 freq |
ROYALTY |
| Time to execute Levenshtein function - 0.308024 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.624324 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.070568 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.091886 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.001176 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. |