| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nbshow (0) - 10 freq no-show (2) - 1 freq 'show (2) - 1 freq show (2) - 493 freq €œshow (2) - 1 freq shew (3) - 32 freq nsh (3) - 1 freq nsxo (3) - 1 freq shop (3) - 367 freq abbow (3) - 1 freq €¦how (3) - 1 freq narrow (3) - 15 freq slow (3) - 153 freq €œsho (3) - 2 freq ab'low (3) - 1 freq noow (3) - 2 freq €™how (3) - 4 freq nashous (3) - 1 freq show' (3) - 1 freq nyyow (3) - 1 freq shou (3) - 1 freq nahshon (3) - 7 freq nyow (3) - 70 freq nbsjtfw (3) - 1 freq sow (3) - 17 freq |
nbshow (0) - 10 freq no-show (3) - 1 freq show (4) - 493 freq €œshow (4) - 1 freq 'show (4) - 1 freq anyhow (5) - 5 freq shaw (5) - 190 freq noshun (5) - 3 freq neshed (5) - 1 freq nesh (5) - 4 freq nashin (5) - 3 freq nosh (5) - 1 freq showe (5) - 5 freq seihow (5) - 1 freq onyhow (5) - 9 freq nsfw (5) - 4 freq 'shaw (5) - 2 freq nephew (5) - 28 freq bestow (5) - 1 freq bishop (5) - 15 freq nbs (5) - 1 freq basho (5) - 1 freq showy (5) - 1 freq nash (5) - 2 freq nashed (5) - 4 freq |
SoundEx code - N120 neeps - 148 freq nieves - 15 freq nebs - 42 freq nips - 27 freq naps - 2 freq neives - 10 freq nephews - 6 freq nappies - 9 freq neebs - 13 freq nevis - 5 freq nephew's - 2 freq novice - 5 freq navajo - 1 freq neep's - 3 freq nyfe's - 1 freq neeps' - 1 freq 'nephews' - 1 freq nyaffs - 6 freq nives - 2 freq nobs - 3 freq neb's - 4 freq novak - 4 freq newbies - 1 freq nbs - 1 freq naevius - 1 freq navies - 1 freq nibbies - 1 freq noviss - 1 freq nopiece - 2 freq nvq - 6 freq nippies - 3 freq nava's - 2 freq naips - 1 freq nubuck - 1 freq nvch - 1 freq nfxo - 1 freq nufc - 6 freq niviews - 1 freq nbshow - 10 freq nobxzz - 1 freq nfywssqz - 1 freq npq - 1 freq nops - 1 freq nfias - 1 freq npx - 1 freq nebs' - 1 freq nivg - 1 freq nffc - 1 freq |
MetaPhone code - NBX nbshow - 10 freq |
NBSHOW |
| Time to execute Levenshtein function - 0.201419 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.394400 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.030202 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.043561 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.001099 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. |