| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fionnlaigh (0) - 1 freq hin-laigs (4) - 1 freq finnish (4) - 11 freq fionnuala (4) - 3 freq donaidh (5) - 1 freq onslaught (5) - 1 freq granflaith (5) - 2 freq fountain (5) - 17 freq fianna (5) - 1 freq finallie (5) - 1 freq gonnag (5) - 1 freq conlig (5) - 2 freq t-sionnaich (5) - 1 freq fountains (5) - 8 freq inglish (5) - 156 freq fingla's (5) - 1 freq connaught (5) - 1 freq fiona (5) - 42 freq finnie (5) - 1 freq fionasnp (5) - 1 freq oonagh (5) - 3 freq kinnaird (5) - 1 freq finndin (5) - 11 freq dounlaid (5) - 1 freq finalise (5) - 2 freq |
fionnlaigh (0) - 1 freq finnish (6) - 11 freq fionnuala (6) - 3 freq finng (7) - 1 freq hin-laigs (7) - 1 freq idlaugh (8) - 1 freq findlay (8) - 19 freq kinnlin (8) - 10 freq laigh (8) - 15 freq finnins (8) - 1 freq finish (8) - 76 freq finlay (8) - 18 freq finnger (8) - 6 freq finnin (8) - 40 freq foilage (8) - 1 freq finlayp (8) - 1 freq lannlaird (8) - 1 freq foolish (8) - 4 freq finland (8) - 7 freq funning (8) - 1 freq flaigs (8) - 1 freq funnily (8) - 6 freq finngerie (8) - 1 freq finnegan (8) - 21 freq finola (8) - 3 freq |
SoundEx code - F542 faimilies - 43 freq faimly's - 3 freq finlay's - 2 freq funnels - 4 freq finalise - 2 freq funny-like - 2 freq faimlies - 47 freq families - 30 freq faimily's - 8 freq faimiles - 2 freq fine-luikin - 1 freq femlie's - 1 freq finals - 7 freq finalised - 2 freq fine-lookin - 2 freq finelookin - 1 freq family's - 3 freq femlies - 2 freq females' - 1 freq funny-lukkan - 1 freq femmels - 1 freq final-stage - 1 freq fenella's - 2 freq femmelies - 1 freq fummles - 2 freq faimlie's - 1 freq females - 9 freq finalists - 1 freq fammils - 1 freq fionnlaigh - 1 freq finlayson - 1 freq femlees - 1 freq fine-lik - 1 freq fmwales - 1 freq fnlz - 1 freq |
MetaPhone code - FNLF fionnlaigh - 1 freq |
FIONNLAIGH |
| Time to execute Levenshtein function - 0.343732 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.606634 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.038245 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.050054 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.001163 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. |