| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harlt (0) - 5 freq hault (1) - 18 freq harit (1) - 1 freq haelt (1) - 3 freq halt (1) - 28 freq haalt (1) - 2 freq harld (1) - 1 freq hart (1) - 28 freq harl (1) - 5 freq hurlt (1) - 3 freq harlit (1) - 2 freq harly (1) - 13 freq marlt (1) - 2 freq hailt (1) - 6 freq harlot (1) - 2 freq hailit (2) - 1 freq salt (2) - 51 freq haunt (2) - 28 freq hawl (2) - 1 freq hark (2) - 15 freq hurt (2) - 119 freq barbt (2) - 1 freq burlt (2) - 1 freq sharet (2) - 3 freq sailt (2) - 2 freq |
harlt (0) - 5 freq hurlt (1) - 3 freq harlit (1) - 2 freq harlot (1) - 2 freq hurlit (2) - 1 freq harl (2) - 5 freq marlt (2) - 2 freq hailt (2) - 6 freq harly (2) - 13 freq haelt (2) - 3 freq hart (2) - 28 freq hault (2) - 18 freq halt (2) - 28 freq harit (2) - 1 freq haalt (2) - 2 freq harld (2) - 1 freq hamlet (3) - 10 freq dirlt (3) - 4 freq pairlt (3) - 1 freq harlie (3) - 6 freq harrot (3) - 3 freq howlt (3) - 1 freq mirlt (3) - 1 freq eurlt (3) - 1 freq harold (3) - 13 freq |
SoundEx code - H643 harled - 6 freq herald - 34 freq hurled - 21 freq hairldy - 1 freq harlot - 2 freq harlit - 2 freq heralded - 2 freq heraldin - 1 freq harald - 17 freq harald's - 2 freq heraldit - 1 freq hurlit - 1 freq harold - 13 freq haerald - 1 freq hurlt - 3 freq heraldic - 2 freq herraldit - 1 freq haroldsgarth - 1 freq harld - 1 freq harlt - 5 freq hurrelt - 1 freq hurl't - 1 freq heraldry - 1 freq herald's - 2 freq heraldscotland - 12 freq harlowtownfc - 1 freq heralds- - 1 freq |
MetaPhone code - HRLT harled - 6 freq herald - 34 freq hurled - 21 freq hairldy - 1 freq harlot - 2 freq harlit - 2 freq harald - 17 freq hurlit - 1 freq harold - 13 freq haerald - 1 freq hurlt - 3 freq harld - 1 freq harlt - 5 freq hurrelt - 1 freq hurl't - 1 freq |
HARLT |
| Time to execute Levenshtein function - 0.219060 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.364909 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.029007 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.041959 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.001074 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. |