| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halliget (0) - 1 freq hallie (2) - 1 freq hallibit (2) - 1 freq hallies (2) - 1 freq haliket (2) - 2 freq allege (3) - 1 freq allied (3) - 3 freq haltit (3) - 3 freq hillies (3) - 11 freq hallowit (3) - 1 freq yallit (3) - 1 freq hilligo (3) - 1 freq vallies (3) - 1 freq haalage (3) - 1 freq hailie (3) - 9 freq haalie (3) - 1 freq lallie (3) - 1 freq allies (3) - 8 freq wallies (3) - 16 freq hillie (3) - 1 freq ballet (3) - 4 freq hailit (3) - 1 freq haliglen (3) - 1 freq halleve (3) - 2 freq wallet (3) - 23 freq |
halliget (0) - 1 freq hallibit (3) - 1 freq hilligo (4) - 1 freq walligate (4) - 1 freq hallowit (4) - 1 freq hallies (4) - 1 freq haliket (4) - 2 freq hallie (4) - 1 freq hollieb (5) - 4 freq hallaed (5) - 1 freq falloet (5) - 2 freq halle (5) - 4 freq hajget (5) - 1 freq pallet (5) - 3 freq halled (5) - 2 freq haillie (5) - 8 freq hallowed (5) - 4 freq halliday (5) - 1 freq hallowe (5) - 1 freq hallis (5) - 1 freq hallaeen (5) - 12 freq harlit (5) - 1 freq haglet (5) - 1 freq hallions (5) - 51 freq callit (5) - 3 freq |
SoundEx code - H423 hailsteens - 5 freq hailstanes - 2 freq heelster-gowdie - 6 freq hallockit - 7 freq heelster-gowdle - 1 freq hillside - 15 freq hillsides - 2 freq hilshed - 1 freq holiest - 2 freq holstered - 1 freq helcht - 1 freq halikit - 1 freq halakit - 1 freq heelstergoudie - 1 freq holistic - 4 freq hailstane - 1 freq haliket - 2 freq holo-exit - 3 freq heelster - 2 freq heelstergowdie - 7 freq 'hillside' - 1 freq hailsed - 2 freq hielichts - 1 freq hielicht - 3 freq hie-liggit - 1 freq hallstaan - 1 freq houliston - 2 freq halliget - 1 freq hailsteen - 1 freq hulsyde - 1 freq hulstert - 1 freq hailstones - 1 freq hailstone - 1 freq hielichtit - 1 freq heelichts - 1 freq hailsteenes - 1 freq |
MetaPhone code - HLJT halliget - 1 freq |
HALLIGET |
| Time to execute Levenshtein function - 0.219107 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.350942 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.027294 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.036660 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. |