natural 0.2.1 → 0.4.0

package/spec/jaro-winkler_spec.js

@@ -1,53 +0,0 @@
-/*
-Copyright (c) 2011, Chris Umbel
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
-
-var jaroWinklerDistance = require('../lib/natural/distance/jaro-winkler_distance')
-
-Number.prototype.approxEql = function(val) {
-    return Math.abs(this - val) < 1e-5;
-}
-
-describe('jaro-winkler', function () {
-    it('should evaluate string similarity', function () {
-        expect(jaroWinklerDistance('DIXON', 'DICKSONX').approxEql(0.81333)).toBeTruthy();
-        expect(jaroWinklerDistance('DWAYNE', 'DUANE').approxEql(0.84)).toBeTruthy();
-    });
-
-    it('should handle exact matches', function () {
-        expect(jaroWinklerDistance('RICK', 'RICK')).toBe(1);
-        expect(jaroWinklerDistance('abc', 'abc')).toBe(1);
-        expect(jaroWinklerDistance('abcd', 'abcd')).toBe(1);
-        expect(jaroWinklerDistance('seddon', 'seddon')).toBe(1);
-    });
-
-    it('should handle total mis-matches', function () {
-        expect(jaroWinklerDistance('NOT', 'SAME')).toBe(0);
-    });
-
-    it('should handle partial mis-matches', function () {
-        expect(jaroWinklerDistance('aaa', 'abcd').approxEql(0.575)).toBeTruthy();
-    });
-
-    it('should handle transpositions', function () {
-        expect(jaroWinklerDistance('MARTHA', 'MARHTA').approxEql(0.96111)).toBeTruthy();
-    });
-});

package/spec/lancaster_stemmer_spec.js

@@ -1,73 +0,0 @@
-/*
-Copyright (c) 2011, Chris Umbel
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
-
-describe('lancaster_stemmer', function() {
-    var stemmer = require('../lib/natural/stemmers/lancaster_stemmer');
-
-    it('should stem', function() {
-	stemmer.attach();
-
-        expect('marks'.stem()).toBe('mark');
-        expect('MARKs'.stem()).toBe('mark');        
-    });
-
-    it('should stop running rules where appropriate', function() {
-	stemmer.attach();
-
-        expect('living'.stem()).toBe('liv');
-        expect('thing'.stem()).toBe('thing');
-        expect('ear'.stem()).toBe('ear');
-        expect('string'.stem()).toBe('string');
-    });
-
-    it('should only pop the size specified by the rule', function() {
-	stemmer.attach();
-
-        expect('triplicate'.stem()).toBe('triply');
-        expect('triPlicAte'.stem()).toBe('triply');        
-    });
-    
-    it('should stem and append and recurse', function() {
-	stemmer.attach();
-
-        expect('classified'.stem()).toBe('class');
-        expect('ClaSsiFied'.stem()).toBe('class');        
-    });
-    
-    it('should apply intact rules only to intact string', function() {
-    stemmer.attach();
-
-        expect('maximum'.stem()).toBe('maxim');
-        expect('presumably'.stem()).toBe('presum');
-        expect('MAXIMUM'.stem()).toBe('maxim');
-        expect('PRESUMABLY'.stem()).toBe('presum');        
-    });
-
-    it('#171 and #174, exceed, anguish, affluxion, discept', function() {
-    stemmer.attach();
-
-        expect('exceed'.stem()).toBe('excess');
-        expect('anguish'.stem()).toBe('anct');
-        expect('affluxion'.stem()).toBe('affluct');
-        expect('discept'.stem()).toBe('disceiv');
-    });
-});

package/spec/levenshtein_spec.js

@@ -1,66 +0,0 @@
-/*
-Copyright (c) 2011, Chris Umbel
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
-
-var levenshteinDistance = require('../lib/natural/distance/levenshtein_distance')
-
-describe('levenshtein_distance', function() {
-	it('should replace 2', function() {
-		expect(levenshteinDistance('doctor', 'doktor')).toBe(1);
-	});	
-
-	it('should allow altering replacement value', function() {
-		expect(levenshteinDistance('doctor', 'doktor', {substitution_cost: 1})).toBe(1);
-	});	
-
-	it('should delete 1', function() {
-		expect(levenshteinDistance('doctor', 'docto')).toBe(1);
-	});
-
-	it('should insert 1', function() {
-		expect(levenshteinDistance('flat', 'flats')).toBe(1);
-	});
-
-	it('should combine operations', function() {
-		expect(levenshteinDistance('flad', 'flaten')).toBe(3);
-		expect(levenshteinDistance('flaten', 'flad')).toBe(3);
-	});
-
-	it('should consider perfect matches 0', function() {
-		expect(levenshteinDistance('one', 'one')).toBe(0);
-	});
-
-    it('different deletion cost should work', function() {
-		expect(levenshteinDistance('ones', 'one', {deletion_cost: 3})).toBe(3);
-	});
-
-    it('different insertion cost should work', function() {
-		expect(levenshteinDistance('one', 'ones', {deletion_cost: 3, insertion_cost: 5})).toBe(5);
-	});
-
-    it('delete all characters with -ve cost', function() {
-		expect(levenshteinDistance('delete', '', {deletion_cost: -1})).toBe(-6);
-	});
-
-    it('insert all characters', function() {
-		expect(levenshteinDistance('', 'insert')).toBe(6);
-	});
-});

package/spec/logistic_regression_classifier_spec.js

@@ -1,122 +0,0 @@
-/*
-Copyright (c) 2011, Chris Umbel
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
-
-var natural = new require('../lib/natural'),
-    LogisticRegressionClassifier = natural.LogisticRegressionClassifier;
-
-describe('logistic regression', function() {
-    it('should classify with individually trained documents', function() {
-        var classifier = new LogisticRegressionClassifier();
-        
-        classifier.addDocument(['have', 'computer'], 'IT');
-        classifier.addDocument(['have', 'phone'], 'IT');
-        classifier.addDocument(['computer', 'suck'], 'IT');
-        classifier.addDocument(['field', 'goal'], 'sports');
-        classifier.addDocument(['score', 'goal'], 'sports');
-        classifier.addDocument(['great', 'speed'], 'sports');
-        
-        classifier.train();
-        
-        expect(classifier.classify(['hate', 'computer'])).toBe('IT');
-        expect(classifier.classify(['score', 'please'])).toBe('sports');
-    });
-
-    it('should provide all classification scores', function() {
-        var classifier = new natural.LogisticRegressionClassifier();
-        classifier.addDocument(['fix', 'box'], 'computing');
-        classifier.addDocument(['write', 'code'], 'computing');
-        classifier.addDocument(['script', 'code'], 'computing');
-        classifier.addDocument(['write', 'book'], 'literature');
-        classifier.addDocument(['read', 'book'], 'literature');
-        classifier.addDocument(['study', 'book'], 'literature');
-
-        classifier.train();
-
-        expect(classifier.getClassifications('i write code')[0].label).toBe('computing');
-        expect(classifier.getClassifications('i write code')[1].label).toBe('literature');
-    });
-
-    it('should classify with arrays', function() {
-        var classifier = new natural.LogisticRegressionClassifier();
-        classifier.addDocument('i fixed the box', 'computing');
-        classifier.addDocument('i write code', 'computing');
-        classifier.addDocument('nasty script code', 'computing');
-        classifier.addDocument('write a book', 'literature');
-        classifier.addDocument('read a book', 'literature');
-        classifier.addDocument('study the books', 'literature');
-
-        classifier.train();
-
-        expect(classifier.classify('a bug in the code')).toBe('computing');
-        expect(classifier.classify('read all the books')).toBe('literature');
-    });
-
-    it('should serialize and deserialize a working classifier', function() {
-        var classifier = new natural.LogisticRegressionClassifier();
-        classifier.addDocument('i fixed the box', 'computing');
-        classifier.addDocument('i write code', 'computing');
-        classifier.addDocument('nasty script code', 'computing');
-        classifier.addDocument('write a book', 'literature');
-        classifier.addDocument('read a book', 'literature');
-        classifier.addDocument('study the books', 'literature');
-
-        var obj = JSON.stringify(classifier);
-        var newClassifier = natural.LogisticRegressionClassifier.restore(JSON.parse(obj));
-
-        newClassifier.addDocument('kick a ball', 'sports');
-        newClassifier.addDocument('hit some balls', 'sports');
-        newClassifier.addDocument('kick and punch', 'sports');
-
-        newClassifier.train();
-
-        expect(newClassifier.classify('a bug in the code')).toBe('computing');
-        expect(newClassifier.classify('read all the books')).toBe('literature');
-        expect(newClassifier.classify('kick butt')).toBe('sports');
-    });
-
-    it('should save and load a working classifier', function() {
-        var classifier = new natural.LogisticRegressionClassifier();
-        classifier.addDocument('i fixed the box', 'computing');
-        classifier.addDocument('i write code', 'computing');
-        classifier.addDocument('nasty script code', 'computing');
-        classifier.addDocument('write a book', 'literature');
-        classifier.addDocument('read a book', 'literature');
-        classifier.addDocument('study the books', 'literature');
-	classifier.train();
-
-	classifier.save('lr_classifier.json', function(err) {
-	    natural.LogisticRegressionClassifier.load('lr_classifier.json', null, 
-						      function(err, newClassifier){
-		newClassifier.addDocument('hit some balls', 'sports');
-		newClassifier.addDocument('kick a ball', 'sports');
-		newClassifier.addDocument('kick and punch things', 'sports');
-		newClassifier.train();
-
-		expect(newClassifier.classify('a bug in the code')).toBe('computing');
-		expect(newClassifier.classify('read all the books')).toBe('literature');
-		expect(newClassifier.classify('kick butt')).toBe('sports');
-		
-		asyncSpecDone();
-	    });
-	});
-    });
-});

package/spec/longest_path_tree_spec.js

@@ -1,102 +0,0 @@
-/*
- Copyright (c) 2014, Lee Wenzhu
-
- Permission is hereby granted, free of charge, to any person obtaining a copy
- of this software and associated documentation files (the "Software"), to deal
- in the Software without restriction, including without limitation the rights
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the Software is
- furnished to do so, subject to the following conditions:
-
- The above copyright notice and this permission notice shall be included in
- all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
- THE SOFTWARE.
- */
-'use strict';
-
-var LPT = require('../lib/natural/util/longest_path_tree'),
-    Topological = require('../lib/natural/util/topological'),
-    EdgeWeightedDigraph = require('../lib/natural/util/edge_weighted_digraph');
-
-describe("shortest path tree", function() {
-    var digraph = new EdgeWeightedDigraph();
-    digraph.add(5,4,0.35);
-    digraph.add(4,7,0.37);
-    digraph.add(5,7,0.28);
-    digraph.add(5,1,0.32);
-    digraph.add(4,0,0.38);
-    digraph.add(0,2,0.26);
-    digraph.add(3,7,0.39);
-    digraph.add(1,3,0.29);
-    digraph.add(7,2,0.34);
-    digraph.add(6,2,0.40);
-    digraph.add(3,6,0.52);
-    digraph.add(6,0,0.58);
-    digraph.add(6,4,0.93);
-    describe("edge weighted digraph normal operations", function() {
-        it("should get the numbers of vertexs", function() {
-            expect(digraph.v()).toBe(8);
-        });
-        it("should get the numbers of edges", function() {
-            expect(digraph.e()).toBe(13);
-        });
-        it("should print all item in digraph", function() {
-            expect(digraph.toString()).toBe('0 -> 2, 0.26\n' +
-                                            '1 -> 3, 0.29\n' +
-                                            '3 -> 7, 0.39\n' +
-                                            '3 -> 6, 0.52\n' +
-                                            '4 -> 7, 0.37\n' +
-                                            '4 -> 0, 0.38\n' +
-                                            '5 -> 4, 0.35\n' +
-                                            '5 -> 7, 0.28\n' +
-                                            '5 -> 1, 0.32\n' +
-                                            '6 -> 2, 0.4\n' +
-                                            '6 -> 0, 0.58\n' +
-                                            '6 -> 4, 0.93\n' +
-                                            '7 -> 2, 0.34');
-        });
-    });
-
-    describe("topo sort for digraph", function() {
-        it("should sort all the vertexs", function() {
-            var topoSort = new Topological(digraph);
-            expect(topoSort.isDAG()).toBe(true);
-            expect(topoSort.order()).toEqual([ 5, 1, 3, 6, 4, 7, 0, 2 ]);
-        });
-    });
-
-    describe("shortest path tree normal operations", function() {
-        var lpt = new LPT(digraph, 5);
-        expect(lpt.hasPathTo(0)).toBe(true);
-        expect(lpt.hasPathTo(1)).toBe(true);
-        expect(lpt.hasPathTo(2)).toBe(true);
-        expect(lpt.hasPathTo(3)).toBe(true);
-        expect(lpt.hasPathTo(4)).toBe(true);
-        expect(lpt.hasPathTo(5)).toBe(false);
-        expect(lpt.hasPathTo(6)).toBe(true);
-        expect(lpt.hasPathTo(7)).toBe(true);
-        expect(lpt.pathTo(0)).toEqual([ 5, 1, 3, 6, 4, 0 ]);
-        expect(lpt.pathTo(1)).toEqual([ 5, 1 ]);
-        expect(lpt.pathTo(2)).toEqual([ 5, 1, 3, 6, 4, 7, 2 ]);
-        expect(lpt.pathTo(3)).toEqual([ 5, 1, 3 ]);
-        expect(lpt.pathTo(4)).toEqual([ 5, 1, 3, 6, 4 ]);
-        expect(lpt.pathTo(5)).toEqual([ ]);
-        expect(lpt.pathTo(6)).toEqual([ 5, 1, 3, 6 ]);
-        expect(lpt.pathTo(7)).toEqual([ 5, 1, 3, 6, 4, 7 ]);
-        expect(lpt.getDistTo(0)).toBe(2.44);
-        expect(lpt.getDistTo(1)).toBe(0.32);
-        expect(lpt.getDistTo(2)).toBe(2.77);
-        expect(lpt.getDistTo(3)).toBe(0.61);
-        expect(lpt.getDistTo(4)).toBe(2.06);
-        expect(lpt.getDistTo(5)).toBe(0);
-        expect(lpt.getDistTo(6)).toBe(1.13);
-        expect(lpt.getDistTo(7)).toBe(2.43);
-    });
-});

package/spec/metaphone_spec.js

@@ -1,252 +0,0 @@
-/*
-Copyright (c) 2011, Chris Umbel
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
-
-var metaphone = require('../lib/natural/phonetics/metaphone');
-
-describe('metaphone', function() {    
-    it('should drop duplicate adjacent letters, except C', function() {
-        expect(metaphone.dedup('dropping')).toBe('droping');
-    });
-
-    it('should not drop duplicat C', function() {
-        expect(metaphone.dedup('accelerate')).toBe('accelerate');
-    });
-
-    it('should drop some initial letters', function() {
-        expect(metaphone.dropInitialLetters('knuth')).toBe('nuth');
-        expect(metaphone.dropInitialLetters('gnat')).toBe('nat');
-        expect(metaphone.dropInitialLetters('aegis')).toBe('egis');
-        expect(metaphone.dropInitialLetters('pneumatic')).toBe('neumatic');
-        expect(metaphone.dropInitialLetters('wrack')).toBe('rack');
-    });
-    
-    it('should not drop other initial letters', function() {
-        expect(metaphone.dropInitialLetters('garbage')).toBe('garbage');
-    });
- 
-    it('should b if if words end with mb', function() {
-        expect(metaphone.dropBafterMAtEnd('dumb')).toBe('dum');
-    });
-
-    it('should not drop b after m if not at end of word', function() {
-        expect(metaphone.dropBafterMAtEnd('dumbo')).toBe('dumbo');
-    });
-    
-    it('should replace CH to X', function() {
-        expect(metaphone.cTransform('change')).toBe('xhange');
-    });
-    
-    it('should not replace CH to X if part of SCH', function() {
-        expect(metaphone.cTransform('discharger')).toBe('diskharger');
-    });
-    
-    it('should replace CIA to X', function() {
-        expect(metaphone.cTransform('aesthetician')).toBe('aesthetixian');
-    });
-    
-    it('C should become S if followed by I, E, or Y', function() {
-        expect(metaphone.cTransform('cieling')).toBe('sieling');        
-    });
-    
-    it('should transform other C\'s to K', function() {
-        expect(metaphone.cTransform('cuss')).toBe('kuss');        
-    });
-
-    it('should transform D to J if followed by GE, GY, GI', function() {
-        expect(metaphone.dTransform('abridge')).toBe('abrijge');
-    });
-    
-    it('should transform D to T if not followed by GE, GY, GI', function() {
-        expect(metaphone.dTransform('bid')).toBe('bit');
-    });
-    
-    it('should drop G before H if not at the end or before vowell', function() {
-        expect(metaphone.dropG('alight')).toBe('aliht');
-        expect(metaphone.dropG('fright')).toBe('friht');        
-    });
-    
-    it('should drop G if followed by N or NED at the end', function() {
-        expect(metaphone.dropG('aligned')).toBe('alined');
-        expect(metaphone.dropG('align')).toBe('alin');        
-    });
-
-    
-    it('should transform G to J if followed by I, E or Y and not preceeded by G', function() {
-        expect(metaphone.transformG('age')).toBe('aje');
-        expect(metaphone.transformG('gin')).toBe('jin');        
-    });
-    
-    it('should transform G to K', function() {
-        expect(metaphone.transformG('august')).toBe('aukust');        
-    });
-    
-    it('should reduce GG to G before turning to K', function() {
-        expect(metaphone.transformG('aggrade')).toBe('akrade');        
-    });
-    
-    it('should drop H if after vowell and not before vowell', function() {
-        expect(metaphone.dropH('alriht')).toBe('alrit');        
-    });
-
-    it('should not drop H if after vowell', function() {
-        expect(metaphone.dropH('that')).toBe('that');        
-    });
-
-    it('should not drop H if not before vowell', function() {
-        expect(metaphone.dropH('chump')).toBe('chump');        
-    });
-    
-    it('should transform CK to K', function() {
-        expect(metaphone.transformCK('check')).toBe('chek');        
-    });
-    
-    it('should transform PH to F', function() {
-        expect(metaphone.transformPH('phone')).toBe('fone');        
-    });
-    
-    it('should transform Q to K', function() {
-        expect(metaphone.transformQ('quack')).toBe('kuack');        
-    });
-    
-    it('should transform S to X if followed by H, IO, or IA', function() {
-        expect(metaphone.transformS('shack')).toBe('xhack');
-        expect(metaphone.transformS('sialagogues')).toBe('xialagogues');
-        expect(metaphone.transformS('asia')).toBe('axia');        
-    });
-    
-    it('should not transform S to X if not followed by H, IO, or IA', function() {
-        expect(metaphone.transformS('substance')).toBe('substance');        
-    });
-    
-    it('should transform T to X if followed by IA or IO', function() {
-        expect(metaphone.transformT('dementia')).toBe('demenxia');
-        expect(metaphone.transformT('abbreviation')).toBe('abbreviaxion');        
-    });
-    
-    it('should transform TH to 0', function() {
-        expect(metaphone.transformT('that')).toBe('0at');        
-    });
-
-    it('should drop T if followed by CH', function() {
-        expect(metaphone.dropT('backstitch')).toBe('backstich');        
-    });
-    
-    it('should transform V to F', function() {
-        expect(metaphone.transformV('vestige')).toBe('festige');        
-    });
-    
-    it('should transform WH to W if at beginning', function() {
-        expect(metaphone.transformWH('whisper')).toBe('wisper');        
-    });
-    
-    it('should drop W if not followed by vowell', function() {
-        expect(metaphone.dropW('bowl')).toBe('bol');
-        expect(metaphone.dropW('warsaw')).toBe('warsa');
-    });
-
-    it('should transform X to S if at beginning', function() {
-        expect(metaphone.transformX('xenophile')).toBe('senophile');
-    });
-    
-    it('should transform X to KS if not at beginning', function() {
-        expect(metaphone.transformX('admixed')).toBe('admiksed');
-    });
-    
-    it('should drop Y of not followed by a vowell', function() {
-        expect(metaphone.dropY('analyzer')).toBe('analzer');
-        expect(metaphone.dropY('specify')).toBe('specif');            
-    });
-
-    it('should not drop Y of followed by a vowell', function() {
-        expect(metaphone.dropY('allying')).toBe('allying');
-    });
-    
-    it('should transform Z to S', function() {
-        expect(metaphone.transformZ('blaze')).toBe('blase');
-    });
-
-    it('should drop all vowels except initial', function() {
-        expect(metaphone.dropVowels('ablaze')).toBe('ablz');
-        expect(metaphone.dropVowels('adamantium')).toBe('admntm');            
-    });
-    
-    it('should do all', function() {
-        expect(metaphone.process('ablaze')).toBe('ABLS');
-        expect(metaphone.process('transition')).toBe('TRNSXN');
-        expect(metaphone.process('astronomical')).toBe('ASTRNMKL');
-        expect(metaphone.process('buzzard')).toBe('BSRT');
-        expect(metaphone.process('wonderer')).toBe('WNTRR');
-        expect(metaphone.process('district')).toBe('TSTRKT');
-        expect(metaphone.process('hockey')).toBe('HK');
-        expect(metaphone.process('capital')).toBe('KPTL');
-        expect(metaphone.process('penguin')).toBe('PNKN');
-        expect(metaphone.process('garbonzo')).toBe('KRBNS');
-        expect(metaphone.process('lightning')).toBe('LTNNK');
-        expect(metaphone.process('light')).toBe('LT');
-    });
-
-    it('should compare strings', function() {
-        expect(metaphone.compare('phonetics', 'fonetix')).toBeTruthy();
-        expect(metaphone.compare('phonetics', 'garbonzo')).toBeFalsy();
-        expect(metaphone.compare('PHONETICS', 'fonetix')).toBeTruthy();
-        expect(metaphone.compare('PHONETICS', 'garbonzo')).toBeFalsy();
-    });
-    
-    it('#173', function() {
-        //expect(metaphone.process('caesar')).toBe('KSR');   
-        //expect(metaphone.process('chemical')).toBe('KMKL');   
-    });
-
-    it('should compare strings with string patch', function() {
-        metaphone.attach();
-        expect('phonetics'.soundsLike('fonetix')).toBeTruthy();
-        expect('phonetics'.soundsLike('garbonzo')).toBeFalsy();
-        expect('PHONETICS'.soundsLike('fonetix')).toBeTruthy();
-        expect('PHONETICS'.soundsLike('garbonzo')).toBeFalsy();        
-    });
-    
-    it('should return string phonetics with string patch', function() {
-        metaphone.attach();
-        expect('phonetics'.phonetics()).toBe('FNTKS');
-        expect('PHONETICS'.phonetics()).toBe('FNTKS');        
-    });
-
-    it('should transform PH to F #169', function() {
-	    expect('pharaoh'.phonetics()).toBe('FR');        
-	    expect('tough'.phonetics()).toBe('TF');        
-    });
-    
-    it('should tokenize and return string phonetics with string patch', function() {
-        metaphone.attach();
-        expect('phonetics'.tokenizeAndPhoneticize()).toEqual(['FNTKS']);
-        expect('phonetics garbonzo'.tokenizeAndPhoneticize()).toEqual(['FNTKS', 'KRBNS']);
-        expect('phonetics garbonzo lightning'.tokenizeAndPhoneticize()).toEqual(['FNTKS', 'KRBNS', 'LTNNK']);
-    });     
-
-    it('should truncate to length specified if code exceeds', function() {
-        expect(metaphone.process('phonetics', 4)).toBe('FNTK');        
-    });
-
-    it('should not truncate to length specified if code does not exceed', function() {
-        expect(metaphone.process('phonetics', 8)).toBe('FNTKS');
-    });    
-});