r than <code class="code">cutoff</code>, it returns <code class="code"><span class="constructor">Some</span> d</code>, else
    <code class="code"><span class="constructor">None</span></code>.
<p>

    The distance algorithm currently used is Damerau-Levenshtein: it
    computes the number of insertion, deletion, substitution of
    letters, or swapping of adjacent letters to go from one word to the
    other. The particular algorithm may change in the future.<br>
</p></div>

<pre><span id="VALspellcheck"><