Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
orf (0) - 20 freq oru (1) - 1 freq or (1) - 9206 freq org (1) - 26 freq oro (1) - 1 freq ort (1) - 2 freq ora (1) - 1 freq oaf (1) - 51 freq obf (1) - 1 freq oof (1) - 6 freq ork (1) - 2 freq hrf (1) - 1 freq oqf (1) - 1 freq owf (1) - 1 freq erf (1) - 2 freq orr (1) - 16 freq ouf (1) - 1 freq orb (1) - 2 freq off (1) - 542 freq drf (1) - 1 freq orh (1) - 1 freq odf (1) - 1 freq of (1) - 4012 freq ore (1) - 1 freq jrr (2) - 1 freq |
orf (0) - 20 freq erf (1) - 2 freq odf (2) - 1 freq of (2) - 4012 freq orh (2) - 1 freq off (2) - 542 freq orb (2) - 2 freq ore (2) - 1 freq rof (2) - 3 freq eerf (2) - 1 freq ref (2) - 36 freq arfu (2) - 1 freq rfo (2) - 1 freq ouf (2) - 1 freq roof (2) - 104 freq raf (2) - 7 freq drf (2) - 1 freq or (2) - 9206 freq orr (2) - 16 freq oaf (2) - 51 freq ora (2) - 1 freq ort (2) - 2 freq org (2) - 26 freq oro (2) - 1 freq obf (2) - 1 freq |
SoundEx code - O610 owerby - 9 freq owerbye - 3 freq orpah - 2 freq owerview - 10 freq ower-ripe - 1 freq orb - 2 freq owreby - 2 freq oorbye - 1 freq orive - 1 freq owre-by - 1 freq orf - 20 freq €˜owerby - 1 freq |
MetaPhone code - ORF orive - 1 freq orf - 20 freq |
ORF |
Time to execute Levenshtein function - 0.183429 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.308945 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.027245 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.036422 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.004115 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. |