| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| five-year (0) - 1 freq five-star (2) - 1 freq first-year (3) - 5 freq six-year (3) - 1 freq five-flair (3) - 1 freq one-year (3) - 1 freq five-week (3) - 1 freq fower-year (3) - 2 freq seiven-year (3) - 1 freq seven-year (3) - 2 freq iveryday (4) - 4 freq finever (4) - 2 freq fernyear (4) - 5 freq ver-near (4) - 1 freq firever (4) - 4 freq fivver (4) - 4 freq owre-near (4) - 1 freq vernear (4) - 8 freq five-mile (4) - 1 freq fitever (4) - 14 freq thrie-year (4) - 1 freq fidhlear (4) - 1 freq five-quid (4) - 1 freq livelier (4) - 1 freq third-year (4) - 1 freq |
five-year (0) - 1 freq five-star (4) - 1 freq fivver (5) - 4 freq fiver (5) - 46 freq free-er (5) - 1 freq five-o (5) - 1 freq seiven-year (5) - 1 freq seven-year (5) - 2 freq six-year (5) - 1 freq five-flair (5) - 1 freq fower-year (5) - 2 freq one-year (5) - 1 freq five-week (5) - 1 freq fiercer (6) - 1 freq fitwear (6) - 1 freq twa-year (6) - 2 freq forebear (6) - 3 freq filever (6) - 1 freq livener (6) - 1 freq fever (6) - 37 freq freear (6) - 1 freq fyver (6) - 1 freq faivver (6) - 4 freq fooever (6) - 1 freq fite'er (6) - 1 freq |
SoundEx code - F160 favour - 69 freq fiver - 46 freq fever - 37 freq fa-ivver - 2 freq fever' - 1 freq faavour - 1 freq fauvour - 3 freq five-year - 1 freq fibre - 8 freq fyver - 1 freq fyber - 1 freq fooiver - 14 freq fooivver - 2 freq feb'rie - 1 freq faivver - 4 freq fifer - 11 freq faivir - 2 freq faevir - 2 freq fae'iver - 2 freq faaivver - 26 freq 'faaivver - 1 freq fivver - 4 freq faevor - 1 freq fooever - 1 freq fuivvir - 1 freq favor - 1 freq faaiver - 1 freq faiver - 3 freq fyfer - 1 freq faber - 1 freq €œfaaivver - 1 freq faber- - 1 freq €œfaiver - 2 freq €œfooever - 1 freq fapor - 2 freq |
MetaPhone code - FFYR five-year - 1 freq |
FIVE-YEAR |
| Time to execute Levenshtein function - 0.281183 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.430376 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.036478 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.040028 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.000933 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. |