| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| guncle (0) - 1 freq 'uncle (1) - 1 freq uncle (1) - 275 freq gruntle (2) - 1 freq 'uncle' (2) - 1 freq bundle (2) - 18 freq gun-ile (2) - 1 freq gunfre (2) - 1 freq €œuncle (2) - 2 freq funcie (2) - 1 freq dunkle (2) - 1 freq 'uncles (2) - 1 freq uncles (2) - 19 freq gurgle (2) - 2 freq cunnle (2) - 3 freq guddle (2) - 34 freq bunnle (2) - 8 freq gune (2) - 1 freq wunce (2) - 1 freq mungle (2) - 2 freq gentle (2) - 81 freq muscle (2) - 29 freq hunnle (2) - 2 freq gunnie (2) - 16 freq gunge (2) - 3 freq |
guncle (0) - 1 freq 'uncle (2) - 1 freq uncle (2) - 275 freq gun-ile (3) - 1 freq gentle (3) - 81 freq gantle (3) - 1 freq runcie (4) - 1 freq ounce (4) - 5 freq bungle (4) - 2 freq jungle (4) - 38 freq guile (4) - 4 freq auncles (4) - 1 freq guzzle (4) - 4 freq dunce (4) - 27 freq gundge (4) - 1 freq gentile (4) - 3 freq incl (4) - 3 freq gnc (4) - 1 freq gunnal (4) - 1 freq gentlie (4) - 3 freq ganglee (4) - 1 freq gangly (4) - 2 freq gunales (4) - 1 freq gunnel (4) - 2 freq gaunch (4) - 2 freq |
SoundEx code - G524 ganglee - 1 freq guy-nah-cawl-ah-jay - 1 freq gncludin - 1 freq gangly - 2 freq gun-slingin - 1 freq gnsalq - 1 freq geeeeeeoannnnnnnkilllllie - 1 freq ggsinclair - 2 freq guncle - 1 freq gggnicholson - 1 freq gang-l - 1 freq |
MetaPhone code - KNKL ganglee - 1 freq king'll - 1 freq kingly - 1 freq cangle - 2 freq gangly - 2 freq guncle - 1 freq gang-l - 1 freq |
GUNCLE |
| Time to execute Levenshtein function - 0.395111 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.509799 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.027390 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.067571 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. |