| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ormi (0) - 3 freq ormo (1) - 2 freq orti (1) - 1 freq mi (2) - 246 freq o'm (2) - 12 freq ªrsi (2) - 1 freq ogmd (2) - 1 freq jimi (2) - 1 freq erm (2) - 70 freq orra (2) - 172 freq rm (2) - 11 freq ari (2) - 3 freq lrmy (2) - 1 freq ermy (2) - 2 freq femi (2) - 1 freq sorti (2) - 2 freq fourmi (2) - 1 freq orr (2) - 16 freq prma (2) - 1 freq forms (2) - 113 freq orams (2) - 1 freq fami (2) - 1 freq dmi (2) - 1 freq ore (2) - 1 freq oma (2) - 81 freq |
ormi (0) - 3 freq ormo (1) - 2 freq rm (2) - 11 freq rumi (2) - 3 freq army (2) - 82 freq rmu (2) - 1 freq erm (2) - 70 freq ermy (2) - 2 freq arm (2) - 52 freq ermie (2) - 1 freq orti (2) - 1 freq normo (3) - 1 freq rbi (3) - 1 freq krmu (3) - 1 freq org (3) - 26 freq norma (3) - 2 freq orta (3) - 1 freq erms (3) - 48 freq rmv (3) - 1 freq orrie (3) - 3 freq airmie (3) - 15 freq oam (3) - 2 freq ram (3) - 33 freq uri (3) - 7 freq aroma (3) - 7 freq |
SoundEx code - O650 ower-run - 2 freq owreum - 1 freq orion - 4 freq orain - 1 freq owerrun - 1 freq owermah - 1 freq ormo - 2 freq orun - 1 freq ormi - 3 freq oriam - 1 freq |
MetaPhone code - ORM owreum - 1 freq ormo - 2 freq ormi - 3 freq oriam - 1 freq |
ORMI |
| Time to execute Levenshtein function - 0.375439 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.629846 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.074880 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.038596 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.000824 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. |