| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunnil (0) - 1 freq haunnils (1) - 1 freq caunnil (1) - 1 freq haunnin (1) - 1 freq haunnilt (1) - 1 freq haunil (1) - 1 freq haunnit (1) - 2 freq maunnie (2) - 1 freq hannie (2) - 3 freq haundel (2) - 1 freq hunni (2) - 5 freq haundit (2) - 63 freq hannit (2) - 20 freq hunnul (2) - 4 freq hannin (2) - 3 freq haunlin (2) - 5 freq maunnin (2) - 1 freq haunit (2) - 2 freq caunnils (2) - 1 freq haunlit (2) - 1 freq haunnlin (2) - 1 freq haunin (2) - 7 freq haunel (2) - 3 freq hauntin (2) - 4 freq haundin (2) - 18 freq |
haunnil (0) - 1 freq hunnul (2) - 4 freq haunnle (2) - 7 freq hannel (2) - 1 freq haunnit (2) - 2 freq hunnel (2) - 4 freq hannile (2) - 1 freq haunnin (2) - 1 freq haunnilt (2) - 1 freq haunnils (2) - 1 freq haunil (2) - 1 freq caunnil (2) - 1 freq hunnle (3) - 2 freq haunel (3) - 3 freq haunin (3) - 7 freq hannle (3) - 5 freq haunful (3) - 1 freq haunnlin (3) - 1 freq hantil (3) - 10 freq haunnelt (3) - 1 freq bunnil (3) - 8 freq hannit (3) - 20 freq hannin (3) - 3 freq hunni (3) - 5 freq hannie (3) - 3 freq |
SoundEx code - H540 hamelie - 2 freq hamely - 45 freq hummle - 12 freq haunle - 26 freq hunnul - 4 freq hunnel - 4 freq hunnle - 2 freq hannel - 1 freq hannile - 1 freq hannle - 5 freq hummel - 5 freq homely - 2 freq hæmlie - 1 freq hanle - 4 freq hamnle - 1 freq hummil - 2 freq henley - 1 freq haunil - 1 freq hamley - 1 freq haunnil - 1 freq haunnle - 7 freq hummly - 1 freq haunel - 3 freq haemly - 1 freq hamil - 2 freq humilie - 1 freq hanlo - 1 freq |
MetaPhone code - HNL haunle - 26 freq hunnul - 4 freq hunnel - 4 freq hunnle - 2 freq hannel - 1 freq hannile - 1 freq hannle - 5 freq hanle - 4 freq henley - 1 freq haunil - 1 freq haunnil - 1 freq haunnle - 7 freq haunel - 3 freq hanlo - 1 freq |
HAUNNIL |
| Time to execute Levenshtein function - 0.225916 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.383923 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.034446 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.041246 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.000869 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. |