Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ganglee (0) - 1 freq ganger (2) - 1 freq bangle (2) - 1 freq tangles (2) - 3 freq tangled (2) - 10 freq gangwey (2) - 6 freq ganges (2) - 1 freq ganged (2) - 22 freq bangles (2) - 3 freq cangle (2) - 2 freq jangle (2) - 5 freq gantle (2) - 1 freq angler (2) - 1 freq aglee (2) - 1 freq gargles (2) - 1 freq rangle (2) - 2 freq fangle (2) - 1 freq mangled (2) - 6 freq galilee (2) - 58 freq gargle (2) - 3 freq lang-ee (2) - 2 freq mangle (2) - 4 freq dangles (2) - 1 freq tanglet (2) - 1 freq angles (2) - 29 freq |
ganglee (0) - 1 freq gangly (2) - 2 freq mangle (3) - 4 freq fangle (3) - 1 freq gange (3) - 3 freq gargle (3) - 3 freq tangle (3) - 6 freq gaggle (3) - 5 freq gangrel (3) - 11 freq angle (3) - 22 freq rangle (3) - 2 freq gangie (3) - 3 freq ganged (3) - 22 freq ganges (3) - 1 freq bangle (3) - 1 freq ganger (3) - 1 freq cangle (3) - 2 freq gangwey (3) - 6 freq gantle (3) - 1 freq jangle (3) - 5 freq gangin (4) - 72 freq ginger (4) - 121 freq fingle (4) - 1 freq mingle (4) - 10 freq galgael (4) - 1 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 |
GANGLEE |
Time to execute Levenshtein function - 0.230813 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.360561 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.027948 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.037526 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.000943 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. |