Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
epilogue (0) - 2 freq pirogue (2) - 1 freq dialogue (3) - 41 freq epitome (3) - 7 freq prologue (3) - 4 freq plague (3) - 25 freq episode (3) - 29 freq collogue (3) - 62 freq brogue (4) - 6 freq dialogues (4) - 3 freq rogue (4) - 11 freq vilage (4) - 1 freq plagues (4) - 4 freq pilot (4) - 24 freq exile (4) - 20 freq exigus (4) - 1 freq piggie (4) - 13 freq episide (4) - 1 freq eimage (4) - 18 freq apologise (4) - 28 freq pilate (4) - 36 freq trilogy (4) - 2 freq eile (4) - 1 freq spiggte (4) - 1 freq airgue (4) - 3 freq |
epilogue (0) - 2 freq pirogue (3) - 1 freq plague (3) - 25 freq apology (4) - 17 freq prologue (4) - 4 freq dialogue (4) - 41 freq pillage (5) - 4 freq plou (5) - 12 freq ecology (5) - 3 freq plout (5) - 1 freq polonie (5) - 1 freq plagued (5) - 5 freq plous (5) - 3 freq pilgim (5) - 1 freq ploum (5) - 2 freq plaque (5) - 19 freq silage (5) - 19 freq eulogy (5) - 4 freq apologize (5) - 1 freq ploued (5) - 4 freq pile (5) - 113 freq bilge (5) - 1 freq ologie (5) - 1 freq pilau (5) - 2 freq pilie (5) - 1 freq |
SoundEx code - E142 evils - 4 freq eyeballs - 5 freq epples - 10 freq eeva-liisa - 1 freq epilogue - 2 freq effulgent - 1 freq |
MetaPhone code - EPLK epilogue - 2 freq |
EPILOGUE |
Time to execute Levenshtein function - 0.181493 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.353824 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.028318 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.038640 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.000929 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. |