| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hollerin (0) - 2 freq gollerin (1) - 6 freq hollin (2) - 1 freq hoverin (2) - 23 freq callerin (2) - 1 freq howderin (2) - 3 freq hotterin (2) - 15 freq folleyin (2) - 2 freq holler (2) - 2 freq hollered (2) - 5 freq hooerin (2) - 1 freq sillerin (2) - 4 freq bullerin (2) - 1 freq hooverin (2) - 5 freq collin (3) - 2 freq loiterin (3) - 3 freq pooerin (3) - 1 freq hoorin (3) - 3 freq touberin (3) - 1 freq tholepin (3) - 1 freq walterin (3) - 3 freq colourin (3) - 3 freq joinerin (3) - 1 freq hubberin (3) - 1 freq rolleen (3) - 1 freq |
hollerin (0) - 2 freq gollerin (2) - 6 freq sillerin (3) - 4 freq hollered (3) - 5 freq holler (3) - 2 freq callerin (3) - 1 freq bullerin (3) - 1 freq hollin (3) - 1 freq heller (4) - 3 freq holl-an (4) - 1 freq hellery (4) - 3 freq ballerina (4) - 2 freq holburn (4) - 3 freq hallooin (4) - 2 freq hillroun (4) - 1 freq hooerin (4) - 1 freq folleyin (4) - 2 freq howderin (4) - 3 freq hotterin (4) - 15 freq hooverin (4) - 5 freq hoverin (4) - 23 freq voller (5) - 2 freq poller (5) - 1 freq lollopin (5) - 1 freq ollerton (5) - 1 freq |
SoundEx code - H465 hollerin - 2 freq hillroun - 1 freq hulrmalis - 1 freq hilarymcc - 1 freq |
MetaPhone code - HLRN hollerin - 2 freq hillroun - 1 freq |
HOLLERIN |
| Time to execute Levenshtein function - 0.222221 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.396980 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.027431 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.038916 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.001005 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. |