| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oot-an-oot (0) - 3 freq oot-and-oot (1) - 1 freq oot-aboot (2) - 1 freq doon-an-oots (3) - 1 freq ootnaboot (3) - 1 freq out-and-out (3) - 1 freq poot-poot (4) - 2 freq fit-an-moo (4) - 1 freq comin-oot (4) - 1 freq so-an-so (4) - 1 freq dot-tae-dot (4) - 2 freq cockin-oot (4) - 1 freq draan-oot (4) - 2 freq settin-oot (4) - 1 freq on-an-on (4) - 1 freq staun-oot (4) - 2 freq standoot (4) - 1 freq turn-oot (4) - 5 freq worn-oot (4) - 2 freq ins-an-oots (4) - 5 freq snoot-cloot (5) - 1 freq far-oot (5) - 1 freq lothianloop (5) - 13 freq oot-come (5) - 1 freq ootlat (5) - 6 freq |
oot-an-oot (0) - 3 freq oot-and-oot (2) - 1 freq oot-aboot (4) - 1 freq out-and-out (4) - 1 freq turn-oot (5) - 5 freq ootnaboot (5) - 1 freq settin-oot (6) - 1 freq on-an-on (6) - 1 freq staun-oot (6) - 2 freq worn-oot (6) - 2 freq draan-oot (6) - 2 freq doon-an-oots (6) - 1 freq comin-oot (6) - 1 freq fit-an-moo (6) - 1 freq so-an-so (6) - 1 freq gaen-oot (7) - 1 freq turnoot (7) - 3 freq deein-oot (7) - 1 freq turn-oots (7) - 1 freq turnt-oot (7) - 1 freq daen-oot (7) - 1 freq ootamon't (7) - 1 freq aye-an-oan (7) - 2 freq airtin-oot (7) - 1 freq time-oot (7) - 2 freq |
SoundEx code - O353 otamatic - 1 freq oot-an-oot - 3 freq oot-wintered - 1 freq oot-and-oot - 1 freq owthenticitie - 2 freq owthenticallie - 1 freq out-and-out - 1 freq |
MetaPhone code - OTNT oot-an-oot - 3 freq |
OOT-AN-OOT |
| Time to execute Levenshtein function - 0.205956 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.386995 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.028299 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.037216 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.000969 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. |