natural 0.2.0 → 0.2.1

package/lib/natural/parsers/HeadCornerParser.js

@@ -1,101 +0,0 @@
-/*
-    Head-Corner Chart Parser
-    Copyright (C) 2014 Hugo W.L. ter Doest
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-*/
-
-var log4js = require('log4js');
-var logger = log4js.getLogger();
-logger.setLevel('ERROR');
-
-var DoubleDottedItem = require('./DoubleDottedItem');
-var GoalItem = require('./GoalItem');
-var CYK_Item = require('./CYK_Item');
-var Chart = require('./Chart');
-var Agenda = require('./Agenda');
-
-HeadCornerChartParser.prototype.initialise = function(tagged_sentence) {
-  var that = this;
-  var new_item;
-  var nr_items_added = 0;
-  var i,j;
-
-  logger.debug("Enter HeadCornerChartParser.initialise");
-  this.tagged_sentence = tagged_sentence;
-  this.N = tagged_sentence.length;
-  // Initialise agenda
-  this.agenda = new Agenda();
-  // Initialise chart
-  this.chart = new Chart(this.N);
-
-  // Add goal items for the start symbol
-  for (i = 0; i <= this.N; i++) {
-    for (j = i; j <= this.N; j++) {
-      new_item = new GoalItem(i, j, this.grammar.get_start_symbol());
-      nr_items_added += this.agenda.add_item(new_item, this.chart);
-      logger.debug("HeadCornerChartParser.initialise: |- " + new_item.id);
-    }
-  }
-
-  // Add items for the tagged sentence
-  for (i = 0; i < this.N; i++) {
-    // Add terminal item
-    var term_item = new CYK_Item({'lhs': this.tagged_sentence[i][0], 'rhs': ''}, i, i + 1);
-    // Add tag items
-    for (j = 1; j < tagged_sentence[i].length; j++) {
-      var tag_item = new CYK_Item({'lhs': this.tagged_sentence[i][j], 'rhs': [this.tagged_sentence[i][0]]}, i, i + 1);
-      tag_item.children.push(term_item);
-      nr_items_added += this.chart.add_item(tag_item);
-      logger.debug("HeadCornerChartParser.initialise: |- " + tag_item.id);
-    }
-  }
-  logger.debug("Exit  HeadCornerChartParser.initialise: number of items added: " + nr_items_added);
-  return(nr_items_added);
-};
-
-// Pseudo code of a chart parser with agenda (based on Sikkel's parsing schemata)
-// create initial chart and agenda
-// while agenda is not empty
-//   delete (arbitrarily chosen) item current from agenda
-//   if current is not on the chart then
-//     add current to chart
-//     add all items that can be deduced by combining current with
-//     the items already on the chart
-//     to the agenda if it is not already on chart or agenda
-HeadCornerChartParser.prototype.parse = function (tagged_sentence) {
-  logger.debug("Enter HeadCornerChartParser.parse: sentence: " + tagged_sentence);
-  this.initialise(tagged_sentence);
-  var items_added = 0;
-  var current;
-  do {
-    current = this.agenda.get_item();
-    if (current) {
-      if (this.chart.add_item(current)) {
-        items_added += current.combine_with_chart(this.chart, this.agenda, this.grammar);
-      }
-    }
-  } while (current);
-  logger.debug("Exit HeadCornerChartParser.parse");
-  return this.chart;
-};
-
-// Constructor for the left-corner parser
-function HeadCornerChartParser(grammar) {
-  this.grammar = grammar;
-  this.grammar.compute_hc_relation();
-  logger.debug("HeadCornerChartParser: " + JSON.stringify(grammar.hc));
-}
-
-module.exports = HeadCornerChartParser;

package/lib/natural/parsers/LeftCornerParser.js

@@ -1,58 +0,0 @@
-/*
-    Left Corner Chart Parser
-    Copyright (C) 2014 Hugo W.L. ter Doest
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-*/
-
-// Algorithm based on the improved left-corner algorithm in 
-// Improved Left-Corner Chart Parsing for Large Context-Free Grammars, Robert C. Moore
-// IWPT2000
-
-var log4js = require('log4js');
-var logger = log4js.getLogger();
-logger.setLevel('DEBUG');
-
-var EarleyItem = require('./EarleyItem');
-var Chart = require('./Chart');
-var ChartParser = require("./ChartParser");
-
-// Constructor for the left-corner parser
-function LeftCornerChartParser(grammar) {
-  this.grammar = grammar;
-  this.grammar.compute_lc_relation();
-}
-
-LeftCornerChartParser.prototype = Object.create(ChartParser.prototype);
-
-LeftCornerChartParser.prototype.parse = function(tagged_sentence) {
-  var that = this;
-
-  this.initialise(tagged_sentence);
-  var i;
-  for (i = 0; i <= this.N; i++) {
-    var items_added;
-    do {
-      items_added = 0;
-      var items = this.chart.get_items_to(i);
-      items.forEach(function(item) {
-        items_added += item.completer(that.chart, that.grammar);
-        items_added += item.lc_predictor(that.chart, that.grammar);
-      });
-    } while (items_added);
-  }
-  return this.chart;
-};
-
-module.exports = LeftCornerChartParser;

package/lib/natural/parsers/PEG-grammar-for-unification-grammar.txt

@@ -1,345 +0,0 @@
-/*
-    PEG grammar unification grammars
-    Copyright (C) 2014 Hugo W.L. ter Doest
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-*/
-
-// Created using http://pegjs.majda.cz/online
-
-{
-  var is_CNF = true;
-  var nonterminals = {};
-  var symbols = {};
-
-  function Atom(val) {
-    this.atom = val;
-  }
-
-  function Path(ids) {
-    this.path = ids;
-  }
-
-  function Rule(lhs, rhs, head) {
-   this.lhs = lhs;
-   this.rhs = rhs;
-   this.head = head;
-  }
-
-  function Constraint(left_op, right_op) {
-    this.left = left_op;
-    this.right = right_op;
-  }
-
-function Grammar() {
-  this.production_rules = [];
-  this.nonterminals = {};
-  this.symbols = {};
-  this.start_symbol = "";
-  this.is_CNF = true;
-}
-
-//Checks if B is a nonterminal
-Grammar.prototype.is_nonterminal = function(B) {
-  console.log("Checking if " + B + " is a nonterminal: " + this.nonterminals[B]);
-  return (this.nonterminals[B]);
-};
-
-//Checks if B is a (pre)terminal
-Grammar.prototype.is_terminal = function(B) {
-  console.log("Checking if " + B + " is a (pre)terminal: " + !this.nonterminals[B]);
-  return (!this.nonterminals[B]);
-};
-
-// Looks up all rules with lhs B
-Grammar.prototype.rules_with_lhs = function(B) {
-  var rules = [];
-  
-  this.production_rules.forEach(function(rule) {
-    if (rule.lhs === B) {
-      rules.push(rule);
-    }
-  });
-  return(rules);
-};
-
-// Returns the start production rule which is the first rule read from file
-Grammar.prototype.start_rule = function() {
-  return(this.production_rules[0]);
-};
-
-// Returns the start symbol
-Grammar.prototype.get_start_symbol = function() {
-  return(this.start_symbol);
-};
-
-// Returns all rules that match right hand side nonterminals s and t
-Grammar.prototype.get_rules_with_rhs = function(s, t) {
-  var res = [];
-  
-  this.production_rules.forEach(function(rule) {
-    if ((rule.rhs.length === 2) && (rule.rhs[0] === s) && (rule.rhs[1] === t)) {
-      res.push(rule);
-    }
-  });
-  return res;
-};
-
-// Based on: http://folk.uio.no/plison/pdfs/lectures/compling2010/pdfs/compling2010-parsingcfg-solutions.pdf
-Grammar.prototype.compute_lc_relation = function() {
-  that = this;
-  // Compute the first order lc relation
-  this.lc = {};
-  this.production_rules.forEach(function(rule) {
-    if (!that.lc[rule.lhs]) {
-      that.lc[rule.lhs] = {};
-    }
-    if (that.is_nonterminal(rule.rhs[0])) {
-      that.lc[rule.lhs][rule.rhs[0]] = true;
-    }
-  });
-  // Reflexive closure
-  Object.keys(this.nonterminals).forEach(function(A){
-    if (!that.lc[A]) {
-      that.lc[A] = {};
-    }
-    that.lc[A][A] = true;
-  });
-  // Transitive closure
-  var changed;
-  do {
-    changed = false;
-    Object.keys(this.nonterminals).forEach(function(A) {
-      Object.keys(that.lc[A]).forEach(function(B) {
-        Object.keys(that.lc[B]).forEach(function(C) {
-          if (!that.lc[A][C]) {
-            // add all left corners of C to A
-            Object.keys(that.lc[C]).forEach(function(D){
-              that.lc[A][D] = true;
-              changed = true;
-            });
-          }
-        });
-      });
-    });
-  } while (changed);
-};
-
-Grammar.prototype.rules_with_leftmost_daughter = function (B) {
-  rules = [];
-
-  this.production_rules.forEach(function(rule) {
-    if (rule.rhs[0] === B) {
-      rules.push(rule);
-    }
-  });
-  return(rules);
-};
-
-Grammar.prototype.is_leftcorner_of = function(B, C) {
-  if (this.lc[C]) {
-    return(this.lc[C][B]);
-  }
-  else {
-    return(false);
-  }
-};
-
-// Check if nonterminal A is head-corner of nonterminal B
-Grammar.prototype.is_headcorner_of = function(A, B) {
-  if (this.hc[B]) {
-    return(this.hc[B][A]);
-  }
-  else {
-    return(false);
-  }
-}
- 
-// Get rules with nonterminal H as head
-Grammar.prototype.get_rules_with_head = function(H) {
-  var res = [];
-
-  this.production_rules.forEach(function(rule) {
-    if (rule.rhs[rule.head] === H) {
-      res.push(rule);
-    }
-  });
-  return(res);
-};
-
-// Computation of the head-corner relation follows the pattern of the 
-// computation of the lef-corner relation
-Grammar.prototype.compute_hc_relation = function() {
-  that = this;
-  // Compute the first order hc relation
-  this.hc = {};
-  this.production_rules.forEach(function(rule) {
-    if (!that.hc[rule.lhs]) {
-      that.hc[rule.lhs] = {};
-    }
-    that.hc[rule.lhs][rule.rhs[rule.head]] = true;
-  });
-  // Reflexive closure
-  Object.keys(this.symbols).forEach(function(A){
-    if (!that.hc[A]) {
-      that.hc[A] = {};
-    }
-    that.hc[A][A] = true;
-  });
-  // Transitive closure
-  var changed;
-  do {
-    changed = false;
-    Object.keys(this.symbols).forEach(function(A) {
-      Object.keys(that.hc[A]).forEach(function(B) {
-        Object.keys(that.hc[B]).forEach(function(C) {
-          if (!that.hc[A][C]) {
-            // add all head corners of C to A
-            Object.keys(that.hc[C]).forEach(function(D){
-              that.hc[A][D] = true;
-              changed = true;
-            });
-          }
-        });
-      });
-    });
-  } while (changed);
-};
-
-}
-
-grammar =
-  rules: (S production_rule S) +
-  {
-   grammar = new Grammar();
-   for (var i = 0; i < rules.length; i++) {
-     grammar.production_rules.push(rules[i][1]);
-   }
-   grammar.start_symbol = grammar.production_rules[0].lhs;
-   grammar.nonterminals = nonterminals;
-   grammar.is_CNF = is_CNF;
-   grammar.symbols = symbols;
-   return(grammar);
-  }
-
-production_rule =
-  rule: rule cseq: constraint*
-  {
-   if (cseq) {
-     rule.constraints = cseq;
-   }
-   return(rule);
-  }
-
-// A production rule must be specified on one line 
-rule =
-  lhs: nonterminal Arrow rhs_1: identifier_no_eol* head: (HeadIndicator identifier_no_eol HeadIndicator)? rhs_2: identifier_no_eol* (EOL / EOI)
-  {
-   var rhs = [];
-   var head_pos = 0;
-
-   rhs = rhs_1;
-   if (head) {
-     head_pos = rhs_1.length;
-     rhs.push(head[1]);
-   }
-   rhs = rhs.concat(rhs_2);
-   rhs.forEach(function(symbol) {
-     symbols[symbol] = true;
-   });
-   var rule = new Rule(lhs, rhs, head_pos);
-   nonterminals[lhs] = true;
-   symbols[lhs] = true;
-   if ((rule.rhs.length > 2) || (rule.rhs.length === 0)) {
-     is_CNF = false;
-   }
-   return(rule);
-  }
-
-nonterminal =
-  nt:identifier S
-  {
-   return(nt);
-  }
-
-nonterminal_seq =
-  identifier_seq
-
-constraint =
-  path: feature_path Equal atom: atom
-  {
-   var constraint = new Constraint(path, atom);
-   return(constraint);
-  }
-  / path1: feature_path Equal path2: feature_path
-  {
-   var constraint = new Constraint(path1, path2);
-   return(constraint);
-  }
-
-feature_path =
-  PathOpen idseq:identifier_seq PathClose
-  {
-   return(idseq);
-  }
-
-atom =
-  identifier
-
-identifier_seq = 
-  identifier*
-
-identifier =
-  characters: [a-zA-Z_0-9]+ S
-  {
-   var s = "";
-   for (var i = 0; i < characters.length; i++) {
-     s += characters[i];
-   }
-   return(s);
-  }
-
-identifier_no_eol =
-  characters: [a-zA-Z_0-9$]+ S_no_eol
-  {
-   var s = "";
-   for (var i = 0; i < characters.length; i++) {
-     s += characters[i];
-   }
-   return(s);
-  }
-
-// Terminals
-Arrow =
-  "->" S_no_eol
-PathOpen =
-  "<" S
-PathClose =
-  ">" S
-Equal = 
-  "=" S
-HeadIndicator = 
-  "*" S_no_eol
-
-// Blanks
-EOL =
-  '\r\n' / '\n' / '\r'
-Comment =
-  "\/\/" (!EOL .)* (EOL/EOI)
-S =
-  (' ' / '\t' / EOL / Comment)*
-S_no_eol =
-  (' ' / '\t' / Comment)*
-EOI= 
-  !.