| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hillington (0) - 2 freq wellington (2) - 9 freq willingdon (2) - 2 freq haslington (2) - 1 freq islington (2) - 1 freq hilligo (3) - 1 freq darlington (3) - 1 freq bullingdon (3) - 2 freq wellinton (3) - 1 freq haddington (3) - 7 freq pennington (4) - 1 freq houliston (4) - 2 freq pollination (4) - 1 freq hilltoun (4) - 7 freq killingeve (4) - 1 freq hallion (4) - 16 freq shillings (4) - 4 freq milligan (4) - 4 freq dillion (4) - 3 freq billingual (4) - 1 freq willing (4) - 10 freq million (4) - 156 freq killings (4) - 2 freq leamington (4) - 1 freq hilltoon (4) - 1 freq |
hillington (0) - 2 freq haslington (3) - 1 freq wellington (3) - 9 freq willingdon (4) - 2 freq islington (4) - 1 freq wellinton (5) - 1 freq haddington (5) - 7 freq darlington (5) - 1 freq bullingdon (5) - 2 freq langton (6) - 1 freq leamington (6) - 1 freq hilltoon (6) - 1 freq halliburton (6) - 1 freq hilltoun (6) - 7 freq pollination (6) - 1 freq hilligo (6) - 1 freq pilling (7) - 1 freq torrington (7) - 2 freq hilltop (7) - 4 freq fillings (7) - 2 freq colinton (7) - 1 freq hilton (7) - 2 freq shilling (7) - 4 freq collieston (7) - 1 freq abevington (7) - 1 freq |
SoundEx code - H452 hielans - 17 freq haliness - 2 freq helms - 2 freq holmes - 16 freq holms - 8 freq h'lang - 4 freq healins - 1 freq hauling - 1 freq helen's - 3 freq howling - 3 freq holiness - 1 freq hillington - 2 freq hallions - 51 freq heilans - 8 freq heilins - 1 freq healing - 7 freq hollowness - 1 freq helensburgh - 3 freq hell-makers - 1 freq hallowmas - 1 freq helmstock - 1 freq halieness - 1 freq hallanshakar - 1 freq hallans - 1 freq halloweens - 2 freq hallanshackers - 1 freq haleness - 1 freq hallaeen's - 1 freq hellomag - 1 freq hlmcidm - 1 freq hollyhnews - 1 freq helenmcclements - 1 freq |
MetaPhone code - HLNKTN hillington - 2 freq |
HILLINGTON |
| Time to execute Levenshtein function - 0.333152 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.572757 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.032604 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.047089 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.001054 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. |