Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
injoy (0) - 2 freq injoys (1) - 1 freq njoy (1) - 8 freq enjoy (1) - 331 freq indy (2) - 57 freq into (2) - 193 freq enjoay (2) - 1 freq ino (2) - 2 freq enjoys (2) - 15 freq injoy't (2) - 1 freq njdy (2) - 1 freq inno (2) - 197 freq inov (2) - 1 freq injum (2) - 1 freq inoo (2) - 10 freq inemy (2) - 8 freq 'joy (2) - 1 freq insy (2) - 4 freq inbox (2) - 4 freq inky (2) - 8 freq inlow (2) - 1 freq injin (2) - 33 freq injoyin (2) - 2 freq ingy (2) - 14 freq iny (2) - 6 freq |
injoy (0) - 2 freq enjoy (1) - 331 freq njoy (1) - 8 freq enjy (2) - 2 freq enjoay (2) - 1 freq enjey (2) - 11 freq njoo (2) - 3 freq injoys (2) - 1 freq invy (3) - 2 freq joy (3) - 244 freq inion (3) - 1 freq inco (3) - 1 freq infy (3) - 1 freq info (3) - 35 freq inby (3) - 69 freq inaby (3) - 2 freq enjoyt (3) - 6 freq in'o (3) - 1 freq enj (3) - 1 freq enjye (3) - 1 freq nj (3) - 4 freq inny (3) - 3 freq 'enjoy (3) - 2 freq inty (3) - 21 freq injury (3) - 16 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 - INJ injoy - 2 freq ingy - 14 freq inge - 1 freq |
INJOY |
Time to execute Levenshtein function - 0.187748 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.331020 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.027436 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.036602 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.000816 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. |