Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
richtly (0) - 48 freq lichtly (1) - 15 freq rightly (1) - 10 freq richly (1) - 4 freq brichtly (1) - 10 freq nichtly (1) - 4 freq tichtly (1) - 6 freq richtfu (2) - 15 freq ruchly (2) - 3 freq nightly (2) - 3 freq eichty (2) - 7 freq rickly (2) - 1 freq richtt (2) - 1 freq michtry (2) - 1 freq michtily (2) - 2 freq lichty (2) - 1 freq richtit (2) - 2 freq richter (2) - 3 freq aichty (2) - 6 freq slichtly (2) - 6 freq richtin (2) - 3 freq richtfa (2) - 3 freq lightly (2) - 6 freq richtlie (2) - 14 freq brightly (2) - 1 freq |
richtly (0) - 48 freq tichtly (2) - 6 freq lichtly (2) - 15 freq richtlie (2) - 14 freq nichtly (2) - 4 freq rightly (2) - 10 freq brichtly (2) - 10 freq richly (2) - 4 freq richtfa (3) - 3 freq richter (3) - 3 freq richtin (3) - 3 freq rochly (3) - 3 freq richtit (3) - 2 freq richts (3) - 195 freq richt' (3) - 1 freq richted (3) - 4 freq richt (3) - 4087 freq richtt (3) - 1 freq richtfu (3) - 15 freq michtily (3) - 2 freq ruchly (3) - 3 freq rachel (4) - 17 freq rycht (4) - 3 freq lichty (4) - 1 freq richtaway (4) - 1 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 - RXTL richtly - 48 freq richtlie' - 1 freq richtlie - 14 freq |
RICHTLY |
Time to execute Levenshtein function - 0.202799 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.340137 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.031018 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.036683 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.000859 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. |