On the Size of the Neighborhoods of a Word.

The $d$-neighborhood of a word $w$ in the Levenshtein distance is the set of all words at distance at most $d$ from $w$. Generating the neighborhood of a word $w$, or related sets of words such as the condensed neighborhood or the super-condensed nei…

Preview only. Read the full abstract at the source