natural 0.2.1 → 0.4.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (106) hide show
  1. package/.npmignore +4 -11
  2. package/README.md +156 -41
  3. package/bayes_classifier.json +1 -0
  4. package/lib/natural/brill_pos_tagger/data/Dutch/README.txt +2 -0
  5. package/lib/natural/brill_pos_tagger/data/Dutch/brill_CONTEXTRULES.jg +285 -0
  6. package/lib/natural/brill_pos_tagger/data/Dutch/brill_LEXICON.jg +11699 -0
  7. package/lib/natural/brill_pos_tagger/data/English/README.txt +8 -0
  8. package/lib/natural/brill_pos_tagger/data/English/lexicon_from_posjs.json +297827 -0
  9. package/lib/natural/brill_pos_tagger/data/English/tr_from_brill_paper.txt +10 -0
  10. package/lib/natural/brill_pos_tagger/data/English/tr_from_posjs.txt +18 -0
  11. package/lib/natural/brill_pos_tagger/lib/Brill_POS_Tagger.js +136 -0
  12. package/lib/natural/brill_pos_tagger/lib/Predicate.js +410 -0
  13. package/lib/natural/brill_pos_tagger/lib/TF_Parser.js +717 -0
  14. package/lib/natural/brill_pos_tagger/lib/TF_Parser.pegjs +55 -0
  15. package/lib/natural/brill_pos_tagger/lib/TransformationRule.js +49 -0
  16. package/lib/natural/classifiers/bayes_classifier.js +6 -5
  17. package/lib/natural/classifiers/classifier.js +3 -2
  18. package/lib/natural/classifiers/logistic_regression_classifier.js +9 -5
  19. package/lib/natural/distance/dice_coefficient.js +22 -12
  20. package/lib/natural/index.js +6 -0
  21. package/lib/natural/ngrams/ngrams.js +4 -0
  22. package/lib/natural/stemmers/stemmer.js +31 -6
  23. package/lib/natural/tokenizers/regexp_tokenizer.js +3 -3
  24. package/{examples/inflection/noun.js → lib/natural/tokenizers/sentence_tokenizer.js} +14 -10
  25. package/lib/natural/tokenizers/tokenizer_case.js +58 -0
  26. package/lib/natural/util/bag.js +1 -0
  27. package/lib/natural/wordnet/wordnet.js +2 -2
  28. package/lib/natural/wordnet/wordnet_file.js +1 -1
  29. package/lr_classifier.json +1 -0
  30. package/package.json +6 -3
  31. package/package.json~ +66 -0
  32. package/benchmarks/index.js +0 -32
  33. package/benchmarks/metaphone.js +0 -27
  34. package/benchmarks/soundex.js +0 -27
  35. package/examples/classification/basic.js +0 -35
  36. package/examples/classification/recall.js +0 -28
  37. package/examples/classification/store.js +0 -37
  38. package/examples/inflection/count.js +0 -35
  39. package/examples/inflection/noun_attach.js +0 -33
  40. package/examples/phonetics/compare.js +0 -39
  41. package/examples/phonetics/sounds_like.js +0 -40
  42. package/examples/phonetics/tokenize_and_phoneticize.js +0 -54
  43. package/examples/stemming/stem_corpus.js +0 -29
  44. package/examples/stemming/stem_word.js +0 -26
  45. package/examples/tfidf/array_example.js +0 -34
  46. package/examples/tfidf/multiple_terms.js +0 -33
  47. package/examples/tfidf/tfidf_example.js +0 -44
  48. package/io_spec/test_data/tfidf/one +0 -1
  49. package/io_spec/test_data/tfidf/two +0 -1
  50. package/io_spec/tfidf_spec.js +0 -50
  51. package/io_spec/wordnet_spec.js +0 -81
  52. package/spec/aggressive_tokenizer_es_spec.js +0 -36
  53. package/spec/aggressive_tokenizer_fr_spec.js +0 -101
  54. package/spec/aggressive_tokenizer_nl_spec.js +0 -36
  55. package/spec/aggressive_tokenizer_pt_spec.js +0 -56
  56. package/spec/aggressive_tokenizer_spec.js +0 -56
  57. package/spec/bayes_classifier_spec.js +0 -173
  58. package/spec/classifier_spec.js +0 -175
  59. package/spec/count_inflector_fr_spec.js +0 -44
  60. package/spec/count_inflector_spec.js +0 -73
  61. package/spec/dice_coefficient_spec.js +0 -26
  62. package/spec/double_metaphone_spec.js +0 -752
  63. package/spec/jaro-winkler_spec.js +0 -53
  64. package/spec/lancaster_stemmer_spec.js +0 -73
  65. package/spec/levenshtein_spec.js +0 -66
  66. package/spec/logistic_regression_classifier_spec.js +0 -122
  67. package/spec/longest_path_tree_spec.js +0 -102
  68. package/spec/metaphone_spec.js +0 -252
  69. package/spec/ngram_spec.js +0 -130
  70. package/spec/ngram_zh_spec.js +0 -122
  71. package/spec/normalizer_ja_spec.js +0 -160
  72. package/spec/normalizer_no_spec.js +0 -111
  73. package/spec/normalizer_spec.js +0 -140
  74. package/spec/noun_inflector_fr_spec.js +0 -476
  75. package/spec/noun_inflector_ja_spec.js +0 -112
  76. package/spec/noun_inflector_spec.js +0 -270
  77. package/spec/porter_stemmer_fr_spec.js +0 -101
  78. package/spec/porter_stemmer_it_spec.js +0 -44
  79. package/spec/porter_stemmer_no_spec.js +0 -143
  80. package/spec/porter_stemmer_pt_spec.js +0 -50
  81. package/spec/porter_stemmer_ru_spec.js +0 -63
  82. package/spec/porter_stemmer_spec.js +0 -182
  83. package/spec/present_verb_inflector_spec.js +0 -128
  84. package/spec/remove_diacritics_spec.js +0 -31
  85. package/spec/sentence_analyzer_spec.js +0 -277
  86. package/spec/shortest_path_tree_spec.js +0 -132
  87. package/spec/soundex_spec.js +0 -158
  88. package/spec/spellcheck_spec.js +0 -92
  89. package/spec/stemmer_ja_spec.js +0 -66
  90. package/spec/stemmer_token_spec.js +0 -161
  91. package/spec/test_data/snowball_fr.txt +0 -20402
  92. package/spec/test_data/snowball_it.txt +0 -35482
  93. package/spec/test_data/snowball_no.txt +0 -20628
  94. package/spec/test_data/snowball_pt.txt +0 -32016
  95. package/spec/test_data/tfdif_testcorpus.txt +0 -7
  96. package/spec/test_data/tfidf_document1.txt +0 -1
  97. package/spec/test_data/tfidf_document2.txt +0 -1
  98. package/spec/test_data/tfidf_document3.txt +0 -1
  99. package/spec/test_data/tfidf_document4.txt +0 -1
  100. package/spec/test_data/tfidf_teststopwords.txt +0 -1
  101. package/spec/test_data/wordnet_mini.sql +0 -95
  102. package/spec/tfidf_spec.js +0 -323
  103. package/spec/tokenizer_ja_spec.js +0 -58
  104. package/spec/transliterator_ja_spec.js +0 -103
  105. package/spec/treebank_word_tokenizer_spec.js +0 -36
  106. package/spec/trie_spec.js +0 -206
@@ -0,0 +1,55 @@
1
+ {
2
+ var TransformationRule = require("./TransformationRule");
3
+ }
4
+
5
+ transformation_rules = rules: (S transformation_rule S) +
6
+ {
7
+ var result = [];
8
+
9
+ for (var i = 0; i < rules.length; i++) {
10
+ result.push(rules[i][1]);
11
+ }
12
+ return(result);
13
+ }
14
+
15
+ transformation_rule = c1: category1 c2: category2 pred: predicate par1: parameter par2: parameter ?
16
+ {
17
+ // Construct rule
18
+ var result = new TransformationRule(c1, c2, pred, par1, par2);
19
+ return(result);
20
+ }
21
+
22
+ category1 = wild_card / identifier
23
+
24
+ category2 = identifier
25
+
26
+ predicate = identifier
27
+
28
+ parameter = identifier
29
+
30
+ identifier =
31
+ characters: [a-zA-Z_0-9_\-\.,()]+ S_no_eol
32
+ {
33
+ var s = "";
34
+ for (var i = 0; i < characters.length; i++) {
35
+ s += characters[i];
36
+ }
37
+ return(s);
38
+ }
39
+
40
+ wild_card = wc: "*" S_no_eol
41
+ {
42
+ return(wc)
43
+ }
44
+
45
+ // Blanks
46
+ EOL =
47
+ '\r\n' / '\n' / '\r'
48
+ Comment =
49
+ "\/\/" (!EOL .)* (EOL/EOI)
50
+ S =
51
+ (' ' / '\t' / EOL / Comment)*
52
+ S_no_eol =
53
+ (' ' / '\t' / Comment)*
54
+ EOI=
55
+ !.
@@ -0,0 +1,49 @@
1
+ /*
2
+ Transformation rules for the Brill tagger
3
+ Copyright (C) 2015 Hugo W.L. ter Doest
4
+
5
+ This program is free software: you can redistribute it and/or modify
6
+ it under the terms of the GNU General Public License as published by
7
+ the Free Software Foundation, either version 3 of the License, or
8
+ (at your option) any later version.
9
+
10
+ This program is distributed in the hope that it will be useful,
11
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
12
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13
+ GNU General Public License for more details.
14
+
15
+ You should have received a copy of the GNU General Public License
16
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
17
+ */
18
+
19
+ var log4js = require('log4js');
20
+ var logger = log4js.getLogger();
21
+
22
+ var Predicate = require("./Predicate");
23
+
24
+ logger.setLevel('ERROR');
25
+
26
+ var category_wild_card = "*";
27
+
28
+ function TransformationRule(c1, c2, predicate, parameter1, parameter2) {
29
+ this.literal = [c1, c2, predicate, parameter1, parameter2];
30
+ this.predicate = new Predicate(predicate, parameter1, parameter2);
31
+ this.old_category = c1;
32
+ this.new_category = c2;
33
+ logger.debug('TransformationRule constructor: ' + this.literal);
34
+ }
35
+
36
+ TransformationRule.prototype.apply = function(tagged_sentence, position) {
37
+ if ((tagged_sentence[position][1] === this.old_category) ||
38
+ (this.old_category === category_wild_card)) {
39
+ if (this.predicate.evaluate(tagged_sentence, position)) {
40
+ tagged_sentence[position][1] = this.new_category;
41
+ logger.debug('TransformationRule.apply: changed category ' +
42
+ this.old_category + ' to ' + this.new_category +
43
+ ' at position ' + position);
44
+ }
45
+ }
46
+ };
47
+
48
+ module.exports = TransformationRule;
49
+
@@ -20,10 +20,9 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20
20
  THE SOFTWARE.
21
21
  */
22
22
 
23
- var PorterStemmer = require('../stemmers/porter_stemmer'),
24
- util = require('util'),
25
- Classifier = require('./classifier'),
26
- ApparatusBayesClassifier = require('apparatus').BayesClassifier;
23
+ var util = require('util'),
24
+ Classifier = require('./classifier'),
25
+ ApparatusBayesClassifier = require('apparatus').BayesClassifier;
27
26
 
28
27
  var BayesClassifier = function(stemmer, smoothing) {
29
28
  var abc = new ApparatusBayesClassifier();
@@ -48,7 +47,9 @@ function load(filename, stemmer, callback) {
48
47
  if (err) {
49
48
  callback(err);
50
49
  }
51
- callback(err, restore(classifier, stemmer));
50
+ else {
51
+ callback(err, restore(classifier, stemmer));
52
+ }
52
53
  });
53
54
  }
54
55
 
@@ -47,8 +47,9 @@ function addDocument(text, classification) {
47
47
  text: text
48
48
  });
49
49
 
50
- for(var i = 0; i < text.length; i++) {
51
- this.features[text[i]] = 1;
50
+ for (var i = 0; i < text.length; i++) {
51
+ var token = text[i];
52
+ this.features[token] = (this.features[token] || 0) + 1;
52
53
  }
53
54
  }
54
55
 
@@ -20,10 +20,9 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20
20
  THE SOFTWARE.
21
21
  */
22
22
 
23
- var PorterStemmer = require('../stemmers/porter_stemmer'),
24
- util = require('util'),
25
- Classifier = require('./classifier'),
26
- ApparatusLogisticRegressionClassifier = require('apparatus').LogisticRegressionClassifier;
23
+ var util = require('util'),
24
+ Classifier = require('./classifier'),
25
+ ApparatusLogisticRegressionClassifier = require('apparatus').LogisticRegressionClassifier;
27
26
 
28
27
  var LogisticRegressionClassifier = function(stemmer) {
29
28
  Classifier.call(this, new ApparatusLogisticRegressionClassifier(), stemmer);
@@ -41,7 +40,12 @@ function restore(classifier, stemmer) {
41
40
 
42
41
  function load(filename, stemmer, callback) {
43
42
  Classifier.load(filename, function(err, classifier) {
44
- callback(err, restore(classifier, stemmer));
43
+ if (err) {
44
+ callback(err);
45
+ }
46
+ else {
47
+ callback(err, restore(classifier, stemmer));
48
+ }
45
49
  });
46
50
  }
47
51
 
@@ -48,22 +48,32 @@ var sanitize = function (str) {
48
48
 
49
49
  // Compare two strings, and spit out a number from 0-1
50
50
  var compare = function (str1, str2) {
51
- var pairs1 = wordLetterPairs(sanitize(str1));
52
- var pairs2 = wordLetterPairs(sanitize(str2));
51
+ var sanitized_str1 = sanitize(str1);
52
+ var sanitized_str2 = sanitize(str2);
53
+ var pairs1 = wordLetterPairs(sanitized_str1);
54
+ var pairs2 = wordLetterPairs(sanitized_str2);
53
55
  var intersection = 0, union = pairs1.length + pairs2.length;
54
- var i, j, pair1, pair2;
55
- for (i = 0; i < pairs1.length; i++) {
56
- pair1 = pairs1[i];
57
- for (j = 0; j < pairs2.length; j++) {
58
- pair2 = pairs2[j];
59
- if (pair1 == pair2) {
60
- intersection ++;
61
- delete pairs2[j];
62
- break;
56
+ if (union === 0) {
57
+ if (sanitized_str1 === sanitized_str2) {
58
+ return 1;
59
+ } else {
60
+ return 0;
61
+ }
62
+ } else {
63
+ var i, j, pair1, pair2;
64
+ for (i = 0; i < pairs1.length; i++) {
65
+ pair1 = pairs1[i];
66
+ for (j = 0; j < pairs2.length; j++) {
67
+ pair2 = pairs2[j];
68
+ if (pair1 == pair2) {
69
+ intersection ++;
70
+ delete pairs2[j];
71
+ break;
72
+ }
63
73
  }
64
74
  }
75
+ return 2 * intersection / union;
65
76
  }
66
- return 2 * intersection / union;
67
77
  };
68
78
 
69
79
  module.exports = compare;
@@ -31,12 +31,14 @@ exports.PorterStemmerRu = require('./stemmers/porter_stemmer_ru');
31
31
  exports.PorterStemmerEs = require('./stemmers/porter_stemmer_es');
32
32
  exports.PorterStemmerIt = require('./stemmers/porter_stemmer_it');
33
33
  exports.PorterStemmerNo = require('./stemmers/porter_stemmer_no');
34
+ exports.PorterStemmerPt = require('./stemmers/porter_stemmer_pt');
34
35
  exports.LancasterStemmer = require('./stemmers/lancaster_stemmer');
35
36
  exports.StemmerFr = require('./stemmers/stemmer_fr');
36
37
  exports.StemmerPl = require('./stemmers/stemmer_pl');
37
38
  exports.StemmerJa = require('./stemmers/stemmer_ja');
38
39
  exports.AggressiveTokenizerNl = require('./tokenizers/aggressive_tokenizer_nl');
39
40
  exports.AggressiveTokenizerFa = require('./tokenizers/aggressive_tokenizer_fa');
41
+ exports.AggressiveTokenizerFr = require('./tokenizers/aggressive_tokenizer_fr');
40
42
  exports.AggressiveTokenizerRu = require('./tokenizers/aggressive_tokenizer_ru');
41
43
  exports.AggressiveTokenizerEs = require('./tokenizers/aggressive_tokenizer_es');
42
44
  exports.AggressiveTokenizerIt = require('./tokenizers/aggressive_tokenizer_it');
@@ -44,11 +46,13 @@ exports.AggressiveTokenizerPl = require('./tokenizers/aggressive_tokenizer_pl');
44
46
  exports.AggressiveTokenizerPt = require('./tokenizers/aggressive_tokenizer_pt');
45
47
  exports.AggressiveTokenizerNo = require('./tokenizers/aggressive_tokenizer_no');
46
48
  exports.AggressiveTokenizer = require('./tokenizers/aggressive_tokenizer');
49
+ exports.CaseTokenizer = require('./tokenizers/tokenizer_case');
47
50
  exports.RegexpTokenizer = require('./tokenizers/regexp_tokenizer').RegexpTokenizer;
48
51
  exports.WordTokenizer = require('./tokenizers/regexp_tokenizer').WordTokenizer;
49
52
  exports.WordPunctTokenizer = require('./tokenizers/regexp_tokenizer').WordPunctTokenizer;
50
53
  exports.TreebankWordTokenizer = require('./tokenizers/treebank_word_tokenizer');
51
54
  exports.TokenizerJa = require('./tokenizers/tokenizer_ja');
55
+ exports.SentenceTokenizer = require('./tokenizers/sentence_tokenizer');
52
56
  exports.BayesClassifier = require('./classifiers/bayes_classifier');
53
57
  exports.LogisticRegressionClassifier = require('./classifiers/logistic_regression_classifier');
54
58
  exports.NounInflector = require('./inflectors/noun_inflector');
@@ -62,6 +66,7 @@ exports.Trie = require('./trie/trie');
62
66
  exports.SentenceAnalyzer = require('./analyzers/sentence_analyzer');
63
67
  exports.stopwords = require('./util/stopwords').words;
64
68
  exports.ShortestPathTree = require('./util/shortest_path_tree');
69
+ exports.Spellcheck = require('./spellcheck/spellcheck');
65
70
  exports.LongestPathTree = require('./util/longest_path_tree');
66
71
  exports.EdgeWeightedDigraph = require('./util/edge_weighted_digraph');
67
72
  exports.NGrams = require('./ngrams/ngrams');
@@ -73,3 +78,4 @@ exports.normalize = require('./normalizers/normalizer').normalize_tokens;
73
78
  exports.normalize_ja = require('./normalizers/normalizer_ja').normalize_ja;
74
79
  exports.removeDiacritics = require('./normalizers/remove_diacritics');
75
80
  exports.transliterate_ja = require('./transliterators/ja');
81
+ exports.BrillPOSTagger = require('./brill_pos_tagger/lib/Brill_POS_Tagger');
@@ -42,6 +42,10 @@ exports.trigrams = function(sequence, startSymbol, endSymbol) {
42
42
  return ngrams(sequence, 3, startSymbol, endSymbol);
43
43
  }
44
44
 
45
+ exports.multrigrams = function(sequence, n, startSymbol, endSymbol) {
46
+ return ngrams(sequence, n, startSymbol, endSymbol);
47
+ }
48
+
45
49
  var ngrams = function(sequence, n, startSymbol, endSymbol) {
46
50
  var result = [];
47
51
 
@@ -38,14 +38,39 @@ module.exports = function() {
38
38
  stopwords.words = stopwords.words.concat(moreStopWords);
39
39
  };
40
40
 
41
+ stemmer.removeStopWord = function(stopWord) {
42
+ this.removeStopWords([stopWord])
43
+ };
44
+
45
+ stemmer.removeStopWords = function(moreStopWords) {
46
+ moreStopWords.forEach(function(stopWord){
47
+ var idx = stopwords.words.indexOf(stopWord);
48
+ if (idx >= 0) {
49
+ stopwords.words.splice(idx, 1);
50
+ }
51
+ });
52
+
53
+ };
54
+
55
+
41
56
  stemmer.tokenizeAndStem = function(text, keepStops) {
42
57
  var stemmedTokens = [];
43
-
44
- new Tokenizer().tokenize(text).forEach(function(token) {
45
- if(keepStops || stopwords.words.indexOf(token) == -1)
58
+ var lowercaseText = text.toLowerCase();
59
+ var tokens = new Tokenizer().tokenize(lowercaseText);
60
+
61
+ if (keepStops) {
62
+ tokens.forEach(function(token) {
46
63
  stemmedTokens.push(stemmer.stem(token));
47
- });
48
-
64
+ });
65
+ }
66
+
67
+ else {
68
+ tokens.forEach(function(token) {
69
+ if (stopwords.words.indexOf(token) == -1)
70
+ stemmedTokens.push(stemmer.stem(token));
71
+ });
72
+ }
73
+
49
74
  return stemmedTokens;
50
75
  };
51
76
 
@@ -53,7 +78,7 @@ module.exports = function() {
53
78
  String.prototype.stem = function() {
54
79
  return stemmer.stem(this);
55
80
  };
56
-
81
+
57
82
  String.prototype.tokenizeAndStem = function(keepStops) {
58
83
  return stemmer.tokenizeAndStem(this, keepStops);
59
84
  };
@@ -62,7 +62,7 @@ exports.RegexpTokenizer = RegexpTokenizer;
62
62
  *
63
63
  */
64
64
  var WordTokenizer = function(options) {
65
- this._pattern = /\W+/;
65
+ this._pattern = /[^A-Za-zА-Яа-я0-9_]+/;
66
66
  RegexpTokenizer.call(this,options)
67
67
  };
68
68
 
@@ -74,11 +74,11 @@ exports.WordTokenizer = WordTokenizer;
74
74
  * non-alphabetic characters. E.g.:
75
75
  *
76
76
  * >>> WordPunctTokenizer().tokenize("She said 'hello'.")
77
- * ['She', 'said', "'", 'hello', "'."]
77
+ * ["She","said","'","hello","'","."]
78
78
  *
79
79
  */
80
80
  var WordPunctTokenizer = function(options) {
81
- this._pattern = new RegExp(/(\w+|\!|\'|\"")/i);
81
+ this._pattern = new RegExp(/(\w+|[а-я0-9_]+|\.|\!|\'|\"")/i);
82
82
  RegexpTokenizer.call(this,options)
83
83
  };
84
84
 
@@ -20,18 +20,22 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20
20
  THE SOFTWARE.
21
21
  */
22
22
 
23
- var natural = require('natural'),
24
- nounInflector = new natural.NounInflector();
23
+ var Tokenizer = require('./tokenizer'),
24
+ util = require('util');
25
25
 
26
- plural = nounInflector.pluralize('radius');
27
- console.log(plural);
26
+ var SentenceTokenizer = function() {
27
+ Tokenizer.call(this);
28
+ };
29
+ util.inherits(SentenceTokenizer, Tokenizer);
28
30
 
29
- plural = nounInflector.pluralize('beer');
30
- console.log(plural);
31
+ SentenceTokenizer.prototype.tokenize = function(text) {
32
+ // break string up in to sentences based on punctation and quotation marks
33
+ var tokens = text.match(/([\"\'\‘\“\'\"\[\(\{\⟨][^\.\?\!]+[\.\?\!][\"\'\’\”\'\"\]\)\}\⟩]|[^\.\?\!]+[\.\?\!])\s?/g);
31
34
 
32
- singular = nounInflector.singularize('radii');
33
- console.log(singular);
35
+ // remove unecessary white space
36
+ tokens = tokens.map(Function.prototype.call, String.prototype.trim);
34
37
 
35
- singular = nounInflector.singularize('beers');
36
- console.log(singular);
38
+ return this.trim(tokens);
39
+ };
37
40
 
41
+ module.exports = SentenceTokenizer;
@@ -0,0 +1,58 @@
1
+ /*
2
+ Copyright (c) 2011, Chris Umbel, Alex Langberg
3
+
4
+ Permission is hereby granted, free of charge, to any person obtaining a copy
5
+ of this software and associated documentation files (the "Software"), to deal
6
+ in the Software without restriction, including without limitation the rights
7
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8
+ copies of the Software, and to permit persons to whom the Software is
9
+ furnished to do so, subject to the following conditions:
10
+
11
+ The above copyright notice and this permission notice shall be included in
12
+ all copies or substantial portions of the Software.
13
+
14
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20
+ THE SOFTWARE.
21
+ */
22
+
23
+ var Tokenizer = require('./tokenizer'),
24
+ util = require('util'),
25
+ CaseTokenizer = function() {
26
+ Tokenizer.call(this);
27
+ };
28
+
29
+ util.inherits(CaseTokenizer, Tokenizer);
30
+
31
+ CaseTokenizer.prototype.attach = function() {
32
+ var self = this;
33
+
34
+ String.prototype.tokenize = function(preserveApostrophe) {
35
+ return self.tokenize(this, preserveApostrophe);
36
+ }
37
+ };
38
+
39
+ // Idea from Seagull: http://stackoverflow.com/a/26482650
40
+ CaseTokenizer.prototype.tokenize = function(text, preserveApostrophe) {
41
+ var whitelist = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9'];
42
+ var lower = text.toLowerCase();
43
+ var upper = text.toUpperCase();
44
+ var result = '';
45
+ var i;
46
+
47
+ for (i = 0; i < lower.length; ++i) {
48
+ if (lower[i] !== upper[i] || whitelist.indexOf(lower[i]) > -1 || (text[i] === '\'' && preserveApostrophe)) {
49
+ result += text[i];
50
+ } else {
51
+ result += ' ';
52
+ }
53
+ }
54
+
55
+ return this.trim(result.replace(/\s+/g, ' ').split(' '));
56
+ };
57
+
58
+ module.exports = CaseTokenizer;
@@ -28,6 +28,7 @@ function Bag() {
28
28
 
29
29
  Bag.prototype.add = function(element) {
30
30
  this.dictionary.push(element);
31
+ this.nElement++;
31
32
  return this;
32
33
  };
33
34
 
@@ -137,9 +137,9 @@ function WordNet(dataDir) {
137
137
 
138
138
  if (!dataDir) {
139
139
  try {
140
- var WNdb = require('WNdb');
140
+ var WNdb = require('wordnet-db');
141
141
  } catch(e) {
142
- console.error("Please 'npm install WNdb' before using WordNet module or specify a dict directory.");
142
+ console.error("Please 'npm install wordnet-db' before using WordNet module or specify a dict directory.");
143
143
  throw e;
144
144
  }
145
145
  dataDir = WNdb.path;
@@ -37,7 +37,7 @@ function appendLineChar(fd, pos, buffPos, buff, callback) {
37
37
  console.log(err);
38
38
  else {
39
39
  if(buff[buffPos] == 10 || buffPos == buff.length)
40
- callback(buff.slice(0, buffPos).toString('ASCII'));
40
+ callback(buff.slice(0, buffPos).toString('UTF-8'));
41
41
  else {
42
42
  appendLineChar(fd, pos + 1, buffPos + 1, buff, callback);
43
43
  }
@@ -0,0 +1 @@
1
+ {"classifier":{"examples":{"computing":[[1,1,0,0,0,0,0,0,0],[0,0,1,1,0,0,0,0,0],[0,0,0,1,1,1,0,0,0]],"literature":[[0,0,1,0,0,0,1,0,0],[0,0,0,0,0,0,1,1,0],[0,0,0,0,0,0,1,0,1]]},"features":[],"featurePositions":{},"maxFeaturePosition":0,"classifications":["computing","literature"],"exampleCount":6,"theta":[{"elements":[2.0057203693422903,2.0057203693422903,0.0904766662626176,3.447364098636818,0.9696521506748157,0.9696521506748157,-4.840706080886848,-1.2267353995937322,-1.2267353995937322]},{"elements":[-2.00572036934229,-2.00572036934229,-0.09047666626261795,-3.447364098636819,-0.9696521506748155,-0.9696521506748155,4.84070608088685,1.2267353995937313,1.2267353995937313]}]},"docs":[{"label":"computing","text":["fix","box"]},{"label":"computing","text":["write","code"]},{"label":"computing","text":["nasti","script","code"]},{"label":"literature","text":["write","book"]},{"label":"literature","text":["read","book"]},{"label":"literature","text":["studi","book"]}],"features":{"fix":1,"box":1,"write":2,"code":2,"nasti":1,"script":1,"book":3,"read":1,"studi":1},"stemmer":{},"lastAdded":6,"events":{"domain":null,"_events":{},"_maxListeners":10}}
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "natural",
3
3
  "description": "General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.",
4
- "version": "0.2.1",
4
+ "version": "0.4.0",
5
5
  "homepage": "https://github.com/NaturalNode/natural",
6
6
  "repository": {
7
7
  "type": "git",
@@ -13,7 +13,8 @@
13
13
  "dependencies": {
14
14
  "sylvester": ">= 0.0.12",
15
15
  "apparatus": ">= 0.0.9",
16
- "underscore": ">=1.3.1"
16
+ "underscore": ">=1.3.1",
17
+ "log4js": "*"
17
18
  },
18
19
  "devDependencies": {
19
20
  "uubench": "0.0.x",
@@ -22,6 +23,7 @@
22
23
  "scripts": {
23
24
  "test": "NODE_PATH=. node_modules/jasmine-node/bin/jasmine-node spec/"
24
25
  },
26
+ "license": "MIT",
25
27
  "author": "Chris Umbel <chris@chrisumbel.com>",
26
28
  "keywords": [
27
29
  "natural",
@@ -42,7 +44,8 @@
42
44
  "double",
43
45
  "jaro-winkler",
44
46
  "levenshtein",
45
- "distance"
47
+ "distance",
48
+ "tagger"
46
49
  ],
47
50
  "main": "./lib/natural/index.js",
48
51
  "maintainers": [
package/package.json~ ADDED
@@ -0,0 +1,66 @@
1
+ {
2
+ "name": "natural",
3
+ "description": "General natural language (tokenizing, stemming (English, Russian, Spanish), classification, inflection, phonetics, tfidf, WordNet, jaro-winkler, Levenshtein distance, Dice's Coefficient) facilities for node.",
4
+ "version": "0.3.0",
5
+ "homepage": "https://github.com/NaturalNode/natural",
6
+ "repository": {
7
+ "type": "git",
8
+ "url": "git://github.com/NaturalNode/natural.git"
9
+ },
10
+ "engines": {
11
+ "node": ">=0.4.10"
12
+ },
13
+ "dependencies": {
14
+ "sylvester": ">= 0.0.12",
15
+ "apparatus": ">= 0.0.9",
16
+ "underscore": ">=1.3.1",
17
+ "log4js": "*"
18
+ },
19
+ "devDependencies": {
20
+ "uubench": "0.0.x",
21
+ "jasmine-node": "~1.13.1"
22
+ },
23
+ "scripts": {
24
+ "test": "NODE_PATH=. node_modules/jasmine-node/bin/jasmine-node spec/"
25
+ },
26
+ "license": "MIT",
27
+ "author": "Chris Umbel <chris@chrisumbel.com>",
28
+ "keywords": [
29
+ "natural",
30
+ "language",
31
+ "porter",
32
+ "lancaster",
33
+ "stemmer",
34
+ "bayes",
35
+ "classifier",
36
+ "phonetic",
37
+ "metaphone",
38
+ "inflector",
39
+ "wordnet",
40
+ "tf-idf",
41
+ "logistic",
42
+ "regression",
43
+ "doublemetaphone",
44
+ "double",
45
+ "jaro-winkler",
46
+ "levenshtein",
47
+ "distance",
48
+ "tagger"
49
+ ],
50
+ "main": "./lib/natural/index.js",
51
+ "maintainers": [
52
+ {
53
+ "name": "Chris Umbel",
54
+ "email": "chris@chrisumbel.com",
55
+ "web": "http://www.chrisumbel.com"
56
+ },
57
+ {
58
+ "name": "Rob Ellis",
59
+ "email": "rob@silentrob.me"
60
+ },
61
+ {
62
+ "name": "Ken Koch",
63
+ "email": "kkoch986@gmail.com"
64
+ }
65
+ ]
66
+ }
@@ -1,32 +0,0 @@
1
-
2
- /**
3
- * Module dependencies.
4
- */
5
-
6
- var uubench = require('uubench')
7
- , natural = require('../');
8
-
9
- fs = require('fs');
10
- metaphone = natural.Metaphone.process;
11
- soundex = natural.SoundEx.process;
12
-
13
- suite = new uubench.Suite({
14
- start: function(){
15
- console.log();
16
- },
17
-
18
- result: function(name, stats){
19
- var persec = 1000 / stats.elapsed
20
- , ops = stats.iterations * persec;
21
- console.log(' \033[90m%s : \033[36m%s \033[90mops/s\033[0m', name, ops | 0);
22
- },
23
-
24
- done: function(){
25
- console.log();
26
- }
27
- });
28
-
29
- require('./metaphone');
30
- require('./soundex');
31
-
32
- suite.run();
@@ -1,27 +0,0 @@
1
-
2
- // single word
3
-
4
- suite.bench('metaphone() word', function(next){
5
- metaphone('stephen');
6
- next();
7
- });
8
-
9
- // small body of text
10
-
11
- var words = fs.readFileSync('lib/natural/index.js', 'utf8').split(/\W+/);
12
- suite.bench('metaphone() small', function(next){
13
- for (var i = 0, len = words.length; i < len; ++i) {
14
- metaphone(words[i]);
15
- }
16
- next();
17
- });
18
-
19
- // medium body of text
20
-
21
- var words2 = fs.readFileSync('README.md', 'utf8').split(/\W+/);
22
- suite.bench('metaphone() medium', function(next){
23
- for (var i = 0, len = words2.length; i < len; ++i) {
24
- metaphone(words2[i]);
25
- }
26
- next();
27
- });