| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootins (0) - 2 freq outins (1) - 1 freq ootin' (1) - 1 freq ootin (1) - 5 freq ootlins (1) - 3 freq ootlines (2) - 6 freq joins (2) - 11 freq robins (2) - 1 freq oftens (2) - 1 freq nothins (2) - 1 freq ooin (2) - 1 freq ookin (2) - 1 freq ottin (2) - 1 freq outlins (2) - 2 freq ootlinn (2) - 3 freq toting (2) - 1 freq optics (2) - 2 freq motifs (2) - 1 freq jottins (2) - 1 freq rootine (2) - 1 freq moomins (2) - 2 freq boomins (2) - 1 freq potions (2) - 11 freq notions (2) - 40 freq hootin (2) - 4 freq |
ootins (0) - 2 freq outins (1) - 1 freq tins (2) - 38 freq etins (2) - 5 freq ootlins (2) - 3 freq ootin' (2) - 1 freq ootin (2) - 5 freq eatons (3) - 2 freq goins (3) - 2 freq notions (3) - 40 freq loins (3) - 3 freq lotions (3) - 1 freq tans (3) - 5 freq ootgies (3) - 1 freq ations (3) - 1 freq outin (3) - 4 freq outing (3) - 2 freq tinsy (3) - 1 freq tens (3) - 13 freq potions (3) - 11 freq oots (3) - 23 freq tines (3) - 7 freq toonies (3) - 1 freq satins (3) - 1 freq oftens (3) - 1 freq |
SoundEx code - O352 othings - 1 freq outins - 1 freq ootmaist - 14 freq odin's - 2 freq owdience - 10 freq ootmest - 1 freq outing - 2 freq outainsells - 1 freq ootins - 2 freq otinnies - 1 freq odinsbudgie - 1 freq ohtmezpccx - 1 freq |
MetaPhone code - OTNS outins - 1 freq odin's - 2 freq owdience - 10 freq ootins - 2 freq otinnies - 1 freq |
OOTINS |
| Time to execute Levenshtein function - 0.369182 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.408433 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.027478 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.037962 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.000911 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. |