| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heyfield (0) - 3 freq heyfields (1) - 1 freq hayfield (1) - 3 freq enfield (2) - 7 freq mayfield (2) - 4 freq seafield (2) - 7 freq sheffield (2) - 3 freq renfield (2) - 2 freq hadfield (2) - 4 freq maryfield (3) - 1 freq hoofjeld (3) - 1 freq nuffield (3) - 3 freq shawfield (3) - 1 freq enfields (3) - 1 freq afield (3) - 8 freq midfield (3) - 18 freq herried (3) - 4 freq defied (3) - 5 freq ehield (3) - 1 freq hefted (3) - 24 freq field (3) - 230 freq ootfield (3) - 1 freq heathfield (3) - 1 freq lea-field (3) - 1 freq yield (3) - 16 freq |
heyfield (0) - 3 freq hayfield (1) - 3 freq heyfields (2) - 1 freq hadfield (3) - 4 freq seafield (3) - 7 freq mayfield (3) - 4 freq enfield (3) - 7 freq ootfield (4) - 1 freq field (4) - 230 freq hefted (4) - 24 freq heild (4) - 48 freq ehield (4) - 1 freq heeld (4) - 2 freq afield (4) - 8 freq sheffield (4) - 3 freq renfield (4) - 2 freq hoofjeld (4) - 1 freq aefauld (5) - 19 freq heeled (5) - 1 freq feild (5) - 1 freq hoofed (5) - 3 freq heiled (5) - 1 freq held (5) - 509 freq herald (5) - 34 freq huffed (5) - 3 freq |
SoundEx code - H143 hauf-lit - 4 freq hibbled - 1 freq hayfield - 3 freq heyfields - 1 freq hippolytus - 2 freq hability - 2 freq hobbled - 2 freq hippolyta's - 2 freq hippolyta - 5 freq hoplites - 1 freq hauf-leid - 1 freq haploidy - 1 freq haplodiploidy - 1 freq habeilitie - 1 freq hee-bluidy-haw - 1 freq hauf-bauld - 1 freq heyfield - 3 freq hie-politics - 1 freq hpelud - 1 freq |
MetaPhone code - HFLT hauf-lit - 4 freq hayfield - 3 freq highlight - 16 freq hauf-leid - 1 freq heyfield - 3 freq |
HEYFIELD |
| Time to execute Levenshtein function - 0.462614 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.501949 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.028739 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.040377 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.005910 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. |