| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gangrels (0) - 1 freq gangrel's (1) - 1 freq gangrel (1) - 11 freq mongrels (2) - 1 freq ganges (2) - 1 freq gangweys (2) - 1 freq angels (2) - 64 freq 'gangrel (2) - 1 freq mangrel (2) - 1 freq gantrees (2) - 1 freq gangers (2) - 2 freq camarels (3) - 1 freq angrily (3) - 19 freq hangers (3) - 1 freq lantrens (3) - 2 freq gantry's (3) - 1 freq ganglee (3) - 1 freq gansee's (3) - 1 freq angel's (3) - 4 freq manglers (3) - 1 freq laurels (3) - 2 freq angela (3) - 46 freq angels' (3) - 2 freq 'angela (3) - 1 freq ganger (3) - 1 freq |
gangrels (0) - 1 freq gangrel (2) - 11 freq gangrel's (2) - 1 freq gangers (3) - 2 freq mongrels (3) - 1 freq gantrees (4) - 1 freq generals (4) - 2 freq mangrel (4) - 1 freq gangweys (4) - 1 freq ganges (4) - 1 freq angels (4) - 64 freq 'gangrel (4) - 1 freq gargles (5) - 1 freq angils (5) - 1 freq aungels (5) - 1 freq angells (5) - 1 freq angelus (5) - 1 freq gomerels (5) - 2 freq angeles (5) - 4 freq cangils (5) - 1 freq gang-l (5) - 1 freq engels (5) - 1 freq congress (5) - 1 freq bangles (5) - 3 freq tangles (5) - 3 freq |
SoundEx code - G526 ginger - 121 freq 'gangrel - 1 freq gangrel - 11 freq ganger - 1 freq 'ginger' - 1 freq gangers - 2 freq gennesaret - 1 freq genessaretb - 1 freq gum-chawer - 1 freq gngirs - 1 freq gnashers - 1 freq gingerly - 2 freq gangrels - 1 freq gingerbread - 4 freq gangrel's - 1 freq gang-roond - 14 freq gingerbried - 15 freq gznqrduu - 1 freq gingertotty - 3 freq gingerboab - 5 freq gingergeekcraig - 1 freq |
MetaPhone code - KNKRLS gangrels - 1 freq gangrel's - 1 freq |
GANGRELS |
| Time to execute Levenshtein function - 0.220811 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.352694 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.029189 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.038333 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.000921 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. |