| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irrevocable (0) - 2 freq irreducible (3) - 2 freq raesonable (4) - 1 freq impeccable (4) - 6 freq irritable (4) - 2 freq irreconcilable (4) - 1 freq inexorable (4) - 1 freq vocable (4) - 1 freq inevitable (4) - 29 freq irrelevance (5) - 5 freq reputable (5) - 3 freq agreeable (5) - 3 freq reperable (5) - 1 freq vocables (5) - 1 freq prestable (5) - 2 freq immoveable (5) - 1 freq relocate (5) - 2 freq reliable (5) - 5 freq unreliable (5) - 2 freq unreachable (5) - 2 freq improbable (5) - 2 freq greeable (5) - 4 freq rewable (5) - 1 freq disreputable (5) - 1 freq reasonable (5) - 21 freq |
irrevocable (0) - 2 freq irreducible (4) - 2 freq vocable (6) - 1 freq irritable (6) - 2 freq irreconcilable (7) - 1 freq inevitable (7) - 29 freq impeccable (7) - 6 freq raesonable (7) - 1 freq implacable (8) - 1 freq resounable (8) - 1 freq raisonable (8) - 1 freq irreverence (8) - 1 freq foreseeable (8) - 4 freq unrenewable (8) - 2 freq irresistible (8) - 2 freq unreasonable (8) - 2 freq paecable (8) - 1 freq unevytable (8) - 2 freq traceable (8) - 1 freq arrival (8) - 24 freq erratically (8) - 1 freq probable (8) - 4 freq rrvob (8) - 1 freq unreadable (8) - 2 freq preferable (8) - 3 freq |
SoundEx code - I612 irrevocable - 2 freq irrubukum - 6 freq |
MetaPhone code - IRFKBL irrevocable - 2 freq |
IRREVOCABLE |
| Time to execute Levenshtein function - 0.239294 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.398489 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.027572 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.038602 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.000936 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. |