| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orbitan (0) - 2 freq orbitin (1) - 1 freq orbital (1) - 3 freq ritan (2) - 5 freq writan (2) - 27 freq orbit (2) - 10 freq bitan (2) - 1 freq orbits (2) - 1 freq orta (3) - 1 freq oreetin (3) - 1 freq ubtan (3) - 1 freq roilan (3) - 1 freq ospital (3) - 8 freq vreitin (3) - 1 freq drivan (3) - 9 freq vreiten (3) - 1 freq habitat (3) - 3 freq risan (3) - 7 freq sortan (3) - 1 freq grootan (3) - 1 freq arisan (3) - 1 freq brettan (3) - 1 freq puritan (3) - 2 freq arbitrar (3) - 1 freq driftan (3) - 5 freq |
orbitan (0) - 2 freq orbitin (1) - 1 freq orbital (2) - 3 freq bitan (3) - 1 freq orbit (3) - 10 freq orbits (3) - 1 freq ritan (3) - 5 freq obtain (4) - 2 freq rootan (4) - 1 freq rittan (4) - 2 freq ruitin (4) - 2 freq bitin (4) - 27 freq reiban (4) - 2 freq tibetan (4) - 40 freq rantan (4) - 1 freq arbiter (4) - 2 freq rottan (4) - 6 freq orton (4) - 1 freq ubtan (4) - 1 freq oreetin (4) - 1 freq writan (4) - 27 freq irtan (4) - 1 freq urban (4) - 42 freq arabian (4) - 1 freq restan (4) - 4 freq |
SoundEx code - O613 orbit - 10 freq orbitin - 1 freq orbital - 3 freq orbitan - 2 freq owrepeyed - 1 freq orbits - 1 freq orvieto - 1 freq owerhyped - 1 freq orbttimtoy - 1 freq oorpatts - 3 freq |
MetaPhone code - ORBTN orbitin - 1 freq orbitan - 2 freq |
ORBITAN |
| Time to execute Levenshtein function - 0.312088 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.409306 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.029601 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.038425 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.000877 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. |