Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tapmaist (0) - 21 freq awmaist (2) - 70 freq almaist (2) - 21 freq tapmost (2) - 1 freq amaist (2) - 24 freq a'maist (2) - 1 freq upmaist (2) - 1 freq aamaist (2) - 55 freq paist (3) - 1 freq inmaist (3) - 2 freq papist (3) - 3 freq utmaist (3) - 6 freq maist (3) - 1919 freq hiemaist (3) - 1 freq hidmaist (3) - 2 freq appairt (3) - 5 freq 'maist (3) - 5 freq €™maist (3) - 1 freq nearmaist (3) - 1 freq tammas (3) - 188 freq tappit (3) - 6 freq taist (3) - 2 freq deepmaist (3) - 1 freq traist (3) - 12 freq midmaist (3) - 2 freq |
tapmaist (0) - 21 freq tapmost (2) - 1 freq upmaist (3) - 1 freq aamaist (4) - 55 freq ootmaist (4) - 14 freq deepmaist (4) - 1 freq utmaist (4) - 6 freq almaist (4) - 21 freq awmaist (4) - 70 freq amaist (4) - 24 freq a'maist (4) - 1 freq awmiaist (5) - 1 freq taptaes (5) - 1 freq tamas (5) - 4 freq enmaist (5) - 1 freq taoist (5) - 2 freq benmaist (5) - 3 freq ootermaist (5) - 2 freq tapesty (5) - 1 freq baptist (5) - 11 freq tap-aat (5) - 1 freq €œmaist (5) - 2 freq formaist (5) - 1 freq tapis (5) - 1 freq hinmaist (5) - 83 freq |
SoundEx code - T152 tapmaist - 21 freq two-pence - 1 freq 'tippence' - 1 freq tippence - 1 freq tippence-worth - 3 freq tuppence - 10 freq tuppens - 1 freq two-fingered - 1 freq tappins - 1 freq topping - 2 freq tapmost - 1 freq tipping - 3 freq tippency - 1 freq tape-mizzers - 1 freq tubing - 1 freq toppin's - 1 freq tvhmjt - 1 freq typing - 4 freq thefamousreds - 1 freq tovnykbhd - 1 freq theboymcnicoll - 1 freq toffee-nosed - 1 freq |
MetaPhone code - TPMST tapmaist - 21 freq deepmaist - 1 freq tapmost - 1 freq |
TAPMAIST |
Time to execute Levenshtein function - 0.181905 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.355938 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.027287 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.037000 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.000842 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. |