xonecas.io
2620
Ja

js-algos / commit f96ae5d

added recursive levenshtein implementation

xonecas2013-05-01 f96ae5d4e5ec09e8853b9e826970af75ba196ec8 parent cae2d18

5 files changed

Makefile+1−0
@@ -22,5 +22,6 @@ clean:
2222 test: lint module
2323 @echo "----> Testing..."
2424 node test/sorts.js
25+ node test/levs.js
2526
2627 .PHONY: lint docs module clean test
algos.js+10−0
@@ -95,6 +95,16 @@
9595 }
9696 return list;
9797 };
98+ var fuzzy;
99+ fuzzy = algos.fuzzy = function(a, b) {
100+ if (a === b) {
101+ return 0;
102+ }
103+ if (!a.length || !b.length) {
104+ return 0;
105+ }
106+ return Math.min(fuzzy(a.substring(1), b) + 1, fuzzy(b.substring(1), a) + 1, fuzzy(a.substring(1), b.substring(1)) + (a[0] !== b[0] ? 1 : 0));
107+ };
98108 if (module && module.exports || exports) {
99109 module = module || {};
100110 exports = module.exports = algos;
algos.min.js+1−1
@@ -1 +1 @@
1-(function(){"use strict";var r,o={};r=o.insertionSort=function(r){var o,t,n,e=r.length;for(t=1;e>t;t+=1){for(o=r[t],n=t;n>0&&r[n-1]>o;)r[n]=r[n-1],n-=1;r[n]=o}return r};var t,n;t=function(r,o){for(var t=[],n=0,e=0;r.length>n&&o.length>e;)r[n]<o[e]?(t.push(r[n]),n+=1):(t.push(o[e]),e+=1);return t.concat(r.slice(n).concat(o.slice(e)))},n=o.mergeSort=function(r){if(1>=r.length)return r;var o=Math.floor(r.length/2),e=r.slice(0,o),u=r.slice(o);return t(n(e),n(u))};var e,u,f;e=function(r,o,t){var n=r[ …
1+(function(){"use strict";var r,t={};r=t.insertionSort=function(r){var t,n,o,e=r.length;for(n=1;e>n;n+=1){for(t=r[n],o=n;o>0&&r[o-1]>t;)r[o]=r[o-1],o-=1;r[o]=t}return r};var n,o;n=function(r,t){for(var n=[],o=0,e=0;r.length>o&&t.length>e;)r[o]<t[e]?(n.push(r[o]),o+=1):(n.push(t[e]),e+=1);return n.concat(r.slice(o).concat(t.slice(e)))},o=t.mergeSort=function(r){if(1>=r.length)return r;var t=Math.floor(r.length/2),e=r.slice(0,t),u=r.slice(t);return n(o(e),o(u))};var e,u,i;e=function(r,t,n){var o=r[ …
docs/algos.html+40−0
@@ -175,6 +175,46 @@ for each item in the array, create a random number within the length and swap.</
175175 <span class="p">}</span>
176176
177177 <span class="k">return</span> <span class="nx">list</span><span class="p">;</span>
178+<span class="p">};</span></pre></div> </td> </tr> <tr id="section-15"> <td class="docs"> <div class="pilwrap"> <a class="pilcrow" href="#section-15">&#182;</a> </div> <h1>Levenshtein distance (fuzzy text matching)</h1> </td> <td class="code"> <div class="highlight"><pre><span class="kd">var</span> <span class="nx">fuzzy</span><span class= …
179+<code>git</code> and <code>got</code> have a Levenshtein distance of 1, since only one edit needs to be made
180+to tranform them into equal strings. Levenshtein is not very efficient and for performance
181+concerns it should only be applied to small strings at a time, since checking a massive text
182+would take forever(ish).</p> </td> <td class="code"> <div class="highlight"><pre><span class="nx">fuzzy</span> <span class="o">=</span> <span class="nx">algos</span><span class="p">.</span><span class="nx">fuzzy</span> <span class="o">=</span> <span class="kd">function</span> <span class="p">(</span><span class="nx">a</span><span class="p">,</span> <span class="nx">b</span><span class="p">)</span> <span class="p">{</span></pre></div> </td> …
183+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="nx">a</span><span class="p">.</span><span class="nx">length</span> <span class="o">||</span> <span class="nx">b</span><span class="p">.</span><span class="nx">length</span><span class="p">)</span> <span class="p">{</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
184+
185+ <span class="kd">var</span> <span class="nx">len</span> <span class="o">=</span> <span class="nx">b</span><span class="p">.</span><span class="nx">length</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span>
186+ <span class="nx">va</span> <span class="o">=</span> <span class="p">[],</span>
187+ <span class="nx">vb</span> <span class="o">=</span> <span class="p">[],</span>
188+ <span class="nx">i</span><span class="p">,</span>
189+ <span class="nx">j</span><span class="p">,</span>
190+ <span class="nx">c</span><span class="p">;</span>
191+
192+ <span class="k">for</span> <span class="p">(</span><span class="nx">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="nx">i</span> <span class="o">&lt;</span> <span class="nx">len</span><span class="p">;</span> <span class="nx">i</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
193+ <span class="nx">va</span><span class="p">[</span><span class="nx">i</span><span class="p">]</span> <span class="o">=</span> <span class="nx">i</span><span class="p">;</span>
194+ <span class="p">}</span>
195+
196+ <span class="nx">console</span><span class="p">.</span><span class="nx">log</span><span class="p">(</span><span class="nx">va</span><span class="p">);</span>
197+
198+ <span class="k">for</span> <span class="p">(</span><span class="nx">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="nx">i</span> <span class="o">&lt;</span> <span class="nx">a</span><span class="p">.</span><span class="nx">length</span><span class="p">;</span> <span class="nx">i</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
199+ <span class="nx">va</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="nx">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">;</span>
200+
201+ <span class="k">for</span> <span class="p">(</span><span class="nx">j</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="nx">j</span> <span class="o">&lt;</span> <span class="nx">b</span><span class="p">.</span><span class="nx">length</span><span class="p">;</span> <span class="nx">j</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
202+ <span class="nx">c</span> <span class="o">=</span> <span class="p">(</span><span class="nx">a</span><span class="p">[</span><span class="nx">i</span><span class="p">]</span> <span class="o">===</span> <span class="nx">b</span><span class="p">[</span><span class="nx">j</span><span class="p">])</span> <span class="o">?</span> <span class="mi">0</span> <span class="o">:</span> <span class="mi">1</span><span class="p">;</span>
203+
204+ <span class="nx">vb</span><span class="p">[</span><span class="nx">j</span> <span class="o">+</span> <span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="nb">Math</span><span class="p">.</span><span class="nx">min</span><span class="p">(</span> <span class="nx">vb</span><span class="p">[</span><span class="nx">j</span><span class="p">]</span> <span class="o">+</span> <span class="mi">1</span><span class="p">,</span> <span class="nx">va</span><span c …
205+ <span class="p">}</span>
206+
207+ <span class="p">}</span>
208+
209+ <span class="nx">console</span><span class="p">.</span><span class="nx">log</span><span class="p">(</span><span class="nx">va</span><span class="p">);</span>
210+ <span class="nx">console</span><span class="p">.</span><span class="nx">log</span><span class="p">(</span><span class="nx">vb</span><span class="p">);</span>
211+
212+ <span class="k">for</span> <span class="p">(</span><span class="nx">j</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="nx">j</span> <span class="o">&lt;</span> <span class="nx">vb</span><span class="p">.</span><span class="nx">length</span><span class="p">;</span> <span class="nx">j</span> <span class="o">+=</span> <span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
213+ <span class="nx">va</span><span class="p">[</span><span class="nx">j</span><span class="p">]</span> <span class="o">=</span> <span class="nx">vb</span><span class="p">[</span><span class="nx">j</span><span class="p">];</span>
214+ <span class="p">}</span>
215+
216+ <span class="nx">console</span><span class="p">.</span><span class="nx">log</span><span class="p">(</span><span class="nx">vb</span><span class="p">,</span> <span class="nx">b</span><span class="p">.</span><span class="nx">length</span><span class="p">);</span>
217+ <span class="k">return</span> <span class="nx">vb</span><span class="p">[</span><span class="nx">b</span><span class="p">.</span><span class="nx">length</span><span class="p">];</span>
178218 <span class="p">};</span>
179219
180220 </pre></div> </td> </tr> </tbody> </table> </div> </body> </html>
js/algos.js+27−0
@@ -246,3 +246,30 @@ shuffle = algos.shuffle = function (list) {
246246
247247 return list;
248248 };
249+
250+
251+// Levenshtein distance (fuzzy text matching)
252+// ==========================================
253+
254+var fuzzy;
255+
256+
257+// Levenshtein distance is the number of edits to change one word into another. For example
258+// `git` and `got` have a Levenshtein distance of 1, since only one edit needs to be made
259+// to tranform them into equal strings. Levenshtein is not very efficient and for performance
260+// concerns it should only be applied to small strings at a time, since checking a massive text
261+// would take forever(ish).
262+
263+fuzzy = algos.fuzzy = function (a, b) {
264+
265+ // base cases
266+ if (a === b) { return 0; }
267+ if (!a.length || !b.length) { return 0; }
268+
269+ return Math.min(
270+ fuzzy(a.substring(1), b) + 1,
271+ fuzzy(b.substring(1), a) + 1,
272+ fuzzy(a.substring(1), b.substring(1)) + (a[0] !== b[0] ? 1 : 0)
273+ );
274+
275+};