| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aforehan (0) - 3 freq aforehaun (1) - 7 freq aforehaan (1) - 1 freq forehan (1) - 4 freq aforehand (1) - 1 freq aforehaund (2) - 7 freq afore-haun (2) - 1 freq foreman (2) - 5 freq aforehaand (2) - 2 freq aforesaid (3) - 2 freq foreign (3) - 69 freq forman (3) - 13 freq aff-han (3) - 1 freq forgan (3) - 3 freq foran (3) - 1 freq beforehaun (3) - 1 freq foregane (3) - 2 freq orphan (3) - 14 freq foregang (3) - 1 freq afore's (3) - 1 freq fore-en (3) - 2 freq foresaw (3) - 1 freq far-han (3) - 2 freq aforesyne (3) - 4 freq afghan (3) - 1 freq |
aforehan (0) - 3 freq aforehaan (1) - 1 freq forehan (1) - 4 freq aforehaun (1) - 7 freq aforehand (2) - 1 freq aforehaand (3) - 2 freq foreman (3) - 5 freq afore-haun (3) - 1 freq aforehaund (3) - 7 freq feehan (4) - 1 freq afghan (4) - 1 freq far-han (4) - 2 freq forehead (4) - 5 freq aforesyne (4) - 4 freq fortean (4) - 5 freq forran (4) - 1 freq foregaun (4) - 4 freq affhan (4) - 1 freq african (4) - 21 freq fore-en (4) - 2 freq foran (4) - 1 freq forman (4) - 13 freq foreign (4) - 69 freq beforehaun (4) - 1 freq forgan (4) - 3 freq |
SoundEx code - A165 affrontit - 70 freq afrrontit - 1 freq appearin - 23 freq appearance - 49 freq appairently - 18 freq affirmed - 2 freq apprentice' - 1 freq abraham - 53 freq apparent - 23 freq abrahamic - 1 freq affronted - 12 freq apprehension - 2 freq apparently - 85 freq aforehaund - 7 freq aforehaan - 1 freq affront - 32 freq appearandly - 1 freq apprentice - 22 freq affrontin - 2 freq apron - 24 freq aforehaun - 7 freq afront - 3 freq aippairently - 1 freq apron-tails - 1 freq abhorrent - 2 freq apprenticed - 1 freq apprenticeship - 8 freq appearantly - 2 freq appearing - 5 freq affruntet - 1 freq affruntit - 2 freq appairintly - 2 freq appearances - 9 freq apperentily - 1 freq auburn - 4 freq afronteet - 1 freq apprehended - 2 freq affrontet - 1 freq abernethy - 3 freq apprehend - 1 freq apprenticeships - 1 freq aforehan - 3 freq apprehensive - 2 freq 'affront' - 1 freq abraham's - 3 freq 'abraham - 1 freq affirmit - 3 freq affeirin - 1 freq apperance - 2 freq afoir'm - 1 freq appairantly - 1 freq a'bærns - 1 freq apprenticeschips - 2 freq affirmin' - 1 freq affirmin - 2 freq apparintly - 1 freq appearan - 2 freq aforehaand - 2 freq afronter - 1 freq affirmation - 1 freq appearently - 7 freq appeirant - 3 freq appeirinly - 1 freq apprehendit - 1 freq afore-haun - 1 freq aperande - 1 freq appearinly - 13 freq appearant - 3 freq appearinlie - 13 freq awfferin - 1 freq afore-mentiount - 1 freq affrontit-like - 1 freq apperandlie - 1 freq aforementioned - 7 freq aforehand - 1 freq apprentices - 4 freq affirmative - 2 freq aapron - 1 freq aboorum - 1 freq aaprons - 1 freq appairent - 1 freq affrontery - 2 freq abhorrence - 1 freq affirmations - 1 freq apern - 1 freq aprons - 1 freq afromanmusic - 1 freq abairnabroad - 1 freq appairentlie - 1 freq awayfromthekeys - 1 freq |
MetaPhone code - AFRHN aforehaan - 1 freq aforehaun - 7 freq aforehan - 3 freq afore-haun - 1 freq |
AFOREHAN |
| Time to execute Levenshtein function - 0.233014 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.397499 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.028464 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.037448 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.000949 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. |