| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| restalrig (0) - 1 freq restaurit (2) - 1 freq restorin (3) - 3 freq hesilrig (3) - 1 freq restairt (3) - 2 freq restoring (3) - 1 freq retouring (4) - 1 freq stalkit (4) - 2 freq gesturin (4) - 18 freq retards (4) - 1 freq resultin (4) - 7 freq retail (4) - 7 freq staring (4) - 9 freq mestalla (4) - 2 freq stalking (4) - 2 freq rustlin (4) - 9 freq starrin (4) - 3 freq pesterin (4) - 2 freq retard (4) - 2 freq hostelrie (4) - 2 freq restarted (4) - 1 freq restit (4) - 18 freq estatis (4) - 1 freq resoart (4) - 1 freq restless (4) - 15 freq |
restalrig (0) - 1 freq restaurit (4) - 1 freq restairt (5) - 2 freq restoring (5) - 1 freq hesilrig (5) - 1 freq restorin (5) - 3 freq nostalgia (6) - 9 freq restore (6) - 9 freq resting (6) - 4 freq restores (6) - 1 freq rustlin (6) - 9 freq restrain (6) - 2 freq restless (6) - 15 freq wrestling (6) - 10 freq hostelrie (6) - 2 freq restored (6) - 11 freq restoret (6) - 1 freq pestering (7) - 1 freq staris (7) - 1 freq westlin (7) - 3 freq restan (7) - 4 freq restrick (7) - 1 freq reserrin (7) - 1 freq rentals (7) - 2 freq ostaig (7) - 2 freq |
SoundEx code - R234 restless - 15 freq rustl't - 1 freq rustlin - 9 freq rustle - 11 freq rightly - 10 freq rustlt - 1 freq recitals - 2 freq richtly - 48 freq rustled - 4 freq rest'll - 1 freq ruggedly - 2 freq richtlie' - 1 freq richtlie - 14 freq restlessness - 1 freq richt-like - 2 freq rustlan - 1 freq rustly - 1 freq reestled - 1 freq resattled - 1 freq re-sattled - 1 freq restalrig - 1 freq residual - 1 freq ragdolled - 1 freq ragdoll - 1 freq richt-weel - 1 freq reestle - 1 freq rosewoodlondon - 3 freq recital - 1 freq rhxdylultv - 1 freq |
MetaPhone code - RSTLRK restalrig - 1 freq |
RESTALRIG |
| Time to execute Levenshtein function - 0.221877 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.423375 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.030439 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.038999 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.000822 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. |