Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aikeray (0) - 2 freq aikeray's (2) - 1 freq aikey (2) - 4 freq ainerly (2) - 2 freq likesay (2) - 25 freq saiveral (3) - 6 freq aixtrae (3) - 3 freq pawkery (3) - 2 freq alteran (3) - 1 freq allergy (3) - 4 freq likesae (3) - 4 freq siferry (3) - 4 freq rokelay (3) - 1 freq aider (3) - 2 freq literacy (3) - 34 freq baiker (3) - 1 freq sickerly (3) - 2 freq saiterday (3) - 2 freq aeway (3) - 1 freq jinery (3) - 1 freq likey (3) - 1 freq kieran (3) - 26 freq backerly (3) - 1 freq liberal (3) - 26 freq aiver (3) - 3 freq |
aikeray (0) - 2 freq aikey (3) - 4 freq biker (4) - 3 freq liker (4) - 9 freq airy (4) - 4 freq aiger (4) - 2 freq avery (4) - 2 freq fiery (4) - 28 freq kerry (4) - 47 freq daiker (4) - 2 freq fakery (4) - 1 freq bakery (4) - 16 freq akker (4) - 1 freq ainer (4) - 2 freq kerby (4) - 2 freq awery (4) - 1 freq array (4) - 16 freq waiker (4) - 5 freq aikawa (4) - 1 freq aiken (4) - 11 freq atray (4) - 2 freq aiverie (4) - 3 freq avera (4) - 1 freq cuikery (4) - 1 freq wiker (4) - 1 freq |
SoundEx code - A260 agree - 159 freq assure - 21 freq assuir - 2 freq aisier - 12 freq azr - 1 freq ashore - 35 freq augury - 1 freq aggro - 3 freq aesir - 4 freq aiger - 2 freq ashaor - 1 freq ashoar - 3 freq accur - 1 freq acroo - 1 freq acre - 20 freq ajar - 4 freq azor - 4 freq asher - 1 freq azariah - 2 freq aser - 1 freq aesier - 13 freq acquire - 3 freq azure - 3 freq acer - 1 freq aikeray - 2 freq a'haacro - 1 freq auskerry - 1 freq akker - 1 freq asseer - 1 freq ackir - 1 freq acair - 1 freq asseir - 1 freq augur - 1 freq €™azur - 1 freq aesyir - 1 freq acher - 1 freq agr - 1 freq augher - 1 freq agri - 1 freq ajr - 1 freq ajer - 2 freq asure - 1 freq |
MetaPhone code - AKR agree - 159 freq augury - 1 freq aggro - 3 freq acroo - 1 freq acre - 20 freq aikeray - 2 freq akker - 1 freq ackir - 1 freq acair - 1 freq augur - 1 freq agr - 1 freq agri - 1 freq |
AIKERAY |
Time to execute Levenshtein function - 0.189213 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.370257 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.027710 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.039302 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.001269 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. |