Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ironically (0) - 10 freq frantically (3) - 10 freq cynically (3) - 2 freq logically (3) - 1 freq stoically (3) - 1 freq organically (3) - 3 freq clinically (3) - 3 freq ethnically (3) - 1 freq critically (3) - 1 freq tragically (3) - 2 freq manically (3) - 1 freq intrinsically (4) - 1 freq originally (4) - 26 freq tactically (4) - 2 freq ironic (4) - 22 freq phonetically (4) - 5 freq metrically (4) - 1 freq drastically (4) - 1 freq typically (4) - 7 freq chemically (4) - 1 freq rascally (4) - 1 freq socially (4) - 15 freq ivintually (4) - 2 freq phonecalls (4) - 1 freq diachronically (4) - 1 freq |
ironically (0) - 10 freq organically (4) - 3 freq manically (4) - 1 freq cynically (4) - 2 freq critically (5) - 1 freq rascally (5) - 1 freq ethnically (5) - 1 freq tragically (5) - 2 freq clinically (5) - 3 freq logically (5) - 1 freq frantically (5) - 10 freq stoically (5) - 1 freq initially (6) - 4 freq crucially (6) - 3 freq royally (6) - 2 freq principally (6) - 1 freq locally (6) - 16 freq erratically (6) - 1 freq phonecall (6) - 2 freq magically (6) - 5 freq nicoll (6) - 5 freq ethically (6) - 1 freq recall (6) - 10 freq randall (6) - 7 freq cooncill (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 - IRNKL ironically - 10 freq |
IRONICALLY |
Time to execute Levenshtein function - 0.204375 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.364708 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.027617 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.036867 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.000837 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. |