opener-opinion-detector-base 2.0.0

data/core/vendor/src/crfsuite/lib/crf/src/rumavl.h

@@ -0,0 +1,160 @@
+/*
+ * RumAVL - Threaded AVL Tree Implementation
+ *
+ * Copyright (c) 2005-2007 Jesse Long <jpl@unknown.za.net>
+ * All rights reserved.
+ * 
+ * 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:
+ *
+ *   1. The above copyright notice and this permission notice shall be
+ *	included in all copies or substantial portions of the Software.
+ *   2. The origin of the Software must not be misrepresented; you must not
+ *	claim that you wrote the original Software.
+ *   3. Altered source versions of the Software must be plainly marked as
+ *	such, and must not be misrepresented as being the original 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.
+ */
+
+/*
+ * Please see the `README' file, the documentation in the `doc' directory and
+ * the `rumavl.c' source file for more information.
+ */
+
+#ifndef RUMAVL_H
+#define RUMAVL_H 1
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <stddef.h>	/* size_t */
+
+
+
+    
+/*----------------------------------------------------------------------------
+ * DATA TYPES
+ *--------------------------------------------------------------------------*/
+
+/* Opaque context handle for the tree */
+typedef struct rumavl RUMAVL;
+
+/* Node type - used for iterating */
+typedef struct rumavl_node RUMAVL_NODE;
+
+
+
+
+/*----------------------------------------------------------------------------
+ * FUNDEMENTAL FUNCTIONS
+ *--------------------------------------------------------------------------*/
+
+/* Create a new RumAVL tree */
+RUMAVL *rumavl_new (size_t reclen, 
+		    int (*cmp)(const void *, const void *, size_t, void *),
+		    void *(*alloc)(void *, size_t, void *),
+		    void *udata);
+
+/* Destroy a RumAVL tree */
+void rumavl_destroy (RUMAVL *tree);
+
+/* This function returns the size of each record in a tree */
+size_t rumavl_record_size (RUMAVL *tree);
+
+/* Get a pointer to the udata pointer */
+void **rumavl_udata  (RUMAVL *tree);
+
+/* Insert a record into a tree, overwriting an existing record necessary */
+int rumavl_set (RUMAVL *tree, const void *record);
+/* Insert a record into a tree, never overwrites an existing record */
+int rumavl_insert (RUMAVL *tree, const void *record);
+
+/* Retrieve record from tree, or NULL */
+void *rumavl_find (RUMAVL *tree, const void *find);
+
+/* Remove record from tree */
+int rumavl_delete (RUMAVL *tree, const void *record);
+
+
+
+
+/*----------------------------------------------------------------------------
+ * ITERATOR FUNCTIONS
+ *--------------------------------------------------------------------------*/
+
+/* Get a pointer to the node containing a specific record */
+RUMAVL_NODE *rumavl_node_find (RUMAVL *tree, const void *find, void **record);
+
+/* Get the next node in sequence after a specific node, in a specific
+ * direction, or get the first node on either end of a tree */
+RUMAVL_NODE *rumavl_node_next (RUMAVL *tree, RUMAVL_NODE *node, int dir,
+				    void **record);
+/* Possible directions */
+#define RUMAVL_DESC (-1)
+#define RUMAVL_ASC  (+1)
+
+/* Get a record held by a specific node */
+void *rumavl_node_record (RUMAVL_NODE *node);
+
+/* Pass each record in a tree to a user defined callback function */
+extern int rumavl_foreach (RUMAVL *tree, int dir,
+	    int (*cbfn)(RUMAVL *, void *, void *), void *udata);
+
+
+
+
+/*----------------------------------------------------------------------------
+ * CALLBACK FUNCTIONS
+ *
+ * Functions giving you more control over the actions of this library.
+ *--------------------------------------------------------------------------*/
+
+int (**rumavl_owcb(RUMAVL *tree))(RUMAVL *, RUMAVL_NODE *, void *, 
+	const void *, void *);
+int (**rumavl_delcb(RUMAVL *tree))(RUMAVL *, RUMAVL_NODE *, void *, void *);
+
+
+
+
+/*----------------------------------------------------------------------------
+ * MEMORY MANAGEMENT
+ *
+ * The rumavl_mem struct is used to define how a RUMAVL object allocates
+ * and frees memory.
+ *--------------------------------------------------------------------------*/
+void *(**rumavl_alloc(RUMAVL *tree))(void *ptr, size_t size, void *udata);
+
+
+
+/*----------------------------------------------------------------------------
+ * ERROR CODES
+ *
+ * The functions returning int's will return these errors
+ *--------------------------------------------------------------------------*/
+
+#define RUMAVL_ERR_INVAL  (-1)	/* Invalid argument */
+#define RUMAVL_ERR_NOMEM  (-2)	/* Insufficient memory */
+#define RUMAVL_ERR_NOENT  (-3)	/* Entry does not exist */
+#define RUMAVL_ERR_EORNG  (-5)	/* No nodes left in range */
+#define RUMAVL_ERR_EXIST  (-6)	/* Entry already exists */
+
+/* returns static string describing error number */
+extern const char *rumavl_strerror (int errno);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* ifndef RUMAVL_H */

data/core/vendor/src/crfsuite/lib/crf/src/train_arow.c

@@ -0,0 +1,408 @@
+/*
+ *      Online training with Adaptive Regularization of Weights (AROW).
+ *
+ * Copyright (c) 2007-2010, Naoaki Okazaki
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the names of the authors nor the names of its contributors
+ *       may be used to endorse or promote products derived from this
+ *       software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
+ * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+ * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* $Id$ */
+
+#ifdef    HAVE_CONFIG_H
+#include <config.h>
+#endif/*HAVE_CONFIG_H*/
+
+#include <os.h>
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include <crfsuite.h>
+#include "crfsuite_internal.h"
+#include "logging.h"
+#include "params.h"
+#include "vecmath.h"
+
+#define MIN(a, b)   ((a) < (b) ? (a) : (b))
+
+/**
+ * Training parameters (configurable with crfsuite_params_t interface).
+ */
+typedef struct {
+    floatval_t variance;
+    floatval_t gamma;
+    int max_iterations;
+    floatval_t epsilon;
+} training_option_t;
+
+/**
+ * Internal data structure for computing the sparse vector F(x, y) - F(x, y').
+ */
+typedef struct {
+    /* An array of feature indices relevant to the instance. */
+    int *actives;
+    int num_actives;
+    int cap_actives;
+    char *used;
+
+    /* Coefficient for collecting feature weights. */
+    floatval_t c;
+    /* The difference vector [K]. */
+    floatval_t *delta;
+    /* The number of features. */
+    int K;
+} delta_t;
+
+static int delta_init(delta_t *dc, const int K)
+{
+    memset(dc, 0, sizeof(*dc));
+    dc->used = (char*)calloc(K, sizeof(char));
+    dc->delta = (floatval_t*)calloc(K, sizeof(floatval_t));
+    dc->K = K;
+    if (dc->delta == NULL || dc->used == NULL) {
+        return 1;
+    }
+    return 0;
+}
+
+static void delta_finish(delta_t *dc)
+{
+    free(dc->actives);
+    free(dc->used);
+    free(dc->delta);
+    memset(dc, 0, sizeof(*dc));
+}
+
+static void delta_reset(delta_t *dc)
+{
+    int i;
+    for (i = 0;i < dc->num_actives;++i) {
+        int k = dc->actives[i];
+        dc->delta[k] = 0;
+    }
+    dc->num_actives = 0;
+}
+
+static void delta_collect(void *instance, int fid, floatval_t value)
+{
+    delta_t *dc = (delta_t*)instance;
+
+    /* Expand the active feature list if necessary. */
+    if (dc->cap_actives <= dc->num_actives) {
+        ++dc->cap_actives;
+        dc->cap_actives *= 2;
+        dc->actives = (int*)realloc(dc->actives, sizeof(int) * dc->cap_actives);
+    }
+
+    dc->actives[dc->num_actives++] = fid;
+    dc->delta[fid] += dc->c * value;
+}
+
+static void delta_finalize(delta_t *dc)
+{
+    int i, j = 0, k;
+
+    /* Collapse the duplicated indices. */
+    for (i = 0;i < dc->num_actives;++i) {
+        k = dc->actives[i];
+        if (!dc->used[k]) {
+            dc->actives[j++] = k;
+            dc->used[k] = 1;
+        }
+    }
+    dc->num_actives = j;    /* This is the distinct number of indices. */
+
+    /* Reset the used flag. */
+    for (i = 0;i < dc->num_actives;++i) {
+        k = dc->actives[i];
+        dc->used[k] = 0;
+    }
+}
+
+static floatval_t delta_norm2(delta_t *dc)
+{
+    int i;
+    floatval_t norm2 = 0.;
+
+    for (i = 0;i < dc->num_actives;++i) {
+        int k = dc->actives[i];
+        norm2 += dc->delta[k] * dc->delta[k];
+    }
+    return norm2;
+}
+
+static void delta_add(delta_t *dc, floatval_t *w, floatval_t *ws, const floatval_t tau, const floatval_t u)
+{
+    int i;
+    const floatval_t tauu = tau * u;
+
+    for (i = 0;i < dc->num_actives;++i) {
+        int k = dc->actives[i];
+        w[k] += tau * dc->delta[k];
+        ws[k] += tauu * dc->delta[k];
+    }
+}
+
+static int diff(int *x, int *y, int n)
+{
+    int i, d = 0;
+    for (i = 0;i < n;++i) {
+        if (x[i] != y[i]) {
+            ++d;
+        }
+    }
+    return d;
+}
+
+static floatval_t cost_insensitive(floatval_t err, floatval_t d)
+{
+    return err + 1.;
+}
+
+static floatval_t cost_sensitive(floatval_t err, floatval_t d)
+{
+    return err + sqrt(d);
+}
+
+static floatval_t tau0(floatval_t cost, floatval_t norm, floatval_t c)
+{
+    return cost / norm;
+}
+
+static floatval_t tau1(floatval_t cost, floatval_t norm, floatval_t c)
+{
+    return MIN(c, cost / norm);
+}
+
+static floatval_t tau2(floatval_t cost, floatval_t norm, floatval_t c)
+{
+    return cost / (norm + 0.5 / c);
+}
+
+static int exchange_options(crfsuite_params_t* params, training_option_t* opt, int mode)
+{
+    BEGIN_PARAM_MAP(params, mode)
+        DDX_PARAM_FLOAT(
+            "variance", opt->variance, 1.,
+            "The initial variance of every feature weight."
+            )
+        DDX_PARAM_FLOAT(
+            "gamma", opt->gamma, 1.,
+            "Tradeoff parameter."
+            )
+        DDX_PARAM_INT(
+            "max_iterations", opt->max_iterations, 100,
+            "The maximum number of iterations."
+            )
+        DDX_PARAM_FLOAT(
+            "epsilon", opt->epsilon, 0.,
+            "The stopping criterion (the mean loss)."
+            )
+    END_PARAM_MAP()
+
+    return 0;
+}
+
+void crfsuite_train_arow_init(crfsuite_params_t* params)
+{
+    exchange_options(params, NULL, 0);
+}
+
+int crfsuite_train_arow(
+    encoder_t *gm,
+    dataset_t *trainset,
+    dataset_t *testset,
+    crfsuite_params_t *params,
+    logging_t *lg,
+    floatval_t **ptr_w
+    )
+{
+    int n, i, j, k, ret = 0;
+    int *viterbi = NULL;
+    floatval_t beta;
+    floatval_t *mean = NULL, *cov = NULL, *prod = NULL;
+    const int N = trainset->num_instances;
+    const int K = gm->num_features;
+    const int T = gm->cap_items;
+    training_option_t opt;
+    delta_t dc;
+    clock_t begin = clock();
+
+	/* Initialize the variable. */
+    if (delta_init(&dc, K) != 0) {
+        ret = CRFSUITEERR_OUTOFMEMORY;
+        goto error_exit;
+    }
+
+    /* Obtain parameter values. */
+    exchange_options(params, &opt, -1);
+
+    /* Allocate arrays. */
+    mean = (floatval_t*)calloc(sizeof(floatval_t), K);
+    cov = (floatval_t*)calloc(sizeof(floatval_t), K);
+    prod = (floatval_t*)calloc(sizeof(floatval_t), K);
+    viterbi = (int*)calloc(sizeof(int), T);
+    if (mean == NULL || cov == NULL || prod == NULL || viterbi == NULL) {
+        ret = CRFSUITEERR_OUTOFMEMORY;
+        goto error_exit;
+    }
+
+    /* Initialize the covariance vector (diagnal matrix). */
+    vecset(cov, opt.variance, K);
+
+    /* Show the parameters. */
+    logging(lg, "Adaptive Regularization of Weights (AROW)\n");
+    logging(lg, "variance: %f\n", opt.variance);
+    logging(lg, "gamma: %f\n", opt.gamma);
+    logging(lg, "max_iterations: %d\n", opt.max_iterations);
+    logging(lg, "epsilon: %f\n", opt.epsilon);
+    logging(lg, "\n");
+
+    beta = 1.0 / opt.gamma;
+
+	/* Loop for epoch. */
+    for (i = 0;i < opt.max_iterations;++i) {
+        floatval_t norm = 0., sum_loss = 0.;
+        clock_t iteration_begin = clock();
+
+        /* Shuffle the instances. */
+        dataset_shuffle(trainset);
+
+		/* Loop for each instance. */
+        for (n = 0;n < N;++n) {
+            int d = 0;
+            floatval_t sv;
+            const crfsuite_instance_t *inst = dataset_get(trainset, n);
+
+            /* Set the feature weights to the encoder. */
+            gm->set_weights(gm, mean, 1.);
+            gm->set_instance(gm, inst);
+
+            /* Tag the sequence with the current model. */
+            gm->viterbi(gm, viterbi, &sv);
+
+            /* Compute the number of different labels. */
+            d = diff(inst->labels, viterbi, inst->num_items);
+            if (0 < d) {
+                floatval_t alpha, frac;
+                floatval_t sc, norm2;
+                floatval_t tau, cost;
+
+                /*
+                    Compute the cost of this instance.
+                 */
+                gm->score(gm, inst->labels, &sc);
+                cost = sv - sc + (double)d;
+
+                /* Initialize delta[k] = 0. */
+                delta_reset(&dc);
+
+                /*
+                    For every feature k on the correct path:
+                        delta[k] += 1;
+                 */
+                dc.c = 1;
+                gm->features_on_path(gm, inst, inst->labels, delta_collect, &dc);
+
+                /*
+                    For every feature k on the Viterbi path:
+                        delta[k] -= 1;
+                 */
+                dc.c = -1;
+                gm->features_on_path(gm, inst, viterbi, delta_collect, &dc);
+
+                delta_finalize(&dc);
+
+                /* Compute prod[k] = delta[k] * delta[k]. */
+                for (j = 0;j < dc.num_actives;++j) {
+                    k = dc.actives[j];
+                    prod[k] = dc.delta[k] * dc.delta[k];
+                }
+
+                /*
+                    Compute alpha.
+                 */
+                frac = opt.gamma;
+                for (j = 0;j < dc.num_actives;++j) {
+                    k = dc.actives[j];
+                    frac += prod[k] * cov[k];
+                }
+                alpha = cost / frac;
+
+                /*
+                    Update.
+                 */
+                for (j = 0;j < dc.num_actives;++j) {
+                    k = dc.actives[j];
+                    mean[k] += alpha * cov[k] * dc.delta[k];
+                    cov[k] = 1.0 / ((1.0 / cov[k]) + prod[k] / opt.gamma);
+                }
+
+                sum_loss += cost;
+            }
+        }
+
+        /* Output the progress. */
+        logging(lg, "***** Iteration #%d *****\n", i+1);
+        logging(lg, "Loss: %f\n", sum_loss);
+        logging(lg, "Feature norm: %f\n", sqrt(vecdot(mean, mean, K)));
+        logging(lg, "Seconds required for this iteration: %.3f\n", (clock() - iteration_begin) / (double)CLOCKS_PER_SEC);
+
+        /* Holdout evaluation if necessary. */
+        if (testset != NULL) {
+            holdout_evaluation(gm, testset, mean, lg);
+        }
+
+        logging(lg, "\n");
+
+        /* Convergence test. */
+        if (sum_loss / N <= opt.epsilon) {
+            logging(lg, "Terminated with the stopping criterion\n");
+            logging(lg, "\n");
+            break;
+        }
+    }
+
+    logging(lg, "Total seconds required for training: %.3f\n", (clock() - begin) / (double)CLOCKS_PER_SEC);
+    logging(lg, "\n");
+
+    free(viterbi);
+    free(prod);
+    free(cov);
+    *ptr_w = mean;
+    delta_finish(&dc);
+    return ret;
+
+error_exit:
+    free(viterbi);
+    free(prod);
+    free(cov);
+    free(mean);
+    *ptr_w = NULL;
+    delta_finish(&dc);
+
+    return ret;
+}