| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orion (0) - 4 freq onion (1) - 14 freq orgon (1) - 4 freq orton (1) - 1 freq froon (2) - 8 freq broon (2) - 500 freq tion (2) - 1 freq 'rin (2) - 2 freq ochon (2) - 1 freq gordon (2) - 123 freq croon (2) - 76 freq riot (2) - 31 freq oriam (2) - 1 freq rior (2) - 1 freq inion (2) - 1 freq origo (2) - 1 freq orient (2) - 1 freq groon (2) - 7 freq o'don (2) - 4 freq brio (2) - 1 freq union (2) - 192 freq origin (2) - 24 freq oreos (2) - 1 freq aroon (2) - 576 freq prison (2) - 27 freq |
orion (0) - 4 freq onion (2) - 14 freq rin (2) - 453 freq erin (2) - 9 freq iron (2) - 107 freq roon (2) - 1633 freq aroon (2) - 576 freq orain (2) - 1 freq orton (2) - 1 freq orgon (2) - 4 freq aroion (2) - 1 freq ron (2) - 14 freq orun (2) - 1 freq grien (3) - 3 freq odeon (3) - 4 freq ooin (3) - 1 freq ixion (3) - 1 freq rinn (3) - 1 freq oro (3) - 1 freq borin (3) - 46 freq frien (3) - 61 freq aaron (3) - 5 freq eryin (3) - 3 freq sion (3) - 1 freq bron (3) - 1 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 - ORN orion - 4 freq orain - 1 freq orun - 1 freq |
ORION |
| Time to execute Levenshtein function - 0.200035 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.547987 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.027861 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.071151 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.000927 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. |