Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ironstone (0) - 2 freq airnstane (3) - 1 freq drystone (3) - 1 freq longstone (3) - 1 freq monotone (3) - 1 freq brimstone (3) - 1 freq johnstone (3) - 35 freq ringtone (3) - 1 freq grunstane (3) - 19 freq branson (4) - 25 freq sandstone (4) - 6 freq transpose (4) - 1 freq pronoonce (4) - 11 freq johnston' (4) - 1 freq respone (4) - 1 freq roastin (4) - 21 freq robson (4) - 14 freq frontline (4) - 2 freq brigstones (4) - 1 freq frostie (4) - 1 freq johnston (4) - 18 freq bronte (4) - 1 freq gemstone (4) - 1 freq moonshine (4) - 1 freq houston (4) - 11 freq |
ironstone (0) - 2 freq airnstane (3) - 1 freq ringtone (4) - 1 freq arniston (4) - 2 freq grunstane (4) - 19 freq beanston (5) - 1 freq roostin (5) - 5 freq roustin (5) - 1 freq ormiston (5) - 1 freq rostin (5) - 2 freq dunstane (5) - 1 freq rowstin (5) - 4 freq saunstane (5) - 1 freq sanstane (5) - 1 freq roastin (5) - 21 freq brimstone (5) - 1 freq monotone (5) - 1 freq longstone (5) - 1 freq drystone (5) - 1 freq winston (5) - 3 freq johnstone (5) - 35 freq renton (5) - 4 freq funstane (5) - 1 freq roostan (5) - 1 freq histone (6) - 1 freq |
SoundEx code - I652 irons - 3 freq ironic - 22 freq ironically - 10 freq iron-nickel - 1 freq irony's - 1 freq ironstone - 2 freq irangovuqe - 1 freq iromg - 2 freq |
MetaPhone code - IRNSTN ironstone - 2 freq |
IRONSTONE |
Time to execute Levenshtein function - 0.218834 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.387072 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.030738 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.036879 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.000803 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. |