| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inch (0) - 51 freq incl (1) - 3 freq insch (1) - 4 freq kinch (1) - 19 freq itch (1) - 5 freq pinch (1) - 21 freq minch (1) - 3 freq inc (1) - 4 freq cinch (1) - 4 freq incy (1) - 1 freq winch (1) - 6 freq hinch (1) - 2 freq ich (1) - 4 freq binch (1) - 6 freq finch (1) - 1 freq inco (1) - 1 freq nch (1) - 2 freq int (2) - 31 freq rach (2) - 5 freq inwy (2) - 1 freq such (2) - 278 freq euch (2) - 1 freq inaw (2) - 7 freq inches (2) - 97 freq soch (2) - 1 freq |
inch (0) - 51 freq nch (1) - 2 freq finch (2) - 1 freq binch (2) - 6 freq ich (2) - 4 freq inco (2) - 1 freq unich (2) - 1 freq enuch (2) - 89 freq enoch (2) - 17 freq hinch (2) - 2 freq noch (2) - 2 freq itch (2) - 5 freq winch (2) - 6 freq insch (2) - 4 freq incl (2) - 3 freq pinch (2) - 21 freq kinch (2) - 19 freq cinch (2) - 4 freq incy (2) - 1 freq minch (2) - 3 freq inc (2) - 4 freq ouch (3) - 23 freq huch (3) - 1 freq yncw (3) - 1 freq wach (3) - 9 freq |
SoundEx code - I520 inch - 51 freq ink - 37 freq iona's - 4 freq in's - 7 freq in-house - 1 freq 'inky - 1 freq inky - 8 freq image - 99 freq ian's - 3 freq Áine's - 1 freq insch - 4 freq ihank - 2 freq innes - 14 freq iiiness - 1 freq iammas - 2 freq ihon's - 3 freq incaa - 1 freq inweys - 1 freq incy - 1 freq 'ink - 1 freq injoy - 2 freq ins - 14 freq ina's - 1 freq iain's - 2 freq imax - 3 freq ing - 10 freq ionik - 1 freq ionic - 2 freq inns - 8 freq insy - 4 freq inga - 36 freq inco - 1 freq iens - 1 freq i'news - 3 freq i'hans - 1 freq i'nick - 1 freq inehes - 1 freq ink' - 1 freq ions - 3 freq inwick - 3 freq imago - 1 freq in-hoose - 2 freq iang - 1 freq iaince - 1 freq ing - 3 freq ing-chao - 1 freq inc - 4 freq ingy - 14 freq inn's - 1 freq inas - 1 freq inqa - 1 freq inge - 1 freq inoez - 1 freq |
MetaPhone code - INX inch - 51 freq intiae - 1 freq |
INCH |
| Time to execute Levenshtein function - 0.170479 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.315095 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.029614 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.039732 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.000933 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. |