| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gizzen (0) - 5 freq gizzern (1) - 1 freq bizzen (1) - 2 freq gizzes (1) - 2 freq pizzen (1) - 2 freq wizzen (1) - 4 freq dizzen (1) - 86 freq kizzen (1) - 10 freq jizzen (1) - 4 freq sizzen (1) - 3 freq gizzent (1) - 8 freq gizzens (1) - 1 freq bizzin (2) - 17 freq fizzer (2) - 6 freq pizzens (2) - 1 freq gitten (2) - 2 freq gien (2) - 1024 freq cizzin (2) - 1 freq gizzerns (2) - 1 freq fizzed (2) - 1 freq dizen (2) - 8 freq fizzin (2) - 8 freq given (2) - 69 freq pizen (2) - 3 freq kizzens (2) - 6 freq |
gizzen (0) - 5 freq kizzen (2) - 10 freq jizzen (2) - 4 freq gizzens (2) - 1 freq dizzen (2) - 86 freq gizzent (2) - 8 freq sizzen (2) - 3 freq gizzern (2) - 1 freq wizzen (2) - 4 freq gizzes (2) - 2 freq bizzen (2) - 2 freq pizzen (2) - 2 freq rizzon (3) - 8 freq gilzean (3) - 1 freq bizzan (3) - 1 freq kizzin (3) - 1 freq gizz (3) - 19 freq fizzin (3) - 8 freq caizzen (3) - 1 freq rizzin (3) - 1 freq dizzin (3) - 1 freq bizzin (3) - 17 freq cizzin (3) - 1 freq dizen (4) - 8 freq grazin (4) - 11 freq |
SoundEx code - G250 guessin - 18 freq gazin - 18 freq geckin - 3 freq gawkin - 13 freq guisin - 30 freq gizzen - 5 freq gacin - 1 freq gushin - 4 freq gaggin - 7 freq gougin - 1 freq giggin - 2 freq gicn - 1 freq gai-jin - 1 freq gwickan - 1 freq gicin - 1 freq gecin - 1 freq gizmo - 2 freq gazan - 2 freq gokkan - 1 freq gawkan - 1 freq gaskin - 1 freq gowkin - 2 freq gowchin - 1 freq gaughan - 8 freq gascon - 2 freq geckan - 1 freq €˜giacomo - 1 freq giacomo - 2 freq guysin - 7 freq gauchin - 1 freq ggigxn - 1 freq guisin' - 1 freq |
MetaPhone code - JSN gizzen - 5 freq jizzen - 4 freq gicin - 1 freq gecin - 1 freq jason - 24 freq juicin - 2 freq jessie-annie - 1 freq jycin - 1 freq jewson - 1 freq |
GIZZEN |
| Time to execute Levenshtein function - 0.309592 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.581520 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.044633 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.052924 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.000996 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. |