An integer value that is the maximum number of steps used to convert the misspelled word into the suggested one.
The Levenshtein distance is the minimum number of operations needed to transform one string into another, where the operation is an insertion, deletion, or substitution of a single character. The spell checker engine calculates this distance when creating a suggestion list. For each suggestion, it is available by the SuggestionBase.Distance property.
This parameter specifies the maximum allowed value of the distance, and has an effect on the number of suggested words and their order.