| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nut-broon (0) - 2 freq nit-broun (2) - 1 freq cut-doon (3) - 2 freq peat-broon (3) - 1 freq outgrown (4) - 1 freq hauf-croon (4) - 1 freq daurk-broon (4) - 2 freq put-upon (4) - 1 freq troon (4) - 5 freq new-born (4) - 3 freq broon (4) - 479 freq winy-broon (4) - 1 freq put-on (4) - 1 freq nutmon (4) - 1 freq let-doon (4) - 1 freq nutrition (4) - 4 freq gut-rot (4) - 1 freq duffy-broon (4) - 1 freq utterson (4) - 1 freq notebook (4) - 14 freq note-book (4) - 6 freq shut-doon (4) - 1 freq nethertoon (4) - 2 freq lat-doon (4) - 1 freq nott-book (4) - 1 freq |
nut-broon (0) - 2 freq nit-broun (2) - 1 freq peat-broon (4) - 1 freq new-born (5) - 3 freq new-boarn (6) - 2 freq note-book (6) - 6 freq iainbroon (6) - 1 freq winy-broon (6) - 1 freq cut-doon (6) - 2 freq ee-broos (7) - 4 freq nitherin (7) - 3 freq nottbook (7) - 1 freq awtroon (7) - 26 freq ee-broo (7) - 6 freq stubborn (7) - 14 freq nut-gairden (7) - 1 freq mousy-broun (7) - 1 freq natterin (7) - 4 freq re-born (7) - 1 freq nott-book (7) - 1 freq nit-trie (7) - 2 freq newborn (7) - 11 freq nit-tries (7) - 1 freq unborn (7) - 7 freq nytterin (7) - 1 freq |
SoundEx code - N316 not-havers - 1 freq 'ned-free' - 1 freq nit-broun - 1 freq needfire - 1 freq nut-broon - 2 freq nodbruce - 1 freq ntbirdclub - 1 freq |
MetaPhone code - NTBRN nit-broun - 1 freq nut-broon - 2 freq |
NUT-BROON |
| Time to execute Levenshtein function - 0.173272 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.346646 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.027959 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.040234 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.000854 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. |