Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
assumed (0) - 12 freq assumes (1) - 4 freq assume (1) - 25 freq assumet (1) - 1 freq assured (1) - 30 freq assure (2) - 21 freq soumed (2) - 3 freq assuret (2) - 4 freq issued (2) - 6 freq assed (2) - 1 freq assuman (2) - 1 freq assumin (2) - 10 freq assuired (2) - 1 freq resumed (2) - 4 freq ashamed (2) - 41 freq assumt (2) - 1 freq aesome (3) - 7 freq slimed (3) - 1 freq ensued (3) - 3 freq soused (3) - 2 freq amused (3) - 18 freq asure (3) - 1 freq dwaumed (3) - 1 freq lumed (3) - 1 freq argued (3) - 12 freq |
assumed (0) - 12 freq assured (2) - 30 freq assumet (2) - 1 freq assumes (2) - 4 freq assume (2) - 25 freq assuired (3) - 1 freq resumed (3) - 4 freq assumt (3) - 1 freq assumin (3) - 10 freq ashamed (3) - 41 freq assuman (3) - 1 freq issued (3) - 6 freq soumed (3) - 3 freq assed (3) - 1 freq assam (4) - 1 freq seemed (4) - 572 freq semed (4) - 13 freq soomed (4) - 7 freq shamed (4) - 8 freq assailed (4) - 2 freq asseired (4) - 1 freq summed (4) - 6 freq soused (4) - 2 freq assuret (4) - 4 freq assure (4) - 21 freq |
SoundEx code - A253 accoont - 170 freq acquantances - 2 freq accoontin - 5 freq asinder - 1 freq ascend - 7 freq auchmithie - 1 freq account - 65 freq acquant - 8 freq assent - 2 freq accent - 116 freq accounts - 25 freq accountin - 2 freq again'-that - 1 freq acquainted - 3 freq aquent - 6 freq acquent - 15 freq acquantance - 1 freq assumed - 12 freq agenda - 23 freq accents - 29 freq ascent - 2 freq ashamed - 41 freq accommodation - 6 freq aquant - 1 freq acquaint - 3 freq accounted - 3 freq asoond - 7 freq assint - 1 freq acoont - 6 freq accoonts - 27 freq agent - 14 freq accooont - 1 freq aquaint - 4 freq aish-midden - 1 freq agent's - 3 freq accountable - 3 freq agents - 7 freq accoontable - 3 freq accommodatin - 1 freq accquaintance - 1 freq acoontant - 1 freq accommodate - 4 freq ascendit - 3 freq accoontability - 4 freq accoontancy - 3 freq accoontants - 9 freq acoonts - 2 freq accoontant's - 1 freq acoontin - 1 freq accents' - 2 freq acquaintance - 3 freq acquaintances - 3 freq acquaintet - 1 freq accoonto - 1 freq accoontant - 5 freq ascendant - 1 freq accountants - 2 freq asunder - 5 freq agentrie - 3 freq agentries - 3 freq acanthus - 1 freq awaukent - 2 freq accentuates - 1 freq ascended - 1 freq account's - 1 freq accomodatin' - 1 freq accoonted - 1 freq akwant - 2 freq accountan - 1 freq auchineden - 1 freq accountant - 1 freq aucient - 1 freq accountit - 1 freq acquentit - 2 freq acquentance - 1 freq agendas - 1 freq 'accent' - 1 freq acamedics - 1 freq ascendancy - 1 freq accommodating - 2 freq assynt - 4 freq assumt - 1 freq assumet - 1 freq auchentocher - 1 freq accentuated - 1 freq ashentroole - 1 freq acquanted - 1 freq aksent - 4 freq aksentid - 1 freq aksents - 1 freq accentuategame - 1 freq agentathcliath - 4 freq a'continental - 1 freq acnd - 1 freq agentsofshield - 2 freq awakened - 1 freq accentor - 1 freq agentbailie - 1 freq awsumedevil - 6 freq agentp - 4 freq accentricitypod - 2 freq accentismproj - 1 freq accountability - 1 freq accountable' - 1 freq agentscotland - 1 freq |
MetaPhone code - ASMT assumed - 12 freq assumt - 1 freq assumet - 1 freq |
ASSUMED |
Time to execute Levenshtein function - 0.290679 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.672435 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.028297 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.079586 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.000894 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. |