| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halabi (0) - 1 freq hlai (2) - 1 freq halakit (2) - 1 freq alibi (2) - 2 freq arabi (2) - 1 freq malawi (2) - 5 freq alab (2) - 1 freq hallabie (2) - 1 freq dalai (2) - 2 freq hawaii (2) - 5 freq haley (3) - 1 freq caai (3) - 1 freq alamo (3) - 2 freq h'lang (3) - 4 freq haled (3) - 1 freq hallie (3) - 1 freq halt (3) - 28 freq jalaw (3) - 1 freq haalt (3) - 2 freq halibut (3) - 5 freq haad (3) - 71 freq haka (3) - 1 freq 'abi (3) - 1 freq haalage (3) - 1 freq alaek (3) - 2 freq |
halabi (0) - 1 freq holby (3) - 4 freq alab (3) - 1 freq hallabie (3) - 1 freq hlai (3) - 1 freq alibi (3) - 2 freq half (4) - 539 freq haalie (4) - 1 freq hairb (4) - 1 freq haall (4) - 11 freq hall (4) - 190 freq alba (4) - 75 freq habbie (4) - 9 freq haal (4) - 42 freq helli (4) - 2 freq haleve (4) - 1 freq salbe (4) - 7 freq halve (4) - 1 freq hales (4) - 1 freq halin (4) - 1 freq hela (4) - 1 freq heli (4) - 3 freq hijab (4) - 2 freq lab (4) - 29 freq slab (4) - 32 freq |
SoundEx code - H410 help - 1140 freq half - 539 freq half-wey - 1 freq 'help - 19 freq helluva - 25 freq 'half - 2 freq helpfu - 21 freq halleve - 2 freq helf - 2 freq haulf - 4 freq halfway - 7 freq holby - 4 freq halp - 54 freq halfwye - 1 freq half-wye - 1 freq 'helpfae' - 1 freq helpfae - 1 freq halfa - 2 freq 'help' - 1 freq halpfu - 1 freq hlf - 2 freq helpfu' - 2 freq 'half-awa' - 1 freq 'half-awa - 1 freq half-awa - 2 freq €˜help - 2 freq €˜halp - 1 freq hallabie - 1 freq €œhelp - 3 freq hylop - 1 freq h-alba - 2 freq €˜half - 1 freq halve - 1 freq hellova - 2 freq haleve - 1 freq halabi - 1 freq hlv - 1 freq hollieb - 4 freq |
MetaPhone code - HLB holby - 4 freq hallabie - 1 freq halabi - 1 freq hollieb - 4 freq |
HALABI |
| Time to execute Levenshtein function - 0.236368 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.402941 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.031157 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.038337 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.001010 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. |