Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
polaris (0) - 3 freq paris (2) - 52 freq polis (2) - 264 freq poplars (2) - 2 freq palais (2) - 2 freq polarised (2) - 1 freq pollis (2) - 4 freq polar (2) - 24 freq polaroid (2) - 1 freq polaties (2) - 1 freq poalis (2) - 1 freq polatie (2) - 1 freq poltis (2) - 1 freq polarisin (2) - 1 freq cooards (3) - 2 freq politics (3) - 161 freq pouer's (3) - 1 freq pillars (3) - 12 freq poles (3) - 30 freq plaids (3) - 5 freq apolagise (3) - 1 freq glamis (3) - 6 freq norris (3) - 1 freq towards (3) - 170 freq poplar (3) - 1 freq |
polaris (0) - 3 freq polaroid (3) - 1 freq polaties (3) - 1 freq polarisin (3) - 1 freq polar (3) - 24 freq poltis (3) - 1 freq poalis (3) - 1 freq pollis (3) - 4 freq paris (3) - 52 freq poplars (3) - 2 freq polis (3) - 264 freq polarised (3) - 1 freq palais (3) - 2 freq belarus (4) - 3 freq pores (4) - 5 freq peelers (4) - 7 freq palates (4) - 1 freq caloris (4) - 2 freq plays (4) - 129 freq pours (4) - 7 freq pedlars (4) - 1 freq plaise (4) - 10 freq planes (4) - 19 freq lars (4) - 1 freq pareis (4) - 1 freq |
SoundEx code - P462 players - 152 freq pleywrights - 6 freq pleywright - 2 freq playwricht - 4 freq pillars - 12 freq playwright - 3 freq playwrights - 3 freq pillers - 2 freq peelers - 7 freq pleyers - 7 freq pliers - 2 freq polaris - 3 freq playwrichts - 6 freq player's - 1 freq polarisin - 1 freq pluricentric - 1 freq paullawriegolf - 4 freq polarised - 1 freq paulharris - 3 freq philharrison - 1 freq |
MetaPhone code - PLRS pillars - 12 freq pillers - 2 freq peelers - 7 freq pliers - 2 freq polaris - 3 freq |
POLARIS |
Time to execute Levenshtein function - 0.189117 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.411810 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.027534 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.037991 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.000939 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. |