Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wellington (0) - 9 freq wellinton (1) - 1 freq willingdon (2) - 2 freq hillington (2) - 2 freq leamington (3) - 1 freq haslington (3) - 1 freq washington (3) - 4 freq islington (3) - 1 freq newington (3) - 3 freq lethington (3) - 4 freq darlington (3) - 1 freq bullingdon (3) - 2 freq warrington (3) - 1 freq kensington (3) - 2 freq remington (3) - 1 freq pennington (3) - 1 freq skellingtons (3) - 1 freq willint (4) - 5 freq linton (4) - 19 freq dwelling (4) - 2 freq haddington (4) - 7 freq pollination (4) - 1 freq releigion (4) - 1 freq covington (4) - 1 freq paddington (4) - 2 freq |
wellington (0) - 9 freq wellinton (2) - 1 freq hillington (3) - 2 freq willingdon (3) - 2 freq bullingdon (5) - 2 freq warrington (5) - 1 freq darlington (5) - 1 freq washington (5) - 4 freq leamington (5) - 1 freq haslington (5) - 1 freq islington (5) - 1 freq wullintly (6) - 1 freq wollaston (6) - 30 freq pollination (6) - 1 freq wullint (6) - 1 freq langton (6) - 1 freq willing (6) - 10 freq willingly (6) - 2 freq kensington (6) - 2 freq lethington (6) - 4 freq newington (6) - 3 freq willint (6) - 5 freq remington (6) - 1 freq skellingtons (6) - 1 freq pennington (6) - 1 freq |
SoundEx code - W452 willans - 1 freq william's - 2 freq williamson - 15 freq weelness' - 1 freq williams - 32 freq williams' - 3 freq willing - 10 freq willingdon - 2 freq weelness - 1 freq walawaying - 1 freq willingness - 6 freq wileness - 1 freq willingly - 2 freq wellington - 9 freq waulliam's - 1 freq walins - 2 freq weelins - 1 freq well-hung - 1 freq €˜wulness - 2 freq wulness - 1 freq wailing - 1 freq walings - 2 freq wullinness - 1 freq williamsbrewery - 2 freq whillans - 1 freq williamcrawley - 1 freq willmackie - 1 freq williamsonkev - 2 freq williemackenzie - 3 freq walunacrew - 2 freq |
MetaPhone code - WLNKTN willingdon - 2 freq wellington - 9 freq |
WELLINGTON |
Time to execute Levenshtein function - 0.233576 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.357956 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.026950 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.038000 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.000858 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. |