Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
snawbund (0) - 1 freq snawbird (2) - 1 freq snawmen (3) - 1 freq snawline (3) - 1 freq snawin (3) - 6 freq starburd (3) - 1 freq staund (3) - 104 freq saund (3) - 31 freq snawbaws (3) - 1 freq stawnd (3) - 1 freq snawman (3) - 10 freq snawed (3) - 6 freq snawbaw (3) - 20 freq snawba (3) - 25 freq snawbaa (3) - 2 freq sawbath (4) - 1 freq unbound (4) - 2 freq naebd (4) - 1 freq swabbin (4) - 1 freq shawin (4) - 60 freq sealand (4) - 1 freq lawland (4) - 20 freq snashed (4) - 11 freq unwind (4) - 5 freq snaffled (4) - 1 freq |
snawbund (0) - 1 freq snawbird (3) - 1 freq snawman (5) - 10 freq snawed (5) - 6 freq stawnd (5) - 1 freq snawbaa (5) - 2 freq snawbaws (5) - 1 freq snawba (5) - 25 freq snawbaw (5) - 20 freq snawmen (5) - 1 freq snawline (5) - 1 freq snawin (5) - 6 freq snowin (6) - 4 freq sandsound (6) - 3 freq snowkin (6) - 7 freq snowing (6) - 4 freq snpbad (6) - 1 freq sawbeens (6) - 1 freq snowman (6) - 2 freq snowboy (6) - 1 freq snubbed (6) - 1 freq snibbin (6) - 2 freq spawned (6) - 1 freq snowed (6) - 2 freq snowmen (6) - 1 freq |
SoundEx code - S515 snoovin - 8 freq snappin - 15 freq snoopin - 1 freq symphony - 4 freq snawbund - 1 freq snippen - 2 freq shin-bane - 1 freq snipin' - 1 freq snuvin - 2 freq sniffin - 12 freq snuffin - 7 freq sma-paned - 1 freq shampooin - 1 freq sunbem - 1 freq skyimpnafftak - 2 freq sniffan - 1 freq snibbin - 2 freq symphonies - 4 freq snuivin - 1 freq sunbeam - 2 freq semi-final - 1 freq snippin - 1 freq schampangyie - 1 freq symphioun - 1 freq sumpn - 13 freq sniffing - 2 freq sunbeams - 1 freq snapping - 1 freq shmufm - 4 freq sinnfeinireland - 4 freq sinnfein - 1 freq sniping - 1 freq shmufmbreakfast - 1 freq snvvn - 1 freq semifinal - 2 freq smfonzxyba - 1 freq somepoint - 1 freq snyaavin - 2 freq sniffings - 1 freq sinfonia - 1 freq snpwindaes - 1 freq |
MetaPhone code - SNBNT snawbund - 1 freq |
SNAWBUND |
Time to execute Levenshtein function - 0.221991 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.384756 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.027657 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.041541 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.000896 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. |