You are viewing a plain text version of this content. The canonical link for it is here.
Posted to notifications@commons.apache.org by br...@apache.org on 2015/03/01 13:14:31 UTC
svn commit: r941823 [21/21] - in
/websites/production/commons/content/sandbox/commons-text: ./ apidocs/
apidocs/org/apache/commons/text/diff/
apidocs/org/apache/commons/text/diff/class-use/
apidocs/org/apache/commons/text/similarity/ apidocs/org/apache...
Modified: websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/LevenshteinDistance.html
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/LevenshteinDistance.html (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/LevenshteinDistance.html Sun Mar 1 12:14:29 2015
@@ -27,245 +27,233 @@
<a class="jxr_linenumber" name="L19" href="#L19">19</a> <strong class="jxr_keyword">import</strong> java.util.Arrays;
<a class="jxr_linenumber" name="L20" href="#L20">20</a>
<a class="jxr_linenumber" name="L21" href="#L21">21</a> <em class="jxr_javadoccomment">/**</em>
-<a class="jxr_linenumber" name="L22" href="#L22">22</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L23" href="#L23">23</a> <em class="jxr_javadoccomment"> * A string metric for measuring the difference between two sequences.</em>
-<a class="jxr_linenumber" name="L24" href="#L24">24</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L25" href="#L25">25</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L26" href="#L26">26</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L27" href="#L27">27</a> <em class="jxr_javadoccomment"> * This code has been adapted from Apache Commons Lang 3.3.</em>
+<a class="jxr_linenumber" name="L22" href="#L22">22</a> <em class="jxr_javadoccomment"> * An algorithm for measuring the difference between two character sequences.</em>
+<a class="jxr_linenumber" name="L23" href="#L23">23</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L24" href="#L24">24</a> <em class="jxr_javadoccomment"> * <p></em>
+<a class="jxr_linenumber" name="L25" href="#L25">25</a> <em class="jxr_javadoccomment"> * This is the number of changes needed to change one sequence into another,</em>
+<a class="jxr_linenumber" name="L26" href="#L26">26</a> <em class="jxr_javadoccomment"> * where each change is a single character modification (deletion, insertion</em>
+<a class="jxr_linenumber" name="L27" href="#L27">27</a> <em class="jxr_javadoccomment"> * or substitution).</em>
<a class="jxr_linenumber" name="L28" href="#L28">28</a> <em class="jxr_javadoccomment"> * </p></em>
<a class="jxr_linenumber" name="L29" href="#L29">29</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L30" href="#L30">30</a> <em class="jxr_javadoccomment"> * @since 1.0</em>
-<a class="jxr_linenumber" name="L31" href="#L31">31</a> <em class="jxr_javadoccomment"> */</em>
-<a class="jxr_linenumber" name="L32" href="#L32">32</a> <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">class</strong> <a href="../../../../../org/apache/commons/text/similarity/LevenshteinDistance.html">LevenshteinDistance</a> <strong class="jxr_keyword">implements</strong> StringMetric<Integer> {
-<a class="jxr_linenumber" name="L33" href="#L33">33</a>
-<a class="jxr_linenumber" name="L34" href="#L34">34</a> <em class="jxr_javadoccomment">/**</em>
-<a class="jxr_linenumber" name="L35" href="#L35">35</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L36" href="#L36">36</a> <em class="jxr_javadoccomment"> * Find the Levenshtein distance between two Strings.</em>
-<a class="jxr_linenumber" name="L37" href="#L37">37</a> <em class="jxr_javadoccomment"> * </p></em>
+<a class="jxr_linenumber" name="L30" href="#L30">30</a> <em class="jxr_javadoccomment"> * <p></em>
+<a class="jxr_linenumber" name="L31" href="#L31">31</a> <em class="jxr_javadoccomment"> * This code has been adapted from Apache Commons Lang 3.3.</em>
+<a class="jxr_linenumber" name="L32" href="#L32">32</a> <em class="jxr_javadoccomment"> * </p></em>
+<a class="jxr_linenumber" name="L33" href="#L33">33</a> <em class="jxr_javadoccomment"> */</em>
+<a class="jxr_linenumber" name="L34" href="#L34">34</a> <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">class</strong> <a href="../../../../../org/apache/commons/text/similarity/LevenshteinDistance.html">LevenshteinDistance</a> <strong class="jxr_keyword">implements</strong> StringMetric<Integer> {
+<a class="jxr_linenumber" name="L35" href="#L35">35</a>
+<a class="jxr_linenumber" name="L36" href="#L36">36</a> <em class="jxr_javadoccomment">/**</em>
+<a class="jxr_linenumber" name="L37" href="#L37">37</a> <em class="jxr_javadoccomment"> * Find the Levenshtein distance between two Strings.</em>
<a class="jxr_linenumber" name="L38" href="#L38">38</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L39" href="#L39">39</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L40" href="#L40">40</a> <em class="jxr_javadoccomment"> * This is the number of changes needed to change one String into another,</em>
-<a class="jxr_linenumber" name="L41" href="#L41">41</a> <em class="jxr_javadoccomment"> * where each change is a single character modification (deletion, insertion</em>
-<a class="jxr_linenumber" name="L42" href="#L42">42</a> <em class="jxr_javadoccomment"> * or substitution).</em>
-<a class="jxr_linenumber" name="L43" href="#L43">43</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L44" href="#L44">44</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L45" href="#L45">45</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L46" href="#L46">46</a> <em class="jxr_javadoccomment"> * The previous implementation of the Levenshtein distance algorithm was</em>
-<a class="jxr_linenumber" name="L47" href="#L47">47</a> <em class="jxr_javadoccomment"> * from <a</em>
-<a class="jxr_linenumber" name="L48" href="#L48">48</a> <em class="jxr_javadoccomment"> * href="<a href="http://www.merriampark.com/ld.htm" target="alexandria_uri">http://www.merriampark.com/ld.htm</a>">http://www.merriampark.com</em>
-<a class="jxr_linenumber" name="L49" href="#L49">49</a> <em class="jxr_javadoccomment"> * /ld.htm</a></em>
-<a class="jxr_linenumber" name="L50" href="#L50">50</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L51" href="#L51">51</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L52" href="#L52">52</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L53" href="#L53">53</a> <em class="jxr_javadoccomment"> * Chas Emerick has written an implementation in Java, which avoids an</em>
-<a class="jxr_linenumber" name="L54" href="#L54">54</a> <em class="jxr_javadoccomment"> * OutOfMemoryError which can occur when my Java implementation is used with</em>
-<a class="jxr_linenumber" name="L55" href="#L55">55</a> <em class="jxr_javadoccomment"> * very large strings.<br></em>
-<a class="jxr_linenumber" name="L56" href="#L56">56</a> <em class="jxr_javadoccomment"> * This implementation of the Levenshtein distance algorithm is from <a</em>
-<a class="jxr_linenumber" name="L57" href="#L57">57</a> <em class="jxr_javadoccomment"> * href="<a href="http://www.merriampark.com/ldjava.htm" target="alexandria_uri">http://www.merriampark.com/ldjava.htm</a>">http://www.merriampark.com/</em>
-<a class="jxr_linenumber" name="L58" href="#L58">58</a> <em class="jxr_javadoccomment"> * ldjava.htm</a></em>
-<a class="jxr_linenumber" name="L59" href="#L59">59</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L60" href="#L60">60</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L61" href="#L61">61</a> <em class="jxr_javadoccomment"> * <pre></em>
-<a class="jxr_linenumber" name="L62" href="#L62">62</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance(null, *) = IllegalArgumentException</em>
-<a class="jxr_linenumber" name="L63" href="#L63">63</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance(*, null) = IllegalArgumentException</em>
-<a class="jxr_linenumber" name="L64" href="#L64">64</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("","") = 0</em>
-<a class="jxr_linenumber" name="L65" href="#L65">65</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("","a") = 1</em>
-<a class="jxr_linenumber" name="L66" href="#L66">66</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("aaapppp", "") = 7</em>
-<a class="jxr_linenumber" name="L67" href="#L67">67</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("frog", "fog") = 1</em>
-<a class="jxr_linenumber" name="L68" href="#L68">68</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("fly", "ant") = 3</em>
-<a class="jxr_linenumber" name="L69" href="#L69">69</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("elephant", "hippo") = 7</em>
-<a class="jxr_linenumber" name="L70" href="#L70">70</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("hippo", "elephant") = 7</em>
-<a class="jxr_linenumber" name="L71" href="#L71">71</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("hippo", "zzzzzzzz") = 8</em>
-<a class="jxr_linenumber" name="L72" href="#L72">72</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("hello", "hallo") = 1</em>
-<a class="jxr_linenumber" name="L73" href="#L73">73</a> <em class="jxr_javadoccomment"> * </pre></em>
-<a class="jxr_linenumber" name="L74" href="#L74">74</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L75" href="#L75">75</a> <em class="jxr_javadoccomment"> * @param left the first string, must not be null</em>
-<a class="jxr_linenumber" name="L76" href="#L76">76</a> <em class="jxr_javadoccomment"> * @param right the second string, must not be null</em>
-<a class="jxr_linenumber" name="L77" href="#L77">77</a> <em class="jxr_javadoccomment"> * @return result distance</em>
-<a class="jxr_linenumber" name="L78" href="#L78">78</a> <em class="jxr_javadoccomment"> * @throws IllegalArgumentException if either String input {@code null}</em>
-<a class="jxr_linenumber" name="L79" href="#L79">79</a> <em class="jxr_javadoccomment"> */</em>
-<a class="jxr_linenumber" name="L80" href="#L80">80</a> @Override
-<a class="jxr_linenumber" name="L81" href="#L81">81</a> <strong class="jxr_keyword">public</strong> Integer compare(CharSequence left, CharSequence right) {
-<a class="jxr_linenumber" name="L82" href="#L82">82</a> <strong class="jxr_keyword">return</strong> compare(left, right, Integer.MAX_VALUE);
-<a class="jxr_linenumber" name="L83" href="#L83">83</a> }
-<a class="jxr_linenumber" name="L84" href="#L84">84</a>
-<a class="jxr_linenumber" name="L85" href="#L85">85</a> <em class="jxr_javadoccomment">/**</em>
-<a class="jxr_linenumber" name="L86" href="#L86">86</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L87" href="#L87">87</a> <em class="jxr_javadoccomment"> * Find the Levenshtein distance between two Strings if it's less than or</em>
-<a class="jxr_linenumber" name="L88" href="#L88">88</a> <em class="jxr_javadoccomment"> * equal to a given threshold.</em>
-<a class="jxr_linenumber" name="L89" href="#L89">89</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L90" href="#L90">90</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L91" href="#L91">91</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L92" href="#L92">92</a> <em class="jxr_javadoccomment"> * This is the number of changes needed to change one String into another,</em>
-<a class="jxr_linenumber" name="L93" href="#L93">93</a> <em class="jxr_javadoccomment"> * where each change is a single character modification (deletion, insertion</em>
-<a class="jxr_linenumber" name="L94" href="#L94">94</a> <em class="jxr_javadoccomment"> * or substitution).</em>
-<a class="jxr_linenumber" name="L95" href="#L95">95</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L96" href="#L96">96</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L97" href="#L97">97</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L98" href="#L98">98</a> <em class="jxr_javadoccomment"> * This implementation follows from Algorithms on Strings, Trees and</em>
-<a class="jxr_linenumber" name="L99" href="#L99">99</a> <em class="jxr_javadoccomment"> * Sequences by Dan Gusfield and Chas Emerick's implementation of the</em>
-<a class="jxr_linenumber" name="L100" href="#L100">100</a> <em class="jxr_javadoccomment"> * Levenshtein distance algorithm from <a</em>
-<a class="jxr_linenumber" name="L101" href="#L101">101</a> <em class="jxr_javadoccomment"> * href="<a href="http://www.merriampark.com/ld.htm" target="alexandria_uri">http://www.merriampark.com/ld.htm</a>"</em>
-<a class="jxr_linenumber" name="L102" href="#L102">102</a> <em class="jxr_javadoccomment"> * ><a href="http://www.merriampark.com/ld.htm</a>" target="alexandria_uri">http://www.merriampark.com/ld.htm</a></a>;</em>
-<a class="jxr_linenumber" name="L103" href="#L103">103</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L104" href="#L104">104</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L105" href="#L105">105</a> <em class="jxr_javadoccomment"> * <pre></em>
-<a class="jxr_linenumber" name="L106" href="#L106">106</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance(null, *, *) = IllegalArgumentException</em>
-<a class="jxr_linenumber" name="L107" href="#L107">107</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance(*, null, *) = IllegalArgumentException</em>
-<a class="jxr_linenumber" name="L108" href="#L108">108</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance(*, *, -1) = IllegalArgumentException</em>
-<a class="jxr_linenumber" name="L109" href="#L109">109</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("","", 0) = 0</em>
-<a class="jxr_linenumber" name="L110" href="#L110">110</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("aaapppp", "", 8) = 7</em>
-<a class="jxr_linenumber" name="L111" href="#L111">111</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("aaapppp", "", 7) = 7</em>
-<a class="jxr_linenumber" name="L112" href="#L112">112</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("aaapppp", "", 6)) = -1</em>
-<a class="jxr_linenumber" name="L113" href="#L113">113</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("elephant", "hippo", 7) = 7</em>
-<a class="jxr_linenumber" name="L114" href="#L114">114</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("elephant", "hippo", 6) = -1</em>
-<a class="jxr_linenumber" name="L115" href="#L115">115</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("hippo", "elephant", 7) = 7</em>
-<a class="jxr_linenumber" name="L116" href="#L116">116</a> <em class="jxr_javadoccomment"> * StringUtils.getLevenshteinDistance("hippo", "elephant", 6) = -1</em>
-<a class="jxr_linenumber" name="L117" href="#L117">117</a> <em class="jxr_javadoccomment"> * </pre></em>
-<a class="jxr_linenumber" name="L118" href="#L118">118</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L119" href="#L119">119</a> <em class="jxr_javadoccomment"> * @param left the first string, must not be null</em>
-<a class="jxr_linenumber" name="L120" href="#L120">120</a> <em class="jxr_javadoccomment"> * @param right the second string, must not be null</em>
-<a class="jxr_linenumber" name="L121" href="#L121">121</a> <em class="jxr_javadoccomment"> * @param threshold the target threshold, must not be negative</em>
-<a class="jxr_linenumber" name="L122" href="#L122">122</a> <em class="jxr_javadoccomment"> * @return result distance</em>
-<a class="jxr_linenumber" name="L123" href="#L123">123</a> <em class="jxr_javadoccomment"> * @throws IllegalArgumentException if either String input {@code null} or</em>
-<a class="jxr_linenumber" name="L124" href="#L124">124</a> <em class="jxr_javadoccomment"> * negative threshold</em>
-<a class="jxr_linenumber" name="L125" href="#L125">125</a> <em class="jxr_javadoccomment"> */</em>
-<a class="jxr_linenumber" name="L126" href="#L126">126</a> <strong class="jxr_keyword">public</strong> Integer compare(CharSequence left, CharSequence right, <strong class="jxr_keyword">int</strong> threshold) {
-<a class="jxr_linenumber" name="L127" href="#L127">127</a> <strong class="jxr_keyword">if</strong> (left == <strong class="jxr_keyword">null</strong> || right == <strong class="jxr_keyword">null</strong>) {
-<a class="jxr_linenumber" name="L128" href="#L128">128</a> <strong class="jxr_keyword">throw</strong> <strong class="jxr_keyword">new</strong> IllegalArgumentException(<span class="jxr_string">"Strings must not be null"</span>);
-<a class="jxr_linenumber" name="L129" href="#L129">129</a> }
-<a class="jxr_linenumber" name="L130" href="#L130">130</a> <strong class="jxr_keyword">if</strong> (threshold < 0) {
-<a class="jxr_linenumber" name="L131" href="#L131">131</a> <strong class="jxr_keyword">throw</strong> <strong class="jxr_keyword">new</strong> IllegalArgumentException(<span class="jxr_string">"Threshold must not be negative"</span>);
-<a class="jxr_linenumber" name="L132" href="#L132">132</a> }
-<a class="jxr_linenumber" name="L133" href="#L133">133</a>
-<a class="jxr_linenumber" name="L134" href="#L134">134</a> <em class="jxr_comment">/*</em>
-<a class="jxr_linenumber" name="L135" href="#L135">135</a> <em class="jxr_comment"> * This implementation only computes the distance if it's less than or</em>
-<a class="jxr_linenumber" name="L136" href="#L136">136</a> <em class="jxr_comment"> * equal to the threshold value, returning -1 if it's greater. The</em>
-<a class="jxr_linenumber" name="L137" href="#L137">137</a> <em class="jxr_comment"> * advantage is performance: unbounded distance is O(nm), but a bound of</em>
-<a class="jxr_linenumber" name="L138" href="#L138">138</a> <em class="jxr_comment"> * k allows us to reduce it to O(km) time by only computing a diagonal</em>
-<a class="jxr_linenumber" name="L139" href="#L139">139</a> <em class="jxr_comment"> * stripe of width 2k + 1 of the cost table. It is also possible to use</em>
-<a class="jxr_linenumber" name="L140" href="#L140">140</a> <em class="jxr_comment"> * this to compute the unbounded Levenshtein distance by starting the</em>
-<a class="jxr_linenumber" name="L141" href="#L141">141</a> <em class="jxr_comment"> * threshold at 1 and doubling each time until the distance is found;</em>
-<a class="jxr_linenumber" name="L142" href="#L142">142</a> <em class="jxr_comment"> * this is O(dm), where d is the distance.</em>
-<a class="jxr_linenumber" name="L143" href="#L143">143</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L144" href="#L144">144</a> <em class="jxr_comment"> * One subtlety comes from needing to ignore entries on the border of</em>
-<a class="jxr_linenumber" name="L145" href="#L145">145</a> <em class="jxr_comment"> * our stripe eg. p[] = |#|#|#|* d[] = *|#|#|#| We must ignore the entry</em>
-<a class="jxr_linenumber" name="L146" href="#L146">146</a> <em class="jxr_comment"> * to the left of the leftmost member We must ignore the entry above the</em>
-<a class="jxr_linenumber" name="L147" href="#L147">147</a> <em class="jxr_comment"> * rightmost member</em>
+<a class="jxr_linenumber" name="L39" href="#L39">39</a> <em class="jxr_javadoccomment"> * <p>A higher score indicates a greater distance.</p></em>
+<a class="jxr_linenumber" name="L40" href="#L40">40</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L41" href="#L41">41</a> <em class="jxr_javadoccomment"> * <p></em>
+<a class="jxr_linenumber" name="L42" href="#L42">42</a> <em class="jxr_javadoccomment"> * The previous implementation of the Levenshtein distance algorithm was</em>
+<a class="jxr_linenumber" name="L43" href="#L43">43</a> <em class="jxr_javadoccomment"> * from <a</em>
+<a class="jxr_linenumber" name="L44" href="#L44">44</a> <em class="jxr_javadoccomment"> * href="<a href="http://www.merriampark.com/ld.htm" target="alexandria_uri">http://www.merriampark.com/ld.htm</a>">http://www.merriampark.com</em>
+<a class="jxr_linenumber" name="L45" href="#L45">45</a> <em class="jxr_javadoccomment"> * /ld.htm</a></em>
+<a class="jxr_linenumber" name="L46" href="#L46">46</a> <em class="jxr_javadoccomment"> * </p></em>
+<a class="jxr_linenumber" name="L47" href="#L47">47</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L48" href="#L48">48</a> <em class="jxr_javadoccomment"> * <p></em>
+<a class="jxr_linenumber" name="L49" href="#L49">49</a> <em class="jxr_javadoccomment"> * Chas Emerick has written an implementation in Java, which avoids an</em>
+<a class="jxr_linenumber" name="L50" href="#L50">50</a> <em class="jxr_javadoccomment"> * OutOfMemoryError which can occur when my Java implementation is used with</em>
+<a class="jxr_linenumber" name="L51" href="#L51">51</a> <em class="jxr_javadoccomment"> * very large strings.<br></em>
+<a class="jxr_linenumber" name="L52" href="#L52">52</a> <em class="jxr_javadoccomment"> * This implementation of the Levenshtein distance algorithm is from <a</em>
+<a class="jxr_linenumber" name="L53" href="#L53">53</a> <em class="jxr_javadoccomment"> * href="<a href="http://www.merriampark.com/ldjava.htm" target="alexandria_uri">http://www.merriampark.com/ldjava.htm</a>">http://www.merriampark.com/</em>
+<a class="jxr_linenumber" name="L54" href="#L54">54</a> <em class="jxr_javadoccomment"> * ldjava.htm</a></em>
+<a class="jxr_linenumber" name="L55" href="#L55">55</a> <em class="jxr_javadoccomment"> * </p></em>
+<a class="jxr_linenumber" name="L56" href="#L56">56</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L57" href="#L57">57</a> <em class="jxr_javadoccomment"> * <pre></em>
+<a class="jxr_linenumber" name="L58" href="#L58">58</a> <em class="jxr_javadoccomment"> * distance.compare(null, *) = IllegalArgumentException</em>
+<a class="jxr_linenumber" name="L59" href="#L59">59</a> <em class="jxr_javadoccomment"> * distance.compare(*, null) = IllegalArgumentException</em>
+<a class="jxr_linenumber" name="L60" href="#L60">60</a> <em class="jxr_javadoccomment"> * distance.compare("","") = 0</em>
+<a class="jxr_linenumber" name="L61" href="#L61">61</a> <em class="jxr_javadoccomment"> * distance.compare("","a") = 1</em>
+<a class="jxr_linenumber" name="L62" href="#L62">62</a> <em class="jxr_javadoccomment"> * distance.compare("aaapppp", "") = 7</em>
+<a class="jxr_linenumber" name="L63" href="#L63">63</a> <em class="jxr_javadoccomment"> * distance.compare("frog", "fog") = 1</em>
+<a class="jxr_linenumber" name="L64" href="#L64">64</a> <em class="jxr_javadoccomment"> * distance.compare("fly", "ant") = 3</em>
+<a class="jxr_linenumber" name="L65" href="#L65">65</a> <em class="jxr_javadoccomment"> * distance.compare("elephant", "hippo") = 7</em>
+<a class="jxr_linenumber" name="L66" href="#L66">66</a> <em class="jxr_javadoccomment"> * distance.compare("hippo", "elephant") = 7</em>
+<a class="jxr_linenumber" name="L67" href="#L67">67</a> <em class="jxr_javadoccomment"> * distance.compare("hippo", "zzzzzzzz") = 8</em>
+<a class="jxr_linenumber" name="L68" href="#L68">68</a> <em class="jxr_javadoccomment"> * distance.compare("hello", "hallo") = 1</em>
+<a class="jxr_linenumber" name="L69" href="#L69">69</a> <em class="jxr_javadoccomment"> * </pre></em>
+<a class="jxr_linenumber" name="L70" href="#L70">70</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L71" href="#L71">71</a> <em class="jxr_javadoccomment"> * @param left the first string, must not be null</em>
+<a class="jxr_linenumber" name="L72" href="#L72">72</a> <em class="jxr_javadoccomment"> * @param right the second string, must not be null</em>
+<a class="jxr_linenumber" name="L73" href="#L73">73</a> <em class="jxr_javadoccomment"> * @return result distance</em>
+<a class="jxr_linenumber" name="L74" href="#L74">74</a> <em class="jxr_javadoccomment"> * @throws IllegalArgumentException if either String input {@code null}</em>
+<a class="jxr_linenumber" name="L75" href="#L75">75</a> <em class="jxr_javadoccomment"> */</em>
+<a class="jxr_linenumber" name="L76" href="#L76">76</a> @Override
+<a class="jxr_linenumber" name="L77" href="#L77">77</a> <strong class="jxr_keyword">public</strong> Integer compare(CharSequence left, CharSequence right) {
+<a class="jxr_linenumber" name="L78" href="#L78">78</a> <strong class="jxr_keyword">return</strong> compare(left, right, Integer.MAX_VALUE);
+<a class="jxr_linenumber" name="L79" href="#L79">79</a> }
+<a class="jxr_linenumber" name="L80" href="#L80">80</a>
+<a class="jxr_linenumber" name="L81" href="#L81">81</a> <em class="jxr_javadoccomment">/**</em>
+<a class="jxr_linenumber" name="L82" href="#L82">82</a> <em class="jxr_javadoccomment"> * Find the Levenshtein distance between two CharSequences if it's less than or</em>
+<a class="jxr_linenumber" name="L83" href="#L83">83</a> <em class="jxr_javadoccomment"> * equal to a given threshold.</em>
+<a class="jxr_linenumber" name="L84" href="#L84">84</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L85" href="#L85">85</a> <em class="jxr_javadoccomment"> * <p></em>
+<a class="jxr_linenumber" name="L86" href="#L86">86</a> <em class="jxr_javadoccomment"> * This implementation follows from Algorithms on Strings, Trees and</em>
+<a class="jxr_linenumber" name="L87" href="#L87">87</a> <em class="jxr_javadoccomment"> * Sequences by Dan Gusfield and Chas Emerick's implementation of the</em>
+<a class="jxr_linenumber" name="L88" href="#L88">88</a> <em class="jxr_javadoccomment"> * Levenshtein distance algorithm from <a</em>
+<a class="jxr_linenumber" name="L89" href="#L89">89</a> <em class="jxr_javadoccomment"> * href="<a href="http://www.merriampark.com/ld.htm" target="alexandria_uri">http://www.merriampark.com/ld.htm</a>"</em>
+<a class="jxr_linenumber" name="L90" href="#L90">90</a> <em class="jxr_javadoccomment"> * ><a href="http://www.merriampark.com/ld.htm</a>" target="alexandria_uri">http://www.merriampark.com/ld.htm</a></a>;</em>
+<a class="jxr_linenumber" name="L91" href="#L91">91</a> <em class="jxr_javadoccomment"> * </p></em>
+<a class="jxr_linenumber" name="L92" href="#L92">92</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L93" href="#L93">93</a> <em class="jxr_javadoccomment"> * <pre></em>
+<a class="jxr_linenumber" name="L94" href="#L94">94</a> <em class="jxr_javadoccomment"> * distance.compare(null, *, *) = IllegalArgumentException</em>
+<a class="jxr_linenumber" name="L95" href="#L95">95</a> <em class="jxr_javadoccomment"> * distance.compare(*, null, *) = IllegalArgumentException</em>
+<a class="jxr_linenumber" name="L96" href="#L96">96</a> <em class="jxr_javadoccomment"> * distance.compare(*, *, -1) = IllegalArgumentException</em>
+<a class="jxr_linenumber" name="L97" href="#L97">97</a> <em class="jxr_javadoccomment"> * distance.compare("","", 0) = 0</em>
+<a class="jxr_linenumber" name="L98" href="#L98">98</a> <em class="jxr_javadoccomment"> * distance.compare("aaapppp", "", 8) = 7</em>
+<a class="jxr_linenumber" name="L99" href="#L99">99</a> <em class="jxr_javadoccomment"> * distance.compare("aaapppp", "", 7) = 7</em>
+<a class="jxr_linenumber" name="L100" href="#L100">100</a> <em class="jxr_javadoccomment"> * distance.compare("aaapppp", "", 6)) = -1</em>
+<a class="jxr_linenumber" name="L101" href="#L101">101</a> <em class="jxr_javadoccomment"> * distance.compare("elephant", "hippo", 7) = 7</em>
+<a class="jxr_linenumber" name="L102" href="#L102">102</a> <em class="jxr_javadoccomment"> * distance.compare("elephant", "hippo", 6) = -1</em>
+<a class="jxr_linenumber" name="L103" href="#L103">103</a> <em class="jxr_javadoccomment"> * distance.compare("hippo", "elephant", 7) = 7</em>
+<a class="jxr_linenumber" name="L104" href="#L104">104</a> <em class="jxr_javadoccomment"> * distance.compare("hippo", "elephant", 6) = -1</em>
+<a class="jxr_linenumber" name="L105" href="#L105">105</a> <em class="jxr_javadoccomment"> * </pre></em>
+<a class="jxr_linenumber" name="L106" href="#L106">106</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L107" href="#L107">107</a> <em class="jxr_javadoccomment"> * @param left the first string, must not be null</em>
+<a class="jxr_linenumber" name="L108" href="#L108">108</a> <em class="jxr_javadoccomment"> * @param right the second string, must not be null</em>
+<a class="jxr_linenumber" name="L109" href="#L109">109</a> <em class="jxr_javadoccomment"> * @param threshold the target threshold, must not be negative</em>
+<a class="jxr_linenumber" name="L110" href="#L110">110</a> <em class="jxr_javadoccomment"> * @return result distance</em>
+<a class="jxr_linenumber" name="L111" href="#L111">111</a> <em class="jxr_javadoccomment"> * @throws IllegalArgumentException if either String input {@code null} or</em>
+<a class="jxr_linenumber" name="L112" href="#L112">112</a> <em class="jxr_javadoccomment"> * negative threshold</em>
+<a class="jxr_linenumber" name="L113" href="#L113">113</a> <em class="jxr_javadoccomment"> */</em>
+<a class="jxr_linenumber" name="L114" href="#L114">114</a> <strong class="jxr_keyword">public</strong> Integer compare(CharSequence left, CharSequence right, <strong class="jxr_keyword">int</strong> threshold) {
+<a class="jxr_linenumber" name="L115" href="#L115">115</a> <strong class="jxr_keyword">if</strong> (left == <strong class="jxr_keyword">null</strong> || right == <strong class="jxr_keyword">null</strong>) {
+<a class="jxr_linenumber" name="L116" href="#L116">116</a> <strong class="jxr_keyword">throw</strong> <strong class="jxr_keyword">new</strong> IllegalArgumentException(<span class="jxr_string">"Strings must not be null"</span>);
+<a class="jxr_linenumber" name="L117" href="#L117">117</a> }
+<a class="jxr_linenumber" name="L118" href="#L118">118</a> <strong class="jxr_keyword">if</strong> (threshold < 0) {
+<a class="jxr_linenumber" name="L119" href="#L119">119</a> <strong class="jxr_keyword">throw</strong> <strong class="jxr_keyword">new</strong> IllegalArgumentException(<span class="jxr_string">"Threshold must not be negative"</span>);
+<a class="jxr_linenumber" name="L120" href="#L120">120</a> }
+<a class="jxr_linenumber" name="L121" href="#L121">121</a>
+<a class="jxr_linenumber" name="L122" href="#L122">122</a> <em class="jxr_comment">/*</em>
+<a class="jxr_linenumber" name="L123" href="#L123">123</a> <em class="jxr_comment"> * This implementation only computes the distance if it's less than or</em>
+<a class="jxr_linenumber" name="L124" href="#L124">124</a> <em class="jxr_comment"> * equal to the threshold value, returning -1 if it's greater. The</em>
+<a class="jxr_linenumber" name="L125" href="#L125">125</a> <em class="jxr_comment"> * advantage is performance: unbounded distance is O(nm), but a bound of</em>
+<a class="jxr_linenumber" name="L126" href="#L126">126</a> <em class="jxr_comment"> * k allows us to reduce it to O(km) time by only computing a diagonal</em>
+<a class="jxr_linenumber" name="L127" href="#L127">127</a> <em class="jxr_comment"> * stripe of width 2k + 1 of the cost table. It is also possible to use</em>
+<a class="jxr_linenumber" name="L128" href="#L128">128</a> <em class="jxr_comment"> * this to compute the unbounded Levenshtein distance by starting the</em>
+<a class="jxr_linenumber" name="L129" href="#L129">129</a> <em class="jxr_comment"> * threshold at 1 and doubling each time until the distance is found;</em>
+<a class="jxr_linenumber" name="L130" href="#L130">130</a> <em class="jxr_comment"> * this is O(dm), where d is the distance.</em>
+<a class="jxr_linenumber" name="L131" href="#L131">131</a> <em class="jxr_comment"> *</em>
+<a class="jxr_linenumber" name="L132" href="#L132">132</a> <em class="jxr_comment"> * One subtlety comes from needing to ignore entries on the border of</em>
+<a class="jxr_linenumber" name="L133" href="#L133">133</a> <em class="jxr_comment"> * our stripe eg. p[] = |#|#|#|* d[] = *|#|#|#| We must ignore the entry</em>
+<a class="jxr_linenumber" name="L134" href="#L134">134</a> <em class="jxr_comment"> * to the left of the leftmost member We must ignore the entry above the</em>
+<a class="jxr_linenumber" name="L135" href="#L135">135</a> <em class="jxr_comment"> * rightmost member</em>
+<a class="jxr_linenumber" name="L136" href="#L136">136</a> <em class="jxr_comment"> *</em>
+<a class="jxr_linenumber" name="L137" href="#L137">137</a> <em class="jxr_comment"> * Another subtlety comes from our stripe running off the matrix if the</em>
+<a class="jxr_linenumber" name="L138" href="#L138">138</a> <em class="jxr_comment"> * strings aren't of the same size. Since string s is always swapped to</em>
+<a class="jxr_linenumber" name="L139" href="#L139">139</a> <em class="jxr_comment"> * be the shorter of the two, the stripe will always run off to the</em>
+<a class="jxr_linenumber" name="L140" href="#L140">140</a> <em class="jxr_comment"> * upper right instead of the lower left of the matrix.</em>
+<a class="jxr_linenumber" name="L141" href="#L141">141</a> <em class="jxr_comment"> *</em>
+<a class="jxr_linenumber" name="L142" href="#L142">142</a> <em class="jxr_comment"> * As a concrete example, suppose s is of length 5, t is of length 7,</em>
+<a class="jxr_linenumber" name="L143" href="#L143">143</a> <em class="jxr_comment"> * and our threshold is 1. In this case we're going to walk a stripe of</em>
+<a class="jxr_linenumber" name="L144" href="#L144">144</a> <em class="jxr_comment"> * length 3. The matrix would look like so:</em>
+<a class="jxr_linenumber" name="L145" href="#L145">145</a> <em class="jxr_comment"> *</em>
+<a class="jxr_linenumber" name="L146" href="#L146">146</a> <em class="jxr_comment"> * 1 2 3 4 5 1 |#|#| | | | 2 |#|#|#| | | 3 | |#|#|#| | 4 | | |#|#|#| 5 |</em>
+<a class="jxr_linenumber" name="L147" href="#L147">147</a> <em class="jxr_comment"> * | | |#|#| 6 | | | | |#| 7 | | | | | |</em>
<a class="jxr_linenumber" name="L148" href="#L148">148</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L149" href="#L149">149</a> <em class="jxr_comment"> * Another subtlety comes from our stripe running off the matrix if the</em>
-<a class="jxr_linenumber" name="L150" href="#L150">150</a> <em class="jxr_comment"> * strings aren't of the same size. Since string s is always swapped to</em>
-<a class="jxr_linenumber" name="L151" href="#L151">151</a> <em class="jxr_comment"> * be the shorter of the two, the stripe will always run off to the</em>
-<a class="jxr_linenumber" name="L152" href="#L152">152</a> <em class="jxr_comment"> * upper right instead of the lower left of the matrix.</em>
-<a class="jxr_linenumber" name="L153" href="#L153">153</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L154" href="#L154">154</a> <em class="jxr_comment"> * As a concrete example, suppose s is of length 5, t is of length 7,</em>
-<a class="jxr_linenumber" name="L155" href="#L155">155</a> <em class="jxr_comment"> * and our threshold is 1. In this case we're going to walk a stripe of</em>
-<a class="jxr_linenumber" name="L156" href="#L156">156</a> <em class="jxr_comment"> * length 3. The matrix would look like so:</em>
-<a class="jxr_linenumber" name="L157" href="#L157">157</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L158" href="#L158">158</a> <em class="jxr_comment"> * 1 2 3 4 5 1 |#|#| | | | 2 |#|#|#| | | 3 | |#|#|#| | 4 | | |#|#|#| 5 |</em>
-<a class="jxr_linenumber" name="L159" href="#L159">159</a> <em class="jxr_comment"> * | | |#|#| 6 | | | | |#| 7 | | | | | |</em>
-<a class="jxr_linenumber" name="L160" href="#L160">160</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L161" href="#L161">161</a> <em class="jxr_comment"> * Note how the stripe leads off the table as there is no possible way</em>
-<a class="jxr_linenumber" name="L162" href="#L162">162</a> <em class="jxr_comment"> * to turn a string of length 5 into one of length 7 in edit distance of</em>
-<a class="jxr_linenumber" name="L163" href="#L163">163</a> <em class="jxr_comment"> * 1.</em>
-<a class="jxr_linenumber" name="L164" href="#L164">164</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L165" href="#L165">165</a> <em class="jxr_comment"> * Additionally, this implementation decreases memory usage by using two</em>
-<a class="jxr_linenumber" name="L166" href="#L166">166</a> <em class="jxr_comment"> * single-dimensional arrays and swapping them back and forth instead of</em>
-<a class="jxr_linenumber" name="L167" href="#L167">167</a> <em class="jxr_comment"> * allocating an entire n by m matrix. This requires a few minor</em>
-<a class="jxr_linenumber" name="L168" href="#L168">168</a> <em class="jxr_comment"> * changes, such as immediately returning when it's detected that the</em>
-<a class="jxr_linenumber" name="L169" href="#L169">169</a> <em class="jxr_comment"> * stripe has run off the matrix and initially filling the arrays with</em>
-<a class="jxr_linenumber" name="L170" href="#L170">170</a> <em class="jxr_comment"> * large values so that entries we don't compute are ignored.</em>
-<a class="jxr_linenumber" name="L171" href="#L171">171</a> <em class="jxr_comment"> *</em>
-<a class="jxr_linenumber" name="L172" href="#L172">172</a> <em class="jxr_comment"> * See Algorithms on Strings, Trees and Sequences by Dan Gusfield for</em>
-<a class="jxr_linenumber" name="L173" href="#L173">173</a> <em class="jxr_comment"> * some discussion.</em>
-<a class="jxr_linenumber" name="L174" href="#L174">174</a> <em class="jxr_comment"> */</em>
-<a class="jxr_linenumber" name="L175" href="#L175">175</a>
-<a class="jxr_linenumber" name="L176" href="#L176">176</a> <strong class="jxr_keyword">int</strong> n = left.length(); <em class="jxr_comment">// length of s</em>
-<a class="jxr_linenumber" name="L177" href="#L177">177</a> <strong class="jxr_keyword">int</strong> m = right.length(); <em class="jxr_comment">// length of t</em>
-<a class="jxr_linenumber" name="L178" href="#L178">178</a>
-<a class="jxr_linenumber" name="L179" href="#L179">179</a> <em class="jxr_comment">// if one string is empty, the edit distance is necessarily the length</em>
-<a class="jxr_linenumber" name="L180" href="#L180">180</a> <em class="jxr_comment">// of the other</em>
-<a class="jxr_linenumber" name="L181" href="#L181">181</a> <strong class="jxr_keyword">if</strong> (n == 0) {
-<a class="jxr_linenumber" name="L182" href="#L182">182</a> <strong class="jxr_keyword">return</strong> m <= threshold ? m : -1;
-<a class="jxr_linenumber" name="L183" href="#L183">183</a> } <strong class="jxr_keyword">else</strong> <strong class="jxr_keyword">if</strong> (m == 0) {
-<a class="jxr_linenumber" name="L184" href="#L184">184</a> <strong class="jxr_keyword">return</strong> n <= threshold ? n : -1;
-<a class="jxr_linenumber" name="L185" href="#L185">185</a> }
-<a class="jxr_linenumber" name="L186" href="#L186">186</a>
-<a class="jxr_linenumber" name="L187" href="#L187">187</a> <strong class="jxr_keyword">if</strong> (n > m) {
-<a class="jxr_linenumber" name="L188" href="#L188">188</a> <em class="jxr_comment">// swap the two strings to consume less memory</em>
-<a class="jxr_linenumber" name="L189" href="#L189">189</a> <strong class="jxr_keyword">final</strong> CharSequence tmp = left;
-<a class="jxr_linenumber" name="L190" href="#L190">190</a> left = right;
-<a class="jxr_linenumber" name="L191" href="#L191">191</a> right = tmp;
-<a class="jxr_linenumber" name="L192" href="#L192">192</a> n = m;
-<a class="jxr_linenumber" name="L193" href="#L193">193</a> m = right.length();
-<a class="jxr_linenumber" name="L194" href="#L194">194</a> }
-<a class="jxr_linenumber" name="L195" href="#L195">195</a>
-<a class="jxr_linenumber" name="L196" href="#L196">196</a> <strong class="jxr_keyword">int</strong>[] p = <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">int</strong>[n + 1]; <em class="jxr_comment">// 'previous' cost array, horizontally</em>
-<a class="jxr_linenumber" name="L197" href="#L197">197</a> <strong class="jxr_keyword">int</strong>[] d = <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">int</strong>[n + 1]; <em class="jxr_comment">// cost array, horizontally</em>
-<a class="jxr_linenumber" name="L198" href="#L198">198</a> <strong class="jxr_keyword">int</strong>[] _d; <em class="jxr_comment">// placeholder to assist in swapping p and d</em>
-<a class="jxr_linenumber" name="L199" href="#L199">199</a>
-<a class="jxr_linenumber" name="L200" href="#L200">200</a> <em class="jxr_comment">// fill in starting table values</em>
-<a class="jxr_linenumber" name="L201" href="#L201">201</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong> boundary = Math.min(n, threshold) + 1;
-<a class="jxr_linenumber" name="L202" href="#L202">202</a> <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> i = 0; i < boundary; i++) {
-<a class="jxr_linenumber" name="L203" href="#L203">203</a> p[i] = i;
-<a class="jxr_linenumber" name="L204" href="#L204">204</a> }
-<a class="jxr_linenumber" name="L205" href="#L205">205</a> <em class="jxr_comment">// these fills ensure that the value above the rightmost entry of our</em>
-<a class="jxr_linenumber" name="L206" href="#L206">206</a> <em class="jxr_comment">// stripe will be ignored in following loop iterations</em>
-<a class="jxr_linenumber" name="L207" href="#L207">207</a> Arrays.fill(p, boundary, p.length, Integer.MAX_VALUE);
-<a class="jxr_linenumber" name="L208" href="#L208">208</a> Arrays.fill(d, Integer.MAX_VALUE);
-<a class="jxr_linenumber" name="L209" href="#L209">209</a>
-<a class="jxr_linenumber" name="L210" href="#L210">210</a> <em class="jxr_comment">// iterates through t</em>
-<a class="jxr_linenumber" name="L211" href="#L211">211</a> <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> j = 1; j <= m; j++) {
-<a class="jxr_linenumber" name="L212" href="#L212">212</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">char</strong> t_j = right.charAt(j - 1); <em class="jxr_comment">// jth character of t</em>
-<a class="jxr_linenumber" name="L213" href="#L213">213</a> d[0] = j;
-<a class="jxr_linenumber" name="L214" href="#L214">214</a>
-<a class="jxr_linenumber" name="L215" href="#L215">215</a> <em class="jxr_comment">// compute stripe indices, constrain to array size</em>
-<a class="jxr_linenumber" name="L216" href="#L216">216</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong> min = Math.max(1, j - threshold);
-<a class="jxr_linenumber" name="L217" href="#L217">217</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong> max = j > Integer.MAX_VALUE - threshold ? n : Math.min(
-<a class="jxr_linenumber" name="L218" href="#L218">218</a> n, j + threshold);
-<a class="jxr_linenumber" name="L219" href="#L219">219</a>
-<a class="jxr_linenumber" name="L220" href="#L220">220</a> <em class="jxr_comment">// the stripe may lead off of the table if s and t are of different</em>
-<a class="jxr_linenumber" name="L221" href="#L221">221</a> <em class="jxr_comment">// sizes</em>
-<a class="jxr_linenumber" name="L222" href="#L222">222</a> <strong class="jxr_keyword">if</strong> (min > max) {
-<a class="jxr_linenumber" name="L223" href="#L223">223</a> <strong class="jxr_keyword">return</strong> -1;
-<a class="jxr_linenumber" name="L224" href="#L224">224</a> }
-<a class="jxr_linenumber" name="L225" href="#L225">225</a>
-<a class="jxr_linenumber" name="L226" href="#L226">226</a> <em class="jxr_comment">// ignore entry left of leftmost</em>
-<a class="jxr_linenumber" name="L227" href="#L227">227</a> <strong class="jxr_keyword">if</strong> (min > 1) {
-<a class="jxr_linenumber" name="L228" href="#L228">228</a> d[min - 1] = Integer.MAX_VALUE;
+<a class="jxr_linenumber" name="L149" href="#L149">149</a> <em class="jxr_comment"> * Note how the stripe leads off the table as there is no possible way</em>
+<a class="jxr_linenumber" name="L150" href="#L150">150</a> <em class="jxr_comment"> * to turn a string of length 5 into one of length 7 in edit distance of</em>
+<a class="jxr_linenumber" name="L151" href="#L151">151</a> <em class="jxr_comment"> * 1.</em>
+<a class="jxr_linenumber" name="L152" href="#L152">152</a> <em class="jxr_comment"> *</em>
+<a class="jxr_linenumber" name="L153" href="#L153">153</a> <em class="jxr_comment"> * Additionally, this implementation decreases memory usage by using two</em>
+<a class="jxr_linenumber" name="L154" href="#L154">154</a> <em class="jxr_comment"> * single-dimensional arrays and swapping them back and forth instead of</em>
+<a class="jxr_linenumber" name="L155" href="#L155">155</a> <em class="jxr_comment"> * allocating an entire n by m matrix. This requires a few minor</em>
+<a class="jxr_linenumber" name="L156" href="#L156">156</a> <em class="jxr_comment"> * changes, such as immediately returning when it's detected that the</em>
+<a class="jxr_linenumber" name="L157" href="#L157">157</a> <em class="jxr_comment"> * stripe has run off the matrix and initially filling the arrays with</em>
+<a class="jxr_linenumber" name="L158" href="#L158">158</a> <em class="jxr_comment"> * large values so that entries we don't compute are ignored.</em>
+<a class="jxr_linenumber" name="L159" href="#L159">159</a> <em class="jxr_comment"> *</em>
+<a class="jxr_linenumber" name="L160" href="#L160">160</a> <em class="jxr_comment"> * See Algorithms on Strings, Trees and Sequences by Dan Gusfield for</em>
+<a class="jxr_linenumber" name="L161" href="#L161">161</a> <em class="jxr_comment"> * some discussion.</em>
+<a class="jxr_linenumber" name="L162" href="#L162">162</a> <em class="jxr_comment"> */</em>
+<a class="jxr_linenumber" name="L163" href="#L163">163</a>
+<a class="jxr_linenumber" name="L164" href="#L164">164</a> <strong class="jxr_keyword">int</strong> n = left.length(); <em class="jxr_comment">// length of s</em>
+<a class="jxr_linenumber" name="L165" href="#L165">165</a> <strong class="jxr_keyword">int</strong> m = right.length(); <em class="jxr_comment">// length of t</em>
+<a class="jxr_linenumber" name="L166" href="#L166">166</a>
+<a class="jxr_linenumber" name="L167" href="#L167">167</a> <em class="jxr_comment">// if one string is empty, the edit distance is necessarily the length</em>
+<a class="jxr_linenumber" name="L168" href="#L168">168</a> <em class="jxr_comment">// of the other</em>
+<a class="jxr_linenumber" name="L169" href="#L169">169</a> <strong class="jxr_keyword">if</strong> (n == 0) {
+<a class="jxr_linenumber" name="L170" href="#L170">170</a> <strong class="jxr_keyword">return</strong> m <= threshold ? m : -1;
+<a class="jxr_linenumber" name="L171" href="#L171">171</a> } <strong class="jxr_keyword">else</strong> <strong class="jxr_keyword">if</strong> (m == 0) {
+<a class="jxr_linenumber" name="L172" href="#L172">172</a> <strong class="jxr_keyword">return</strong> n <= threshold ? n : -1;
+<a class="jxr_linenumber" name="L173" href="#L173">173</a> }
+<a class="jxr_linenumber" name="L174" href="#L174">174</a>
+<a class="jxr_linenumber" name="L175" href="#L175">175</a> <strong class="jxr_keyword">if</strong> (n > m) {
+<a class="jxr_linenumber" name="L176" href="#L176">176</a> <em class="jxr_comment">// swap the two strings to consume less memory</em>
+<a class="jxr_linenumber" name="L177" href="#L177">177</a> <strong class="jxr_keyword">final</strong> CharSequence tmp = left;
+<a class="jxr_linenumber" name="L178" href="#L178">178</a> left = right;
+<a class="jxr_linenumber" name="L179" href="#L179">179</a> right = tmp;
+<a class="jxr_linenumber" name="L180" href="#L180">180</a> n = m;
+<a class="jxr_linenumber" name="L181" href="#L181">181</a> m = right.length();
+<a class="jxr_linenumber" name="L182" href="#L182">182</a> }
+<a class="jxr_linenumber" name="L183" href="#L183">183</a>
+<a class="jxr_linenumber" name="L184" href="#L184">184</a> <strong class="jxr_keyword">int</strong>[] p = <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">int</strong>[n + 1]; <em class="jxr_comment">// 'previous' cost array, horizontally</em>
+<a class="jxr_linenumber" name="L185" href="#L185">185</a> <strong class="jxr_keyword">int</strong>[] d = <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">int</strong>[n + 1]; <em class="jxr_comment">// cost array, horizontally</em>
+<a class="jxr_linenumber" name="L186" href="#L186">186</a> <strong class="jxr_keyword">int</strong>[] _d; <em class="jxr_comment">// placeholder to assist in swapping p and d</em>
+<a class="jxr_linenumber" name="L187" href="#L187">187</a>
+<a class="jxr_linenumber" name="L188" href="#L188">188</a> <em class="jxr_comment">// fill in starting table values</em>
+<a class="jxr_linenumber" name="L189" href="#L189">189</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong> boundary = Math.min(n, threshold) + 1;
+<a class="jxr_linenumber" name="L190" href="#L190">190</a> <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> i = 0; i < boundary; i++) {
+<a class="jxr_linenumber" name="L191" href="#L191">191</a> p[i] = i;
+<a class="jxr_linenumber" name="L192" href="#L192">192</a> }
+<a class="jxr_linenumber" name="L193" href="#L193">193</a> <em class="jxr_comment">// these fills ensure that the value above the rightmost entry of our</em>
+<a class="jxr_linenumber" name="L194" href="#L194">194</a> <em class="jxr_comment">// stripe will be ignored in following loop iterations</em>
+<a class="jxr_linenumber" name="L195" href="#L195">195</a> Arrays.fill(p, boundary, p.length, Integer.MAX_VALUE);
+<a class="jxr_linenumber" name="L196" href="#L196">196</a> Arrays.fill(d, Integer.MAX_VALUE);
+<a class="jxr_linenumber" name="L197" href="#L197">197</a>
+<a class="jxr_linenumber" name="L198" href="#L198">198</a> <em class="jxr_comment">// iterates through t</em>
+<a class="jxr_linenumber" name="L199" href="#L199">199</a> <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> j = 1; j <= m; j++) {
+<a class="jxr_linenumber" name="L200" href="#L200">200</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">char</strong> t_j = right.charAt(j - 1); <em class="jxr_comment">// jth character of t</em>
+<a class="jxr_linenumber" name="L201" href="#L201">201</a> d[0] = j;
+<a class="jxr_linenumber" name="L202" href="#L202">202</a>
+<a class="jxr_linenumber" name="L203" href="#L203">203</a> <em class="jxr_comment">// compute stripe indices, constrain to array size</em>
+<a class="jxr_linenumber" name="L204" href="#L204">204</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong> min = Math.max(1, j - threshold);
+<a class="jxr_linenumber" name="L205" href="#L205">205</a> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong> max = j > Integer.MAX_VALUE - threshold ? n : Math.min(
+<a class="jxr_linenumber" name="L206" href="#L206">206</a> n, j + threshold);
+<a class="jxr_linenumber" name="L207" href="#L207">207</a>
+<a class="jxr_linenumber" name="L208" href="#L208">208</a> <em class="jxr_comment">// the stripe may lead off of the table if s and t are of different</em>
+<a class="jxr_linenumber" name="L209" href="#L209">209</a> <em class="jxr_comment">// sizes</em>
+<a class="jxr_linenumber" name="L210" href="#L210">210</a> <strong class="jxr_keyword">if</strong> (min > max) {
+<a class="jxr_linenumber" name="L211" href="#L211">211</a> <strong class="jxr_keyword">return</strong> -1;
+<a class="jxr_linenumber" name="L212" href="#L212">212</a> }
+<a class="jxr_linenumber" name="L213" href="#L213">213</a>
+<a class="jxr_linenumber" name="L214" href="#L214">214</a> <em class="jxr_comment">// ignore entry left of leftmost</em>
+<a class="jxr_linenumber" name="L215" href="#L215">215</a> <strong class="jxr_keyword">if</strong> (min > 1) {
+<a class="jxr_linenumber" name="L216" href="#L216">216</a> d[min - 1] = Integer.MAX_VALUE;
+<a class="jxr_linenumber" name="L217" href="#L217">217</a> }
+<a class="jxr_linenumber" name="L218" href="#L218">218</a>
+<a class="jxr_linenumber" name="L219" href="#L219">219</a> <em class="jxr_comment">// iterates through [min, max] in s</em>
+<a class="jxr_linenumber" name="L220" href="#L220">220</a> <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> i = min; i <= max; i++) {
+<a class="jxr_linenumber" name="L221" href="#L221">221</a> <strong class="jxr_keyword">if</strong> (left.charAt(i - 1) == t_j) {
+<a class="jxr_linenumber" name="L222" href="#L222">222</a> <em class="jxr_comment">// diagonally left and up</em>
+<a class="jxr_linenumber" name="L223" href="#L223">223</a> d[i] = p[i - 1];
+<a class="jxr_linenumber" name="L224" href="#L224">224</a> } <strong class="jxr_keyword">else</strong> {
+<a class="jxr_linenumber" name="L225" href="#L225">225</a> <em class="jxr_comment">// 1 + minimum of cell to the left, to the top, diagonally</em>
+<a class="jxr_linenumber" name="L226" href="#L226">226</a> <em class="jxr_comment">// left and up</em>
+<a class="jxr_linenumber" name="L227" href="#L227">227</a> d[i] = 1 + Math.min(Math.min(d[i - 1], p[i]), p[i - 1]);
+<a class="jxr_linenumber" name="L228" href="#L228">228</a> }
<a class="jxr_linenumber" name="L229" href="#L229">229</a> }
<a class="jxr_linenumber" name="L230" href="#L230">230</a>
-<a class="jxr_linenumber" name="L231" href="#L231">231</a> <em class="jxr_comment">// iterates through [min, max] in s</em>
-<a class="jxr_linenumber" name="L232" href="#L232">232</a> <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> i = min; i <= max; i++) {
-<a class="jxr_linenumber" name="L233" href="#L233">233</a> <strong class="jxr_keyword">if</strong> (left.charAt(i - 1) == t_j) {
-<a class="jxr_linenumber" name="L234" href="#L234">234</a> <em class="jxr_comment">// diagonally left and up</em>
-<a class="jxr_linenumber" name="L235" href="#L235">235</a> d[i] = p[i - 1];
-<a class="jxr_linenumber" name="L236" href="#L236">236</a> } <strong class="jxr_keyword">else</strong> {
-<a class="jxr_linenumber" name="L237" href="#L237">237</a> <em class="jxr_comment">// 1 + minimum of cell to the left, to the top, diagonally</em>
-<a class="jxr_linenumber" name="L238" href="#L238">238</a> <em class="jxr_comment">// left and up</em>
-<a class="jxr_linenumber" name="L239" href="#L239">239</a> d[i] = 1 + Math.min(Math.min(d[i - 1], p[i]), p[i - 1]);
-<a class="jxr_linenumber" name="L240" href="#L240">240</a> }
-<a class="jxr_linenumber" name="L241" href="#L241">241</a> }
-<a class="jxr_linenumber" name="L242" href="#L242">242</a>
-<a class="jxr_linenumber" name="L243" href="#L243">243</a> <em class="jxr_comment">// copy current distance counts to 'previous row' distance counts</em>
-<a class="jxr_linenumber" name="L244" href="#L244">244</a> _d = p;
-<a class="jxr_linenumber" name="L245" href="#L245">245</a> p = d;
-<a class="jxr_linenumber" name="L246" href="#L246">246</a> d = _d;
-<a class="jxr_linenumber" name="L247" href="#L247">247</a> }
-<a class="jxr_linenumber" name="L248" href="#L248">248</a>
-<a class="jxr_linenumber" name="L249" href="#L249">249</a> <em class="jxr_comment">// if p[n] is greater than the threshold, there's no guarantee on it</em>
-<a class="jxr_linenumber" name="L250" href="#L250">250</a> <em class="jxr_comment">// being the correct</em>
-<a class="jxr_linenumber" name="L251" href="#L251">251</a> <em class="jxr_comment">// distance</em>
-<a class="jxr_linenumber" name="L252" href="#L252">252</a> <strong class="jxr_keyword">if</strong> (p[n] <= threshold) {
-<a class="jxr_linenumber" name="L253" href="#L253">253</a> <strong class="jxr_keyword">return</strong> p[n];
-<a class="jxr_linenumber" name="L254" href="#L254">254</a> }
-<a class="jxr_linenumber" name="L255" href="#L255">255</a> <strong class="jxr_keyword">return</strong> -1;
-<a class="jxr_linenumber" name="L256" href="#L256">256</a> }
-<a class="jxr_linenumber" name="L257" href="#L257">257</a>
-<a class="jxr_linenumber" name="L258" href="#L258">258</a> }
+<a class="jxr_linenumber" name="L231" href="#L231">231</a> <em class="jxr_comment">// copy current distance counts to 'previous row' distance counts</em>
+<a class="jxr_linenumber" name="L232" href="#L232">232</a> _d = p;
+<a class="jxr_linenumber" name="L233" href="#L233">233</a> p = d;
+<a class="jxr_linenumber" name="L234" href="#L234">234</a> d = _d;
+<a class="jxr_linenumber" name="L235" href="#L235">235</a> }
+<a class="jxr_linenumber" name="L236" href="#L236">236</a>
+<a class="jxr_linenumber" name="L237" href="#L237">237</a> <em class="jxr_comment">// if p[n] is greater than the threshold, there's no guarantee on it</em>
+<a class="jxr_linenumber" name="L238" href="#L238">238</a> <em class="jxr_comment">// being the correct</em>
+<a class="jxr_linenumber" name="L239" href="#L239">239</a> <em class="jxr_comment">// distance</em>
+<a class="jxr_linenumber" name="L240" href="#L240">240</a> <strong class="jxr_keyword">if</strong> (p[n] <= threshold) {
+<a class="jxr_linenumber" name="L241" href="#L241">241</a> <strong class="jxr_keyword">return</strong> p[n];
+<a class="jxr_linenumber" name="L242" href="#L242">242</a> }
+<a class="jxr_linenumber" name="L243" href="#L243">243</a> <strong class="jxr_keyword">return</strong> -1;
+<a class="jxr_linenumber" name="L244" href="#L244">244</a> }
+<a class="jxr_linenumber" name="L245" href="#L245">245</a>
+<a class="jxr_linenumber" name="L246" href="#L246">246</a> }
</pre>
<hr/>
-<div id="footer">Copyright © 2014 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.</div>
+<div id="footer">Copyright © 2014–2015 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.</div>
</body>
-</html>
+</html>
\ No newline at end of file
Modified: websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/StringMetric.html
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/StringMetric.html (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/StringMetric.html Sun Mar 1 12:14:29 2015
@@ -25,34 +25,29 @@
<a class="jxr_linenumber" name="L17" href="#L17">17</a> <strong class="jxr_keyword">package</strong> org.apache.commons.text.similarity;
<a class="jxr_linenumber" name="L18" href="#L18">18</a>
<a class="jxr_linenumber" name="L19" href="#L19">19</a> <em class="jxr_javadoccomment">/**</em>
-<a class="jxr_linenumber" name="L20" href="#L20">20</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L21" href="#L21">21</a> <em class="jxr_javadoccomment"> * Marker interface for <a</em>
-<a class="jxr_linenumber" name="L22" href="#L22">22</a> <em class="jxr_javadoccomment"> * href='<a href="http://en.wikipedia.org/wiki/String_metric'>String" target="alexandria_uri">http://en.wikipedia.org/wiki/String_metric'>String</a> Metrics</a></em>
-<a class="jxr_linenumber" name="L23" href="#L23">23</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L24" href="#L24">24</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L25" href="#L25">25</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L26" href="#L26">26</a> <em class="jxr_javadoccomment"> * A string metric measures the distance between two text strings.</em>
-<a class="jxr_linenumber" name="L27" href="#L27">27</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L28" href="#L28">28</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L29" href="#L29">29</a> <em class="jxr_javadoccomment"> * @param <R> return type of the edit distance</em>
-<a class="jxr_linenumber" name="L30" href="#L30">30</a> <em class="jxr_javadoccomment"> * @since 1.0</em>
-<a class="jxr_linenumber" name="L31" href="#L31">31</a> <em class="jxr_javadoccomment"> */</em>
-<a class="jxr_linenumber" name="L32" href="#L32">32</a> <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">interface</strong> StringMetric<R> {
-<a class="jxr_linenumber" name="L33" href="#L33">33</a>
-<a class="jxr_linenumber" name="L34" href="#L34">34</a> <em class="jxr_javadoccomment">/**</em>
-<a class="jxr_linenumber" name="L35" href="#L35">35</a> <em class="jxr_javadoccomment"> * <p></em>
-<a class="jxr_linenumber" name="L36" href="#L36">36</a> <em class="jxr_javadoccomment"> * Compares two strings.</em>
-<a class="jxr_linenumber" name="L37" href="#L37">37</a> <em class="jxr_javadoccomment"> * </p></em>
-<a class="jxr_linenumber" name="L38" href="#L38">38</a> <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="L39" href="#L39">39</a> <em class="jxr_javadoccomment"> * @param left the first string</em>
-<a class="jxr_linenumber" name="L40" href="#L40">40</a> <em class="jxr_javadoccomment"> * @param right the second string</em>
-<a class="jxr_linenumber" name="L41" href="#L41">41</a> <em class="jxr_javadoccomment"> * @return result distance</em>
-<a class="jxr_linenumber" name="L42" href="#L42">42</a> <em class="jxr_javadoccomment"> */</em>
-<a class="jxr_linenumber" name="L43" href="#L43">43</a> R compare(CharSequence left, CharSequence right);
-<a class="jxr_linenumber" name="L44" href="#L44">44</a>
-<a class="jxr_linenumber" name="L45" href="#L45">45</a> }
+<a class="jxr_linenumber" name="L20" href="#L20">20</a> <em class="jxr_javadoccomment"> * Interface for <a href='<a href="http://en.wikipedia.org/wiki/String_metric'>String" target="alexandria_uri">http://en.wikipedia.org/wiki/String_metric'>String</a> Metrics</a>.</em>
+<a class="jxr_linenumber" name="L21" href="#L21">21</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L22" href="#L22">22</a> <em class="jxr_javadoccomment"> * <p></em>
+<a class="jxr_linenumber" name="L23" href="#L23">23</a> <em class="jxr_javadoccomment"> * A string metric measures the similarity between two character sequences. Depending on</em>
+<a class="jxr_linenumber" name="L24" href="#L24">24</a> <em class="jxr_javadoccomment"> * the algorithm, higher values can mean closer strings, or more distant strings.</em>
+<a class="jxr_linenumber" name="L25" href="#L25">25</a> <em class="jxr_javadoccomment"> * </p></em>
+<a class="jxr_linenumber" name="L26" href="#L26">26</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L27" href="#L27">27</a> <em class="jxr_javadoccomment"> * @param <R> The type of similarity score unit used by this StringMetric.</em>
+<a class="jxr_linenumber" name="L28" href="#L28">28</a> <em class="jxr_javadoccomment"> */</em>
+<a class="jxr_linenumber" name="L29" href="#L29">29</a> <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">interface</strong> StringMetric<R> {
+<a class="jxr_linenumber" name="L30" href="#L30">30</a>
+<a class="jxr_linenumber" name="L31" href="#L31">31</a> <em class="jxr_javadoccomment">/**</em>
+<a class="jxr_linenumber" name="L32" href="#L32">32</a> <em class="jxr_javadoccomment"> * Compares two CharSequences.</em>
+<a class="jxr_linenumber" name="L33" href="#L33">33</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="L34" href="#L34">34</a> <em class="jxr_javadoccomment"> * @param left the first CharSequence</em>
+<a class="jxr_linenumber" name="L35" href="#L35">35</a> <em class="jxr_javadoccomment"> * @param right the second CharSequence</em>
+<a class="jxr_linenumber" name="L36" href="#L36">36</a> <em class="jxr_javadoccomment"> * @return the similarity score between two CharSequences</em>
+<a class="jxr_linenumber" name="L37" href="#L37">37</a> <em class="jxr_javadoccomment"> */</em>
+<a class="jxr_linenumber" name="L38" href="#L38">38</a> R compare(CharSequence left, CharSequence right);
+<a class="jxr_linenumber" name="L39" href="#L39">39</a>
+<a class="jxr_linenumber" name="L40" href="#L40">40</a> }
</pre>
<hr/>
-<div id="footer">Copyright © 2014 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.</div>
+<div id="footer">Copyright © 2014–2015 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.</div>
</body>
-</html>
+</html>
\ No newline at end of file
Modified: websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/package-frame.html
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/package-frame.html (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/package-frame.html Sun Mar 1 12:14:29 2015
@@ -16,7 +16,10 @@
<ul>
<li>
- <a href="FuzzyDistance.html" target="classFrame">FuzzyDistance</a>
+ <a href="FuzzyScore.html" target="classFrame">FuzzyScore</a>
+ </li>
+ <li>
+ <a href="HammingDistance.html" target="classFrame">HammingDistance</a>
</li>
<li>
<a href="JaroWrinklerDistance.html" target="classFrame">JaroWrinklerDistance</a>
Modified: websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/package-summary.html
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/package-summary.html (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/org/apache/commons/text/similarity/package-summary.html Sun Mar 1 12:14:29 2015
@@ -37,7 +37,12 @@
<tbody>
<tr>
<td>
- <a href="FuzzyDistance.html" target="classFrame">FuzzyDistance</a>
+ <a href="FuzzyScore.html" target="classFrame">FuzzyScore</a>
+ </td>
+ </tr>
+ <tr>
+ <td>
+ <a href="HammingDistance.html" target="classFrame">HammingDistance</a>
</td>
</tr>
<tr>
@@ -78,7 +83,7 @@
</div>
<hr />
<div id="footer">
- Copyright © 2014 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.
+ Copyright © 2014–2015 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.
</div>
</body>
</html>
\ No newline at end of file
Modified: websites/production/commons/content/sandbox/commons-text/xref/overview-frame.html
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/overview-frame.html (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/overview-frame.html Sun Mar 1 12:14:29 2015
@@ -16,10 +16,12 @@
<ul>
<li>
+ <a href="org/apache/commons/text/diff/package-frame.html" target="packageFrame">org.apache.commons.text.diff</a>
+ </li>
+ <li>
<a href="org/apache/commons/text/similarity/package-frame.html" target="packageFrame">org.apache.commons.text.similarity</a>
</li>
</ul>
</body>
</html>
-
Modified: websites/production/commons/content/sandbox/commons-text/xref/overview-summary.html
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/overview-summary.html (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/overview-summary.html Sun Mar 1 12:14:29 2015
@@ -35,6 +35,11 @@
<tbody>
<tr>
<td>
+ <a href="org/apache/commons/text/diff/package-summary.html">org.apache.commons.text.diff</a>
+ </td>
+ </tr>
+ <tr>
+ <td>
<a href="org/apache/commons/text/similarity/package-summary.html">org.apache.commons.text.similarity</a>
</td>
</tr>
@@ -60,7 +65,7 @@
<hr />
<div id="footer">
- Copyright © 2014 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.
+ Copyright © 2014–2015 <a href="http://www.apache.org/">The Apache Software Foundation</a>. All rights reserved.
</div>
</body>
</html>
\ No newline at end of file
Modified: websites/production/commons/content/sandbox/commons-text/xref/stylesheet.css
==============================================================================
--- websites/production/commons/content/sandbox/commons-text/xref/stylesheet.css (original)
+++ websites/production/commons/content/sandbox/commons-text/xref/stylesheet.css Sun Mar 1 12:14:29 2015
@@ -111,4 +111,4 @@ hr {
.jxr_keyword
{
color: #000;
-}
+}
\ No newline at end of file