| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orive (0) - 1 freq trive (1) - 1 freq olive (1) - 16 freq rive (1) - 18 freq drive (1) - 170 freq bride (2) - 56 freq ride (2) - 69 freq grie (2) - 6 freq rite (2) - 56 freq rivet (2) - 3 freq greve (2) - 2 freq crime (2) - 70 freq pride (2) - 168 freq orare (2) - 2 freq crie (2) - 7 freq foriver (2) - 30 freq bribe (2) - 3 freq dhrive (2) - 4 freq give (2) - 166 freq rine (2) - 1 freq skive (2) - 5 freq opine (2) - 1 freq arite (2) - 7 freq ryve (2) - 2 freq crine (2) - 2 freq |
orive (0) - 1 freq rive (1) - 18 freq rave (2) - 10 freq ryve (2) - 2 freq rve (2) - 1 freq rove (2) - 2 freq reive (2) - 5 freq riv (2) - 5 freq rieve (2) - 1 freq olive (2) - 16 freq drive (2) - 170 freq trive (2) - 1 freq rev (3) - 23 freq crave (3) - 13 freq trove (3) - 3 freq ervo (3) - 2 freq gaive (3) - 1 freq river (3) - 270 freq wive (3) - 1 freq saive (3) - 1 freq ilive (3) - 1 freq prove (3) - 66 freq pruve (3) - 8 freq derive (3) - 2 freq privy (3) - 32 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 |
ORIVE |
| Time to execute Levenshtein function - 0.184170 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.362213 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.027759 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.038612 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.001131 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. |