| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| otral (0) - 1 freq oral (1) - 23 freq orral (1) - 6 freq teal (2) - 2 freq trak (2) - 3 freq xtra (2) - 5 freq cral (2) - 1 freq coral (2) - 5 freq trae (2) - 1 freq straa (2) - 9 freq stray (2) - 30 freq moral (2) - 88 freq offal (2) - 2 freq atal (2) - 2 freq stal (2) - 4 freq ora (2) - 1 freq total (2) - 98 freq strae (2) - 102 freq otel (2) - 1 freq natral (2) - 6 freq oora (2) - 1 freq stra (2) - 1 freq orrals (2) - 13 freq traal (2) - 1 freq strahl (2) - 1 freq |
otral (0) - 1 freq trail (2) - 64 freq trial (2) - 82 freq traal (2) - 1 freq ootrel (2) - 3 freq oral (2) - 23 freq orral (2) - 6 freq aural (3) - 1 freq traml (3) - 1 freq tra (3) - 1 freq tray (3) - 48 freq mural (3) - 1 freq trax (3) - 10 freq trap (3) - 62 freq taal (3) - 7 freq trawl (3) - 3 freq atray (3) - 2 freq teal (3) - 2 freq trad (3) - 12 freq tras (3) - 1 freq feral (3) - 6 freq viral (3) - 3 freq tal (3) - 6 freq trak (3) - 3 freq moral (3) - 88 freq |
SoundEx code - O364 ootrel - 3 freq otral - 1 freq ootrels - 18 freq out-harled - 1 freq |
MetaPhone code - OTRL ootrel - 3 freq otral - 1 freq |
OTRAL |
| Time to execute Levenshtein function - 0.429448 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.576127 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.027981 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.070363 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.000901 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. |