Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
theinvisibleman (0) - 7 freq invisible (6) - 44 freq unvisible (7) - 1 freq thisistimdean (7) - 1 freq enviable (8) - 1 freq theinken (8) - 6 freq thescotsman (8) - 8 freq sensible (8) - 34 freq thingman (8) - 2 freq theinkin (8) - 1 freq thesilent (8) - 1 freq theivin (8) - 3 freq visible (8) - 25 freq thelawisbroken (8) - 1 freq athentisitee (8) - 1 freq shivmaclean (8) - 1 freq traivilen (8) - 1 freq tesponsible (8) - 1 freq heidsman (8) - 2 freq 'invincible' (8) - 1 freq sinsible (8) - 1 freq philippullman (8) - 1 freq theindyninja (8) - 4 freq television (8) - 65 freq inveesible (8) - 9 freq |
theinvisibleman (0) - 7 freq invisible (10) - 44 freq unvisible (11) - 1 freq thingman (12) - 2 freq thelawisbroken (12) - 1 freq th'investigation (12) - 1 freq inveesible (12) - 9 freq thisistimdean (12) - 1 freq thanksgien (13) - 2 freq gentleman (13) - 25 freq heinesen (13) - 2 freq veisible (13) - 1 freq thesalon (13) - 1 freq thainstane (13) - 1 freq thesltn (13) - 2 freq things'll (13) - 3 freq inveesibly (13) - 3 freq huntsman (13) - 2 freq tinsellin (13) - 1 freq thanksgiein (13) - 1 freq toonsman (13) - 1 freq television (13) - 65 freq thainstin (13) - 1 freq gentilman (13) - 3 freq thescotsman (13) - 8 freq |
SoundEx code - T512 thumps - 5 freq thumbs - 11 freq tempest's - 4 freq thump's - 1 freq tampson - 1 freq tempest - 5 freq thompson - 5 freq tombs - 9 freq timepiece - 3 freq toonfowks - 1 freq tomboys - 1 freq timbuktu - 2 freq thompsons' - 1 freq th'investigation - 1 freq tempus - 1 freq temps - 1 freq thoombs - 1 freq tombaugh - 1 freq €˜tempus - 1 freq toombucht - 1 freq timbuctu - 2 freq ten-vyce - 1 freq tombsteens - 1 freq thompson's - 1 freq tompeck - 1 freq timpeake - 2 freq tempestuous - 1 freq tumips - 1 freq tnbzmohqfq - 1 freq tdnphs - 1 freq theinvisibleman - 7 freq thumbÂ’s - 1 freq |
MetaPhone code - 0NFSBLMN theinvisibleman - 7 freq |
THEINVISIBLEMAN |
Time to execute Levenshtein function - 0.283324 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.467228 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.032960 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.037312 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.000890 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. |