Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
chlorine (0) - 1 freq calorie (2) - 1 freq chorin (2) - 1 freq chorie (2) - 1 freq childline (3) - 1 freq colourins (3) - 1 freq whorne (3) - 2 freq coorie (3) - 29 freq chowie (3) - 2 freq colline (3) - 1 freq chatrie (3) - 1 freq glorie (3) - 32 freq cherie (3) - 2 freq chortle (3) - 1 freq chairiie (3) - 1 freq chories (3) - 1 freq clonin (3) - 2 freq caldrife (3) - 1 freq cologne (3) - 3 freq calories (3) - 11 freq choric (3) - 1 freq caroline (3) - 26 freq corinne (3) - 1 freq colouring (3) - 2 freq caloris (3) - 2 freq |
chlorine (0) - 1 freq chorin (3) - 1 freq chirrin (4) - 1 freq chagrin (4) - 1 freq chariene (4) - 5 freq chroin (4) - 1 freq cloorin (4) - 1 freq coleraine (4) - 4 freq colourin (4) - 3 freq choryin (4) - 3 freq clourin (4) - 1 freq cheerin (4) - 25 freq chorie (4) - 1 freq calorie (4) - 1 freq cautrine (5) - 3 freq lorina (5) - 3 freq clairin (5) - 1 freq children (5) - 50 freq choreyin (5) - 1 freq cowlraine (5) - 2 freq chorale (5) - 1 freq chloegee (5) - 1 freq chokin (5) - 29 freq hoorin (5) - 3 freq clarinet (5) - 3 freq |
SoundEx code - C465 clourin - 1 freq clarinet - 3 freq clearances - 12 freq clearin - 27 freq cowlraine - 2 freq coulrain' - 2 freq coulrain - 1 freq cailry-on's - 1 freq clarence - 2 freq clearance - 16 freq clearan - 2 freq cullourin - 1 freq clairance - 1 freq chlorine - 1 freq clarinda - 1 freq callerin - 1 freq clarence's - 1 freq clairin - 1 freq cloorin - 1 freq clearing - 3 freq clarion - 1 freq colourin - 3 freq clarendon - 1 freq colourins - 1 freq coleraine - 4 freq clewran - 1 freq chlorinated - 1 freq clairehanm - 1 freq colouring - 2 freq clear-minded - 1 freq colourin-in - 3 freq clairehammond - 1 freq |
MetaPhone code - XLRN chlorine - 1 freq |
CHLORINE |
Time to execute Levenshtein function - 0.892783 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 - 1.317059 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.094158 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.101536 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.000894 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. |