| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gunner (0) - 2 freq gunnel (1) - 2 freq unner (1) - 461 freq dunner (1) - 6 freq hunner (1) - 442 freq funner (1) - 1 freq wunner (1) - 282 freq gunnar (1) - 6 freq gunners (1) - 1 freq runner (1) - 19 freq gunned (1) - 1 freq gonner (1) - 1 freq ganner (1) - 1 freq cinner (2) - 1 freq burner (2) - 3 freq tenner (2) - 25 freq inner (2) - 46 freq gutter (2) - 33 freq gunnal (2) - 1 freq under (2) - 447 freq guider (2) - 4 freq bunder (2) - 1 freq guizer (2) - 4 freq yonner (2) - 67 freq dunder (2) - 5 freq |
gunner (0) - 2 freq gonner (1) - 1 freq ganner (1) - 1 freq gunnar (1) - 6 freq gunners (2) - 1 freq runner (2) - 19 freq gunned (2) - 1 freq unner (2) - 461 freq wunner (2) - 282 freq gunnel (2) - 2 freq dunner (2) - 6 freq hunner (2) - 442 freq funner (2) - 1 freq gunns (3) - 2 freq funnier (3) - 7 freq sinner (3) - 10 freq gender (3) - 19 freq wonner (3) - 5 freq wanner (3) - 18 freq ganfer (3) - 2 freq ginger (3) - 121 freq cunnar (3) - 1 freq inunner (3) - 1 freq girner (3) - 1 freq banner (3) - 19 freq |
SoundEx code - G560 gonorrhoea - 1 freq gemmer - 1 freq gomorrah - 2 freq gimmer - 2 freq gunnar - 6 freq goner - 4 freq genre - 9 freq ganner - 1 freq gener - 1 freq gonner - 1 freq geynear - 2 freq gunner - 2 freq gamrie - 5 freq gey-near - 1 freq gnar - 1 freq gonhorrea - 1 freq gwenmairi - 1 freq |
MetaPhone code - KNR canary - 14 freq kinnoir - 3 freq canner - 1 freq conrie - 1 freq gunnar - 6 freq goner - 4 freq keener - 6 freq cannier - 1 freq ganner - 1 freq conneree - 1 freq cunnar - 1 freq gonner - 1 freq cannery - 1 freq ken-or - 1 freq connor - 5 freq gunner - 2 freq canaria - 1 freq connery - 5 freq conor - 10 freq €œconor - 1 freq conner - 2 freq |
GUNNER |
| Time to execute Levenshtein function - 0.381721 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.785512 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.028066 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.088801 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.000923 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. |