| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| finals (0) - 7 freq final (1) - 166 freq finale (1) - 4 freq finds (2) - 39 freq fings (2) - 10 freq fingrs (2) - 1 freq einas (2) - 1 freq finces (2) - 1 freq fingle (2) - 1 freq fins (2) - 1 freq fin'al (2) - 1 freq finhall (2) - 22 freq faals (2) - 1 freq nibals (2) - 1 freq finalise (2) - 2 freq fiona's (2) - 1 freq annals (2) - 5 freq finola (2) - 3 freq dina's (2) - 3 freq tials (2) - 1 freq ipals (2) - 1 freq inas (2) - 1 freq rivals (2) - 3 freq ina's (2) - 1 freq canals (2) - 3 freq |
finals (0) - 7 freq finalise (2) - 2 freq final (2) - 166 freq finale (2) - 4 freq fals (3) - 1 freq foals (3) - 4 freq fiels (3) - 23 freq fills (3) - 36 freq fines (3) - 7 freq finally (3) - 306 freq fynaly (3) - 3 freq finely (3) - 3 freq finns (3) - 1 freq fins (3) - 37 freq finks (3) - 5 freq canals (3) - 3 freq fin's (3) - 1 freq nals (3) - 1 freq fiona's (3) - 1 freq finces (3) - 1 freq faals (3) - 1 freq fings (3) - 10 freq annals (3) - 5 freq finola (3) - 3 freq finds (3) - 39 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 - FNLS finlay's - 2 freq vennels - 12 freq funnels - 4 freq finalise - 2 freq finals - 7 freq fenella's - 2 freq fnlz - 1 freq |
FINALS |
| Time to execute Levenshtein function - 0.227204 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.398559 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.027693 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.040872 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.001294 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. |