| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oot nou (0) - 2 freq for nou (2) - 1 freq ootthrou (3) - 9 freq ootlinn (4) - 3 freq ootline (4) - 14 freq ootlined (4) - 7 freq ootlinin (4) - 2 freq ootlan (4) - 1 freq ootrin (4) - 1 freq ootlines (4) - 6 freq ootin (4) - 5 freq oot (4) - 1 freq ootins (4) - 2 freq ootgane (4) - 1 freq ootin' (4) - 1 freq oot-thru (4) - 1 freq ootlyn (4) - 1 freq ooten (4) - 9 freq ooteen (4) - 1 freq ootcom (4) - 1 freq nou oot (4) - 1 freq ootben (4) - 1 freq oot-throu (4) - 8 freq ootlins (4) - 3 freq ootgans (4) - 1 freq |
oot nou (0) - 2 freq for nou (4) - 1 freq ooten (6) - 9 freq ootlyn (6) - 1 freq ootgane (6) - 1 freq ooteen (6) - 1 freq ootlin (6) - 12 freq ootrun (6) - 3 freq ootdane (6) - 1 freq oot (6) - 1 freq nou oot (6) - 1 freq ootben (6) - 1 freq ootlan (6) - 1 freq ootthrou (6) - 9 freq ootline (6) - 14 freq ootlinn (6) - 3 freq ootrin (6) - 1 freq ootlinin (6) - 2 freq ootin (6) - 5 freq ootgaen (7) - 1 freq outlan (7) - 2 freq ethno (7) - 1 freq the-nou (7) - 4 freq ootdeen (7) - 1 freq no (7) - 3 freq |
SoundEx code - O350 outin - 4 freq ooten - 9 freq o'thaim - 1 freq ootin - 5 freq odin - 43 freq 'odin - 1 freq odin-' - 1 freq o'ten - 1 freq odeon - 4 freq ootin' - 1 freq ootdeen - 1 freq ootdön - 2 freq outen - 7 freq ooteen - 1 freq ottin - 1 freq outaen - 1 freq ootdane - 1 freq outten - 1 freq outdone - 1 freq o'don - 4 freq othem - 2 freq o'them - 1 freq o'deen - 1 freq oot nou - 2 freq oydmn - 1 freq |
MetaPhone code - OTN outin - 4 freq ooten - 9 freq ootin - 5 freq odin - 43 freq 'odin - 1 freq odin-' - 1 freq o'ten - 1 freq odeon - 4 freq ootin' - 1 freq outen - 7 freq ooteen - 1 freq ottin - 1 freq outaen - 1 freq outten - 1 freq o'don - 4 freq o'deen - 1 freq oot nou - 2 freq |
OOT NOU |
| Time to execute Levenshtein function - 0.204621 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.371484 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.034015 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.037203 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.001110 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. |