| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| firby (0) - 1 freq kirby (1) - 3 freq furby (1) - 29 freq forby (1) - 491 freq firbye (1) - 29 freq firey (1) - 2 freq girmy (2) - 1 freq firmly (2) - 41 freq fairy (2) - 75 freq airty (2) - 1 freq airy (2) - 4 freq firr (2) - 2 freq fibo (2) - 1 freq fizzy (2) - 13 freq mirly (2) - 1 freq firm (2) - 67 freq fidgy (2) - 1 freq neirby (2) - 4 freq firct (2) - 1 freq wirey (2) - 1 freq fitly (2) - 1 freq girly (2) - 1 freq fire' (2) - 2 freq fray (2) - 10 freq farty (2) - 1 freq |
firby (0) - 1 freq firbye (1) - 29 freq forby (1) - 491 freq furby (1) - 29 freq furbye (2) - 6 freq foreby (2) - 2 freq forbye (2) - 427 freq kirby (2) - 3 freq firey (2) - 2 freq fairly (3) - 233 freq derby (3) - 13 freq firs (3) - 6 freq fury (3) - 31 freq fiery (3) - 27 freq fire (3) - 699 freq fib (3) - 3 freq fired (3) - 59 freq furly (3) - 10 freq foray (3) - 1 freq kerby (3) - 2 freq fitba (3) - 314 freq fry (3) - 37 freq firin (3) - 29 freq firse (3) - 1 freq firra (3) - 1 freq |
SoundEx code - F610 far-off - 3 freq forbye - 427 freq forby - 491 freq faur-aff - 10 freq furbye - 6 freq 'forby - 1 freq fearfu - 14 freq firbye - 29 freq furby - 29 freq 'forbye - 3 freq forbye' - 1 freq fearfa - 1 freq forebye - 59 freq fearfou - 1 freq foreby - 2 freq frapp - 1 freq firby - 1 freq far-aff - 6 freq fearfae - 1 freq fairfaw - 1 freq freebee - 1 freq forbye- - 1 freq freebie - 2 freq €œforby - 1 freq €œforbye - 1 freq for-bye - 2 freq €˜forby - 1 freq forbae - 1 freq furv - 1 freq fairfaaye - 11 freq freeview - 1 freq |
MetaPhone code - FRB forby - 491 freq 'forby - 1 freq furby - 29 freq foreby - 2 freq verb - 129 freq verb' - 1 freq firby - 1 freq freebee - 1 freq freebie - 2 freq €œforby - 1 freq €˜forby - 1 freq forbae - 1 freq |
FIRBY |
| Time to execute Levenshtein function - 0.209799 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.368337 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.027367 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.037551 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.000873 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. |