Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tapmaist (0) - 21 freq amaist (2) - 24 freq almaist (2) - 24 freq awmaist (2) - 70 freq aamaist (2) - 56 freq a'maist (2) - 1 freq tapmost (2) - 1 freq upmaist (2) - 1 freq hiemaist (3) - 1 freq nearmaist (3) - 1 freq €œmaist (3) - 2 freq enmaist (3) - 1 freq taoist (3) - 2 freq maist (3) - 1959 freq taist (3) - 2 freq awmiaist (3) - 1 freq traist (3) - 12 freq 'maist (3) - 5 freq ootmaist (3) - 14 freq tapis (3) - 1 freq papist (3) - 3 freq apairt (3) - 197 freq €™maist (3) - 1 freq benmaist (3) - 3 freq tammas (3) - 188 freq |
tapmaist (0) - 21 freq tapmost (2) - 1 freq upmaist (3) - 1 freq awmaist (4) - 70 freq amaist (4) - 24 freq deepmaist (4) - 1 freq utmaist (4) - 6 freq ootmaist (4) - 14 freq aamaist (4) - 56 freq a'maist (4) - 1 freq almaist (4) - 24 freq tap-aat (5) - 1 freq inmaist (5) - 2 freq hinmaist (5) - 84 freq midmaist (5) - 2 freq paist (5) - 1 freq tappit (5) - 6 freq tapesty (5) - 1 freq ootermaist (5) - 2 freq tamas (5) - 4 freq tammas (5) - 188 freq taptaes (5) - 1 freq baptist (5) - 11 freq hidmaist (5) - 2 freq formaist (5) - 1 freq |
SoundEx code - T152 tapmaist - 21 freq two-pence - 1 freq 'tippence' - 1 freq tippence - 1 freq tippence-worth - 3 freq tuppence - 14 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.223359 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.350374 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.028029 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.036919 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.000859 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. |