| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| robust (0) - 10 freq roust (1) - 5 freq foust (2) - 1 freq combust (2) - 4 freq poust (2) - 10 freq noust (2) - 2 freq rouse (2) - 14 freq bust (2) - 8 freq rambust (2) - 1 freq rust (2) - 13 freq roost (2) - 41 freq rowst (2) - 20 freq locust (2) - 2 freq robot (2) - 6 freq obusy (2) - 1 freq rob's (2) - 1 freq robit (2) - 1 freq robes (2) - 7 freq rousty (2) - 1 freq roush (2) - 1 freq roast (2) - 38 freq robbit (2) - 2 freq robert (2) - 237 freq rout (2) - 2 freq rousit (2) - 6 freq |
robust (0) - 10 freq roust (2) - 5 freq roast (3) - 38 freq rousty (3) - 1 freq robbit (3) - 2 freq robit (3) - 1 freq robes (3) - 7 freq rost (3) - 4 freq arabest (3) - 3 freq robt (3) - 1 freq robot (3) - 6 freq robert (3) - 237 freq rousit (3) - 6 freq rambust (3) - 1 freq bust (3) - 8 freq roost (3) - 41 freq rust (3) - 13 freq rowst (3) - 20 freq busty (4) - 1 freq racist (4) - 25 freq rbs (4) - 1 freq robson (4) - 14 freq ribs (4) - 33 freq i'best (4) - 7 freq ruist (4) - 1 freq |
SoundEx code - R123 repositorie - 1 freq refused - 40 freq repost - 1 freq robust - 10 freq ravaged - 2 freq refusit - 6 freq revokit - 1 freq rhapsody - 1 freq refuised - 1 freq reveesitin - 1 freq repast - 1 freq rebukit - 3 freq reveesit - 1 freq rebiggit - 2 freq revisitit - 1 freq refected - 1 freq reveisitit - 1 freq reveisit - 1 freq refaised - 1 freq ripest - 1 freq re-biggit - 2 freq refectory - 1 freq revised - 2 freq re-passed - 1 freq reposeetion - 1 freq revisit - 3 freq revsitied - 1 freq revstu - 1 freq rfjtdh - 1 freq refyoozed - 1 freq raiphsadventcalandur - 1 freq rpxjzttv - 2 freq |
MetaPhone code - RBST robust - 10 freq |
ROBUST |
| Time to execute Levenshtein function - 0.406607 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.629601 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.028960 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.068722 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.000900 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. |