| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ancestor (0) - 16 freq ancestor- (1) - 1 freq ancestors (1) - 54 freq accentor (2) - 1 freq ancentors (2) - 1 freq ancestry (2) - 6 freq ancestirs (2) - 1 freq ancestor's (2) - 1 freq asbestos (3) - 9 freq lancaster (3) - 3 freq an-soor (3) - 1 freq sneester (3) - 3 freq accessors (3) - 1 freq forestor (3) - 1 freq incest (3) - 3 freq manchester (3) - 10 freq anchor (3) - 28 freq investors (3) - 2 freq ancestral (3) - 14 freq 'castor (3) - 1 freq hestor (3) - 1 freq actor (3) - 19 freq castor (3) - 3 freq anderston (3) - 1 freq inventor (3) - 6 freq |
ancestor (0) - 16 freq ancestor- (2) - 1 freq ancestors (2) - 54 freq ancestry (2) - 6 freq ancestirs (3) - 1 freq incest (4) - 3 freq castor (4) - 3 freq 'castor (4) - 1 freq ancestral (4) - 14 freq lancaster (4) - 3 freq ancentors (4) - 1 freq accentor (4) - 1 freq ancestor's (4) - 1 freq inkster (5) - 1 freq uncast (5) - 1 freq necessar (5) - 88 freq oncost (5) - 1 freq incestuous (5) - 1 freq coster (5) - 1 freq ainster (5) - 2 freq incubator (5) - 1 freq enster (5) - 2 freq caster (5) - 2 freq nectar (5) - 9 freq accusatour (5) - 1 freq |
SoundEx code - A522 anxiously - 38 freq anxious - 54 freq anzacs - 1 freq anguished - 2 freq angus - 117 freq ancestor - 16 freq ancestral - 14 freq anguish - 4 freq anzac - 1 freq ancus - 2 freq ancestors - 54 freq ancestor's - 1 freq ang'uish - 1 freq anxious-lookin - 1 freq anxious-wye - 1 freq amazes - 3 freq ancestirs - 1 freq ancestry - 6 freq angicised - 1 freq aneuch's - 1 freq ah'mjist - 1 freq angusglens - 1 freq aonghas - 1 freq ane-saxt - 1 freq amigos - 2 freq ane-question - 1 freq ancestrial - 1 freq ancestor-warld - 1 freq ankshis - 2 freq angusmacneilsnp - 15 freq ancestor- - 1 freq anyexcuseforanip - 1 freq angusrobertson - 1 freq angiesliverpool - 2 freq aonghasmacleoid - 1 freq |
MetaPhone code - ANSSTR ancestor - 16 freq ancestry - 6 freq ancestor- - 1 freq |
ANCESTOR |
| Time to execute Levenshtein function - 0.178756 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.343708 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.027254 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.036886 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.000848 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. |