| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hainins (0) - 1 freq haining (1) - 6 freq hainin (1) - 20 freq hairns (2) - 8 freq railins (2) - 22 freq haivin (2) - 3 freq hainit (2) - 6 freq hawkins (2) - 3 freq wairnins (2) - 1 freq fairins (2) - 7 freq rainin (2) - 41 freq ailins (2) - 1 freq linins (2) - 1 freq happins (2) - 3 freq gainin (2) - 11 freq havins (2) - 1 freq pailins (2) - 4 freq hairin (2) - 3 freq earnins (2) - 4 freq haivens (2) - 2 freq haitin (2) - 7 freq hannin (2) - 3 freq failins (2) - 1 freq haudins (2) - 4 freq mainin (2) - 3 freq |
hainins (0) - 1 freq hanns (2) - 23 freq hainin (2) - 20 freq hannies (2) - 3 freq haining (2) - 6 freq heidins (3) - 1 freq heivins (3) - 2 freq haudins (3) - 4 freq hanlins (3) - 1 freq haanin (3) - 1 freq hains (3) - 5 freq haines (3) - 1 freq hingins (3) - 4 freq hinnies (3) - 6 freq hennis (3) - 1 freq hidins (3) - 1 freq hunnies (3) - 1 freq heilins (3) - 1 freq hannin (3) - 3 freq haunin (3) - 7 freq haevins (3) - 1 freq earnins (3) - 4 freq hairns (3) - 8 freq haivens (3) - 2 freq linins (3) - 1 freq |
SoundEx code - H552 hainins - 1 freq humans - 55 freq humankind - 5 freq haining - 6 freq humankin - 2 freq hemingway - 4 freq hoymansquoy - 1 freq hummingbird - 1 freq hinemaist - 1 freq homemaker - 1 freq €œhumans - 1 freq humming - 3 freq humongesest - 1 freq humansafari - 3 freq henningwehn - 1 freq |
MetaPhone code - HNNS hainins - 1 freq |
HAININS |
| Time to execute Levenshtein function - 0.200038 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.421924 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.032269 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.047290 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.001360 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. |