Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jaw-hole (0) - 3 freq rat-hole (2) - 3 freq sandhole (3) - 3 freq whole (3) - 191 freq pawphone (3) - 2 freq jaw-bane (3) - 1 freq boag-hole (3) - 1 freq rat-hol (3) - 1 freq jaw-box (3) - 3 freq awhile (3) - 15 freq paw-phone (3) - 1 freq asshole (3) - 2 freq a-holes (3) - 1 freq tod-hole (3) - 3 freq rat-holl (3) - 1 freq lug-hole (3) - 1 freq baw-bee (4) - 1 freq saw-mill (4) - 1 freq oawthe (4) - 1 freq awhie (4) - 2 freq raphoe (4) - 1 freq €˜thole (4) - 1 freq jhone (4) - 71 freq pot-holes (4) - 1 freq pothole (4) - 5 freq |
jaw-hole (0) - 3 freq rat-hole (4) - 3 freq jaw-box (5) - 3 freq awhile (5) - 15 freq lug-hole (5) - 1 freq rat-hol (5) - 1 freq tod-hole (5) - 3 freq boag-hole (5) - 1 freq jaw-bane (5) - 1 freq whole (5) - 191 freq law-plea (6) - 2 freq while (6) - 1458 freq umwhile (6) - 16 freq 'while (6) - 1 freq jaw- (6) - 1 freq whale (6) - 32 freq wauchle (6) - 4 freq baw-heid (6) - 1 freq wwhile (6) - 1 freq wachle (6) - 1 freq mous-hole (6) - 1 freq jajahl (6) - 1 freq erse-hole (6) - 1 freq whele (6) - 1 freq waw-heid (6) - 1 freq |
SoundEx code - J400 jaw-hole - 3 freq jeely - 46 freq july - 73 freq jile - 42 freq julie - 29 freq jail - 49 freq jeelie - 11 freq j'll - 3 freq jyle - 47 freq jolly - 19 freq julia - 2 freq jl - 4 freq jewel - 19 freq jelly - 14 freq jell - 3 freq jalaw - 1 freq jel - 5 freq jill - 14 freq jeelly - 1 freq julai - 2 freq jeel - 7 freq julaai - 1 freq jalloo - 1 freq jøl - 2 freq jowly - 2 freq €˜jolly - 1 freq jellie - 2 freq joel - 1 freq jowel - 3 freq €˜julie - 1 freq jsl - 1 freq jll - 1 freq jhill - 19 freq jul - 1 freq jql - 1 freq jchelle - 1 freq jail' - 1 freq |
MetaPhone code - JHL jaw-hole - 3 freq jhill - 19 freq |
JAW-HOLE |
Time to execute Levenshtein function - 0.217001 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.397011 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.031466 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.037275 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.000923 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. |