Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gypes (0) - 17 freq grypes (1) - 1 freq gytes (1) - 1 freq gype (1) - 47 freq gype's (1) - 1 freq gyped (1) - 1 freq gypos (1) - 1 freq gyper (1) - 1 freq types (1) - 28 freq gapes (1) - 1 freq gydes (1) - 3 freq pypes (1) - 1 freq sypes (1) - 5 freq hype (2) - 6 freq gyads (2) - 2 freq tyles (2) - 1 freq yues (2) - 1 freq gyms (2) - 12 freq 'yes (2) - 9 freq gaes (2) - 173 freq pype (2) - 9 freq gunes (2) - 2 freq gyed (2) - 6 freq giles (2) - 9 freq synes (2) - 1 freq |
gypes (0) - 17 freq gypos (1) - 1 freq gapes (1) - 1 freq sypes (2) - 5 freq pypes (2) - 1 freq gaps (2) - 11 freq gps (2) - 4 freq gypsy (2) - 2 freq gapus (2) - 1 freq gydes (2) - 3 freq gytes (2) - 1 freq grypes (2) - 1 freq gype (2) - 47 freq gype's (2) - 1 freq gyped (2) - 1 freq gyper (2) - 1 freq types (2) - 28 freq gape (3) - 4 freq apes (3) - 4 freq rupes (3) - 1 freq gates (3) - 104 freq gaups (3) - 2 freq grapes (3) - 23 freq gales (3) - 12 freq pyes (3) - 5 freq |
SoundEx code - G120 gaps - 11 freq gapes - 1 freq guffs - 4 freq gives - 20 freq gaffs - 4 freq gypes - 17 freq gps - 4 freq gaups - 2 freq gubs - 1 freq gabs - 3 freq gibbous - 2 freq gap's - 1 freq gobs - 4 freq guffaws - 2 freq gavse - 1 freq gowp's - 1 freq gappas - 2 freq gappus - 3 freq gabsie - 1 freq gowps - 3 freq goves - 2 freq govies - 1 freq gypsy - 2 freq gebbies - 1 freq 'gobbag - 1 freq gsfc - 2 freq gapus - 1 freq guavas - 1 freq gobbs - 20 freq gawps - 1 freq gbwg - 1 freq gbpx - 1 freq gavzo - 2 freq gpaj - 1 freq gypos - 1 freq gvs - 1 freq gype's - 1 freq gebs - 2 freq gfqzq - 1 freq gwupz - 1 freq gxewbfc - 1 freq gibbsy - 1 freq gpsg - 1 freq geebies - 1 freq guvs - 1 freq gjbwz - 1 freq |
MetaPhone code - JPS japes - 1 freq gypes - 17 freq jaups - 3 freq jps - 3 freq japs - 12 freq jaips - 1 freq gypsy - 2 freq gypos - 1 freq gype's - 1 freq |
GYPES |
Time to execute Levenshtein function - 0.300329 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.796259 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.087511 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.103746 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.001066 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. |