| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whinbrae (0) - 2 freq whimbrel (3) - 4 freq whinge (3) - 2 freq winbreak (3) - 1 freq whitrat (3) - 2 freq winae (3) - 2 freq windae (3) - 564 freq winsnae (3) - 1 freq 'whin're (3) - 1 freq kintrae (3) - 46 freq hinnae (3) - 50 freq whire (3) - 1 freq intrae (3) - 1 freq whine (3) - 5 freq whinbush (3) - 1 freq inbrak (3) - 2 freq whit're (3) - 1 freq hanbrake (3) - 2 freq winnae (3) - 46 freq whiterat (3) - 1 freq whirran (3) - 1 freq whitna' (4) - 1 freq whizzan (4) - 1 freq wunorse (4) - 2 freq whibbit (4) - 1 freq |
whinbrae (0) - 2 freq whire (5) - 1 freq whiniver (5) - 3 freq whanur (5) - 1 freq whine (5) - 5 freq hanbrake (5) - 2 freq whinbush (5) - 1 freq whinner (5) - 1 freq whinivir (5) - 1 freq winbreak (5) - 1 freq whinge (5) - 2 freq 'whin're (5) - 1 freq whinever (5) - 3 freq whit're (5) - 1 freq whimbrel (5) - 4 freq hendrie (6) - 1 freq wherefrae (6) - 1 freq whinivver (6) - 4 freq whinges (6) - 1 freq whinny (6) - 6 freq wintry (6) - 5 freq whinnied (6) - 3 freq who're (6) - 5 freq hungrie (6) - 1 freq whore (6) - 1 freq |
SoundEx code - W516 whenever - 78 freq whaniver - 108 freq whimper - 13 freq whimpers - 3 freq wimperin - 1 freq wey-never - 1 freq winifred - 34 freq winifred's - 1 freq wheniver - 3 freq whimpering - 1 freq whun-bricht - 1 freq wine-baurs - 1 freq whimpered - 7 freq whuniver - 1 freq whanivver - 11 freq whenevir - 1 freq whiniver - 3 freq wye-niver - 1 freq whenivver - 4 freq whinivir - 1 freq 'whenever - 1 freq whinever - 3 freq wye-never - 1 freq whanivir - 2 freq wanfortuins - 1 freq whanever - 8 freq whimbrel - 4 freq way-never - 1 freq whinivver - 4 freq wnvert - 1 freq winy-broon - 1 freq wanfortunat - 1 freq wanfortun - 1 freq whamivver - 1 freq whimperin - 1 freq whinbrae - 2 freq whinbraefairm - 1 freq winbreak - 1 freq |
MetaPhone code - WNBR whinbrae - 2 freq |
WHINBRAE |
| Time to execute Levenshtein function - 0.559524 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.625160 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.030211 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.073999 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.000860 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. |