Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jangle (0) - 5 freq jargle (1) - 1 freq bangle (1) - 1 freq tangle (1) - 6 freq fangle (1) - 1 freq rangle (1) - 2 freq cangle (1) - 2 freq jungle (1) - 38 freq jingle (1) - 2 freq mangle (1) - 4 freq angle (1) - 22 freq fangled (2) - 3 freq tangles (2) - 3 freq jinglet (2) - 1 freq wangled (2) - 1 freq gangie (2) - 3 freq tangue (2) - 1 freq tanglt (2) - 1 freq hanle (2) - 4 freq ganglee (2) - 1 freq fingle (2) - 1 freq gange (2) - 3 freq jane (2) - 50 freq angles (2) - 29 freq ange (2) - 1 freq |
jangle (0) - 5 freq jungle (1) - 38 freq jingle (1) - 2 freq angle (2) - 22 freq cangle (2) - 2 freq mangle (2) - 4 freq rangle (2) - 2 freq jargle (2) - 1 freq bangle (2) - 1 freq fangle (2) - 1 freq tangle (2) - 6 freq single (3) - 245 freq mingle (3) - 10 freq janglin (3) - 1 freq anglo (3) - 2 freq jangelt (3) - 1 freq ringle (3) - 1 freq jougle (3) - 1 freq joogle (3) - 6 freq janela (3) - 5 freq jungles (3) - 2 freq wengle (3) - 1 freq gangly (3) - 2 freq ingle (3) - 29 freq dingle (3) - 7 freq |
SoundEx code - J524 jangelt - 1 freq jungle - 38 freq jinglin - 11 freq jangle - 5 freq janglin' - 1 freq jingle-jangle - 1 freq jingle-jangling - 1 freq jungles - 2 freq jinglet - 1 freq jangle't - 1 freq junkie-lan - 1 freq jingle - 2 freq 'jingle' - 1 freq 'jingle - 1 freq jingling - 1 freq janglin - 1 freq jinglin'chain - 1 freq johnmacleanma - 2 freq jmcl - 21 freq johnahcoulter - 10 freq jsinclair - 2 freq jankelhirsch - 1 freq jennygilruth - 1 freq jameskellylab - 1 freq jameskelly - 3 freq jimscullion - 1 freq johnhegley - 1 freq janeclarejones - 5 freq jameslewinton - 1 freq jkjgnjjjl - 1 freq joanmcalpine - 22 freq jinglinggeordie - 1 freq |
MetaPhone code - JNKL jungle - 38 freq jangle - 5 freq jingle - 2 freq 'jingle' - 1 freq 'jingle - 1 freq geeeeeeoannnnnnnkilllllie - 1 freq |
JANGLE |
Time to execute Levenshtein function - 0.294234 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.573276 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.035962 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.070485 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.000848 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. |