Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ahoajmfrwq (0) - 1 freq afoare (6) - 1 freq haimert (6) - 1 freq dofjafcw (6) - 1 freq shoappers (6) - 1 freq shoarts (6) - 3 freq shoart (6) - 41 freq harmful (6) - 1 freq thoarn (6) - 11 freq chalmer (6) - 2 freq hamar (6) - 5 freq hammerin (6) - 18 freq ah'mur (6) - 3 freq thoumire (6) - 2 freq soajers (6) - 1 freq pomfrey (6) - 1 freq hoarn (6) - 1 freq hoarie (6) - 1 freq hoarns (6) - 2 freq ahoj (6) - 2 freq hammers (6) - 6 freq axfroq (6) - 1 freq charmer (6) - 3 freq hammeran (6) - 1 freq chalmeris (6) - 1 freq |
ahoajmfrwq (0) - 1 freq haemfarin (9) - 2 freq hammart (10) - 1 freq hammer (10) - 44 freq homqmq (10) - 1 freq hammarby (10) - 1 freq axfroq (10) - 1 freq hammeran (10) - 1 freq hamebrew (10) - 1 freq hammer' (10) - 2 freq hammert (10) - 4 freq hammered (10) - 13 freq haimerin (10) - 1 freq homegrown (10) - 1 freq haimer (10) - 2 freq hamefarin (10) - 9 freq hammers (10) - 6 freq homer (10) - 1 freq homer's (10) - 1 freq haimers (10) - 2 freq homebrew (10) - 1 freq ah'mur (10) - 3 freq pomfrey (10) - 1 freq hamar (10) - 5 freq hammerin (10) - 18 freq |
SoundEx code - A251 accompanit - 1 freq assembly - 26 freq accomplice - 3 freq accomplishments - 1 freq accompaniment - 6 freq assembled - 15 freq again-baith - 1 freq accompli - 1 freq assumptions - 6 freq assemble - 3 freq assemblie - 2 freq assumption - 12 freq accompanied - 22 freq accompany - 8 freq assembelt - 1 freq accompt - 2 freq accompts - 1 freq akimbo - 1 freq accomplishment - 1 freq auchinblae - 1 freq auchenfairlie - 1 freq assemblin - 1 freq accomplished - 2 freq accompanyin - 8 freq assembles - 1 freq auchenbinnie - 1 freq accomplist - 1 freq accumplished - 1 freq assumption¬ - 1 freq assemblan - 1 freq accomplisht - 3 freq accompong - 2 freq assembledin - 1 freq assemblet - 1 freq aknovh - 1 freq ahoajmfrwq - 1 freq accompanying - 1 freq aconfedofdunces - 1 freq |
MetaPhone code - AHJMFRK ahoajmfrwq - 1 freq |
AHOAJMFRWQ |
Time to execute Levenshtein function - 0.252485 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.460364 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.044011 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.048120 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.000938 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. |