grammar_cop 0.1.0

data/ext/link_grammar/link-grammar/corpus/README

@@ -0,0 +1,17 @@
+
+                Parse Ranking and Word Sense Statistics
+                ---------------------------------------
+
+This directory contains code that computes a parse ranking, as well
+as a word-sense probability (based on WordNet 3.0) by looking up
+frequency statistics from an SQL database. The SQLite database engine
+is used because it is "administration-free" for the user, and because
+its license is compatbile with the current link-grammar license.
+
+This directory also contains code for "broadening" word linakges.
+See data/sql/README for more info.
+
+This directory contains one administrative tool, "cluster-pop",
+which is not built by default because users do not need this tool. 
+See the Makefile.am for notes on how to build it.
+

data/ext/link_grammar/link-grammar/corpus/cluster.c

@@ -0,0 +1,286 @@
+/*
+ * cluster.c
+ *
+ * Data for related-word clusters. Meant to expand disjunct coverage
+ * for the case where a parse cannot be completed without ommitting
+ * a word.
+ *
+ * Copyright (c) 2009 Linas Vepstas <linasvepstas@gmail.com>
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sqlite3.h>
+#include "cluster.h"
+#include "../build-disjuncts.h"
+#include "../disjunct-utils.h"
+#include "../structures.h"
+#include "../utilities.h"
+
+struct cluster_s
+{
+	char * dbname;
+	sqlite3 *dbconn;
+	sqlite3_stmt *clu_query;
+	sqlite3_stmt *dj_query;
+	char *errmsg;
+	int rc;
+};
+
+/* ========================================================= */
+
+static void * db_file_open(const char * dbname, void * user_data)
+{
+	Cluster *c = (Cluster *) user_data;
+	int rc;
+	sqlite3 *dbconn;
+	c->rc = sqlite3_open_v2(dbname, &dbconn, SQLITE_OPEN_READONLY, NULL);
+	if (c->rc)
+	{
+		sqlite3_close(dbconn);
+		return NULL;
+	}
+
+	c->dbname = strdup(dbname);
+	return dbconn;
+}
+
+
+/**
+ * Initialize the cluster statistics subsystem.
+ */
+Cluster * lg_cluster_new(void)
+{
+	int rc;
+
+	Cluster *c = (Cluster *) malloc(sizeof(Cluster));
+	c->clu_query = NULL;
+	c->dj_query = NULL;
+	c->errmsg = NULL;
+	c->dbname = NULL;
+
+	/* dbname = "/link-grammar/data/en/sql/clusters.db"; */
+#define DBNAME "sql/clusters.db"
+	c->dbconn = object_open(DBNAME, db_file_open, c);
+	if (NULL == c->dbconn)
+	{
+		/* Very weird .. but if the database is not found, then sqlite
+		 * reports an "out of memory" error! So hide this misleading
+		 * error message.
+		 */
+		if (SQLITE_CANTOPEN == c->rc)
+		{
+			prt_error("Warning: Can't open database: File not found\n"
+			          "\tWas looking for: " DBNAME);
+		}
+		else
+		{ 
+			prt_error("Warning: Can't open database: %s\n"
+			          "\tWas looking for: " DBNAME,
+				sqlite3_errmsg(c->dbconn));
+		}
+		return c;
+	}
+
+	/* Now prepare the statements we plan to use */
+	rc = sqlite3_prepare_v2(c->dbconn, 	
+		"SELECT cluster_name FROM ClusterMembers "
+		"WHERE inflected_word = ?;",
+		-1, &c->clu_query, NULL);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: Can't prepare the cluster member statment: %s\n",
+			sqlite3_errmsg(c->dbconn));
+	}
+
+	rc = sqlite3_prepare_v2(c->dbconn, 	
+		"SELECT disjunct, cost FROM ClusterDisjuncts "
+		"WHERE cluster_name = ?;",
+		-1, &c->dj_query, NULL);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: Can't prepare the disjunct statment: %s\n",
+			sqlite3_errmsg(c->dbconn));
+	}
+
+	prt_error("Info: Cluster grouping database found at %s\n", c->dbname);
+	return c;
+}
+
+/**
+ * lg_cluster_delete -- shut down the cluster statistics subsystem.
+ */ 
+void lg_cluster_delete(Cluster *c)
+{
+	if (NULL == c) return;
+
+	if (c->clu_query)
+	{
+		sqlite3_finalize(c->clu_query);
+		c->clu_query = NULL;
+	}
+
+	if (c->dj_query)
+	{
+		sqlite3_finalize(c->dj_query);
+		c->dj_query = NULL;
+	}
+
+	if (c->dbconn)
+	{
+		sqlite3_close(c->dbconn);
+		c->dbconn = NULL;
+	}
+
+	if (c->dbname)
+	{
+		free(c->dbname);
+		c->dbname = NULL;
+	}
+	free(c);
+}
+
+/* ========================================================= */
+
+static Exp * make_exp(const char *djstr, double cost)
+{
+	Exp *e = (Exp *) malloc(sizeof(Exp));
+	e->multi = 0;
+	e->dir = ' ';
+	e->cost = cost;
+
+	/* If its just a single connector, then do just that */
+	char *sp = strchr (djstr, ' '); 
+	if (NULL == sp || 0x0 == sp[1])
+	{
+		e->type = CONNECTOR_type;
+		if ('@' == djstr[0]) { e->multi = 1; djstr++; }
+		size_t len = strlen(djstr) - 1;
+		if (sp) len--;
+		e->u.string = strndup(djstr, len);
+		e->dir = djstr[len];
+		return e;
+	}
+
+	/* If there are multiple connectors, and them together */
+	size_t len = sp - djstr;
+	char * tmp = strndup(djstr, len);
+	Exp *p1 = make_exp(tmp, 0.0);
+	free (tmp);
+	Exp *p2 = make_exp(sp+1, 0.0);
+
+	E_list *l;
+	E_list *lhead = NULL;
+
+	l = (E_list *) malloc(sizeof(E_list));
+	l->next = lhead;
+	l->e = p2;
+	lhead = l;
+	
+	l = (E_list *) malloc(sizeof(E_list));
+	l->next = lhead;
+	l->e = p1;
+	lhead = l;
+
+	e->type = AND_type;
+	e->u.l = lhead;
+	
+	return e;
+}
+
+#if NOT_NEEDED
+static Exp * or_exp(Exp *p1, Exp *p2)
+{
+	if (NULL == p2) return p1;
+
+	Exp *e = (Exp *) malloc(sizeof(Exp));
+	e->multi = 0;
+	e->dir = ' ';
+	e->cost = 0.0;
+	e->type = OR_type;
+
+	E_list *l;
+	E_list *lhead = NULL;
+
+	l = (E_list *) malloc(sizeof(E_list));
+	l->next = lhead;
+	l->e = p2;
+	lhead = l;
+	
+	l = (E_list *) malloc(sizeof(E_list));
+	l->next = lhead;
+	l->e = p1;
+	lhead = l;
+
+	e->u.l = lhead;
+	return e;
+}
+#endif
+
+static void free_exp(Exp *e)
+{
+	if (CONNECTOR_type != e->type)
+	{
+		E_list *l = e->u.l;
+		while(l)
+		{
+			free_exp(l->e);
+			E_list *ln = l->next;
+			free(l);
+			l = ln;
+		}
+		return;
+	}
+
+	free((char *) e->u.string);
+	free(e);
+}
+
+Disjunct * lg_cluster_get_disjuncts(Cluster *c, const char * wrd)
+{
+	Disjunct *djl = NULL;
+	int rc;
+
+	/* Look for a cluster containing this word */
+	rc = sqlite3_bind_text(c->clu_query, 1, wrd, -1, SQLITE_STATIC);
+	rc = sqlite3_step(c->clu_query);
+	if (rc != SQLITE_ROW) goto noclust;
+
+	/* Get the cluster name, and look for the disjuncts */
+	const char * cluname = sqlite3_column_text(c->clu_query,0);
+	rc = sqlite3_bind_text(c->dj_query, 1, cluname, -1, SQLITE_STATIC);
+
+	while(1)
+	{
+		rc = sqlite3_step(c->dj_query);
+		if (rc != SQLITE_ROW) break;
+		const char * djs = sqlite3_column_text(c->dj_query,0);
+		double cost = sqlite3_column_double(c->dj_query,1);
+
+		/* All expanded disjuncts are costly! */
+		// cost += 0.5;
+		cost -= 6.0;
+		if (cost < 0.0) cost = 0.0;
+
+		/* Building expressions */
+		Exp *e = make_exp(djs, cost);
+		X_node x;
+		x.exp = e;
+		x.string = wrd;
+		Disjunct *dj = build_disjuncts_for_X_node(&x, MAX_CONNECTOR_COST);
+		djl = catenate_disjuncts(dj, djl);
+		free_exp(e);
+	}
+
+	sqlite3_reset(c->dj_query);
+	sqlite3_clear_bindings(c->dj_query);
+
+noclust:
+	sqlite3_reset(c->clu_query);
+	sqlite3_clear_bindings(c->clu_query);
+	return djl;
+}
+
+
+/* ======================= END OF FILE ===================== */

data/ext/link_grammar/link-grammar/corpus/cluster.h

@@ -0,0 +1,32 @@
+/*
+ * cluster.h
+ *
+ * Data for related-word clusters. Meant to expand disjunct covereage
+ * for the case where a parse cannot be completed without ommitting 
+ * a word.
+ *
+ * Copyright (c) 2009 Linas Vepstas <linasvepstas@gmail.com>
+ */
+
+#ifndef _LINKGRAMMAR_CLUSTER_H
+#define _LINKGRAMMAR_CLUSTER_H
+
+#ifdef USE_CORPUS
+
+#include "../api-types.h"
+#include "../link-includes.h"
+
+Cluster * lg_cluster_new(void);
+void lg_cluster_delete(Cluster *);
+
+Disjunct * lg_cluster_get_disjuncts(Cluster *, const char * wrd);
+
+#else /* USE_CORPUS */
+
+static inline Cluster * lg_cluster_new(void) { return NULL; }
+static inline void lg_cluster_delete(Cluster *c) {}
+static inline Disjunct * lg_cluster_get_disjuncts(Cluster *c, const char * wrd) { return NULL; }
+
+#endif /* USE_CORPUS */
+
+#endif /* _LINKGRAMMAR_CLUSTER_H */

data/ext/link_grammar/link-grammar/corpus/corpus.c

@@ -0,0 +1,483 @@
+/*
+ * corpus.c
+ *
+ * Data for corpus statistics, used to provide a parse ranking
+ * to drive the SAT solver, as well as parse ranking with the
+ * ordinary solver. 
+ *
+ * Copyright (c) 2008, 2009 Linas Vepstas <linasvepstas@gmail.com>
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sqlite3.h>
+#include "corpus.h"
+#include "../api-structures.h"
+#include "../disjuncts.h"
+#include "../utilities.h"
+
+struct corpus_s
+{
+	char * dbname;
+	sqlite3 *dbconn;
+	sqlite3_stmt *rank_query;
+	sqlite3_stmt *sense_query;
+	char *errmsg;
+	int rc;
+};
+
+struct sense_s
+{
+	int word;
+	const char * inflected_word;
+	const char * disjunct;
+	char * sense;
+	double score;
+	Sense *next;
+};
+
+/* ========================================================= */
+
+static void * db_file_open(const char * dbname, void * user_data)
+{
+	Corpus *c = (Corpus *) user_data;
+	int rc;
+	sqlite3 *dbconn;
+	c->rc = sqlite3_open_v2(dbname, &dbconn, SQLITE_OPEN_READONLY, NULL);
+	if (c->rc)
+	{
+		sqlite3_close(dbconn);
+		return NULL;
+	}
+
+	c->dbname = strdup(dbname);
+	return dbconn;
+}
+
+
+/**
+ * Initialize the corpus statistics subsystem.
+ */
+Corpus * lg_corpus_new(void)
+{
+	int rc;
+
+	Corpus *c = (Corpus *) malloc(sizeof(Corpus));
+	c->rank_query = NULL;
+	c->sense_query = NULL;
+	c->errmsg = NULL;
+	c->dbname = NULL;
+
+	/* dbname = "/link-grammar/data/en/sql/disjuncts.db"; */
+#define DBNAME "sql/disjuncts.db"
+	c->dbconn = object_open(DBNAME, db_file_open, c);
+	if (NULL == c->dbconn)
+	{
+		/* Very weird .. but if the database is not found, then sqlite
+		 * reports an "out of memory" error! So hide this misleading
+		 * error message.
+		 */
+		if (SQLITE_CANTOPEN == c->rc)
+		{
+			prt_error("Warning: Can't open database: File not found\n"
+			          "\tWas looking for: " DBNAME);
+		}
+		else
+		{ 
+			prt_error("Warning: Can't open database: %s\n"
+			          "\tWas looking for: " DBNAME,
+				sqlite3_errmsg(c->dbconn));
+		}
+		return c;
+	}
+
+	/* Now prepare the statements we plan to use */
+	rc = sqlite3_prepare_v2(c->dbconn, 	
+		"SELECT log_cond_probability FROM Disjuncts "
+		"WHERE inflected_word = ? AND disjunct = ?;",
+		-1, &c->rank_query, NULL);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: Can't prepare the ranking statment: %s\n",
+			sqlite3_errmsg(c->dbconn));
+	}
+
+	/* Results are returned in sorted order .. would it be faster
+	 * to sort locally? Don't know ... */
+	rc = sqlite3_prepare_v2(c->dbconn, 	
+		"SELECT word_sense, log_cond_probability FROM DisjunctSenses "
+		"WHERE inflected_word = ? AND disjunct = ? "
+		"ORDER BY log_cond_probability ASC;",
+		-1, &c->sense_query, NULL);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: Can't prepare the sense statment: %s\n",
+			sqlite3_errmsg(c->dbconn));
+	}
+
+	prt_error("Info: Corpus statistics database found at %s\n", c->dbname);
+	return c;
+}
+
+/**
+ * lg_corpus_delete -- shut down the corpus statistics subsystem.
+ */ 
+void lg_corpus_delete(Corpus *c)
+{
+	if (NULL == c) return;
+
+	if (c->rank_query)
+	{
+		sqlite3_finalize(c->rank_query);
+		c->rank_query = NULL;
+	}
+
+	if (c->sense_query)
+	{
+		sqlite3_finalize(c->sense_query);
+		c->sense_query = NULL;
+	}
+
+	if (c->dbconn)
+	{
+		sqlite3_close(c->dbconn);
+		c->dbconn = NULL;
+	}
+
+	if (c->dbname)
+	{
+		free(c->dbname);
+		c->dbname = NULL;
+	}
+	free(c);
+}
+
+/* ========================================================= */
+
+/* LOW_SCORE is what is assumed if a disjunct-word pair is not found
+ * in the dictionary. It is meant to be -log_2(prob(d|w)) where
+ * prob(d|w) is the conditional probability of seeing the disjunct d
+ * given the word w. A value of 17 is about equal to 1 in 100,000.
+ */
+#define LOW_SCORE 17.0
+
+/**
+ * get_disjunct_score -- get log probability of observing disjunt.
+ *
+ * Given an "inflected" word and a disjunct, thris routine returns the
+ * -log_2 conditional probability prob(d|w) of seeing the disjunct 'd'
+ * given that the word 'w' was observed.  Here, "inflected word" means
+ * the link-grammar dictionary entry, complete with its trailing period
+ * and tag -- e.g. run.v or running.g -- everything after the dot is the
+ * "inflection".
+ */
+static double get_disjunct_score(Corpus *corp,
+                                 const char * inflected_word,
+                                 const char * disjunct)
+{
+	double val;
+	int rc;
+
+	/* Look up the disjunct in the database */
+	rc = sqlite3_bind_text(corp->rank_query, 1,
+		inflected_word, -1, SQLITE_STATIC);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: SQLite can't bind word: rc=%d \n", rc);
+		return LOW_SCORE;
+	}
+
+	rc = sqlite3_bind_text(corp->rank_query, 2,
+		disjunct, -1, SQLITE_STATIC);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: SQLite can't bind disjunct: rc=%d \n", rc);
+		return LOW_SCORE;
+	}
+
+	rc = sqlite3_step(corp->rank_query);
+	if (rc != SQLITE_ROW)
+	{
+		val = LOW_SCORE;
+#ifdef DEBUG
+		printf ("Word=%s dj=%s not found in dict, assume score=%f\n",
+			inflected_word, disjunct, val);
+#endif
+	}
+	else
+	{
+		val = sqlite3_column_double(corp->rank_query, 0);
+		if (LOW_SCORE < val) val = LOW_SCORE;
+#ifdef DEBUG
+		printf ("Word=%s dj=%s score=%f\n", inflected_word, disjunct, val);
+#endif
+	}
+
+	/* Failure to do both a reset *and* a clear will cause subsequent
+	 * binds tp fail. */
+	sqlite3_reset(corp->rank_query);
+	sqlite3_clear_bindings(corp->rank_query);
+	return val;
+}
+
+/* ========================================================= */
+
+/**
+ * lg_corpus_score -- compute parse-ranking score for sentence.
+ *
+ * Given a parsed sentence, this routine will compute a parse ranking
+ * score, based on the probabilites of observing the indicated set of
+ * disjuncts in the statistics database.
+ *
+ * The score is stored in the Linkage_info->corpus_cost struct member.
+ *
+ * The score is currently computed as the average -log_2 conditional
+ * probability p(d|w) of observing disjunct 'd', given word 'w'.
+ * Lower scores are better -- they indicate more likely parses.
+ */
+void lg_corpus_score(Sentence sent, Linkage_info *lifo)
+{
+	const char *infword, *djstr;
+	double tot_score = 0.0f;
+	Corpus *corp = sent->dict->corpus;
+	int nwords = sent->length;
+	int w;
+
+	/* No-op if the database is not open */
+	if (NULL == corp->dbconn) return;
+
+	lg_compute_disjunct_strings(sent, lifo);
+
+	/* Decrement nwords, so as to ignore the RIGHT-WALL */
+	nwords --;
+
+	/* Loop over each word in the sentence (skipping LEFT-WALL, which is
+	 * word 0. */
+	for (w=1; w<nwords; w++)
+	{
+		Disjunct *disj = sent->parse_info->chosen_disjuncts[w];
+
+		/* disj is NULL if word did not participate in parse */
+		if (NULL == disj)
+		{
+			tot_score += LOW_SCORE;
+			continue;
+		}
+		infword = disj->string;
+		djstr = lifo->disjunct_list_str[w];
+		tot_score += get_disjunct_score(corp, infword, djstr);
+	}
+
+	/* Decrement nwords, so as to ignore the LEFT-WALL */
+	--nwords;
+	tot_score /= nwords;
+	lifo->corpus_cost = tot_score;
+}
+
+double lg_corpus_disjunct_score(Linkage linkage, int w)
+{
+	double score;
+	const char *infword, *djstr;
+	Sentence sent = linkage->sent;
+	Linkage_info *lifo = linkage->info;
+	Corpus *corp = sent->dict->corpus;
+	Disjunct *disj;
+
+	/* No-op if the database is not open */
+	if (NULL == corp->dbconn) return LOW_SCORE;
+
+	/* disj is NULL if word did not participate in parse */
+	disj = sent->parse_info->chosen_disjuncts[w];
+	if (NULL == disj) return LOW_SCORE;
+
+	lg_compute_disjunct_strings(sent, lifo);
+
+	infword = disj->string;
+	djstr = lifo->disjunct_list_str[w];
+	score = get_disjunct_score(corp, infword, djstr);
+
+	return score;
+}
+
+/* ========================================================= */
+
+/**
+ * lg_corpus_senses -- Given word and disjunct, look up senses.
+ *
+ * Given a particular disjunct for a word, look up its most
+ * likely sense assignments from the database. 
+ */
+
+static Sense * lg_corpus_senses(Corpus *corp,
+                                const char * inflected_word,
+                                const char * disjunct,
+                                int wrd)
+{
+	double log_prob;
+	const unsigned char *sense;
+	Sense *sns, *head = NULL;
+	int rc;
+
+	/* Look up the disjunct in the database */
+	rc = sqlite3_bind_text(corp->sense_query, 1,
+		inflected_word, -1, SQLITE_STATIC);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: SQLite can't bind word in sense query: rc=%d \n", rc);
+		return NULL;
+	}
+
+	rc = sqlite3_bind_text(corp->sense_query, 2,
+		disjunct, -1, SQLITE_STATIC);
+	if (rc != SQLITE_OK)
+	{
+		prt_error("Error: SQLite can't bind disjunct in sense query: rc=%d \n", rc);
+		return NULL;
+	}
+
+	rc = sqlite3_step(corp->sense_query);
+	while (SQLITE_ROW == rc)
+	{
+		sense = sqlite3_column_text(corp->sense_query, 0);
+		log_prob = sqlite3_column_double(corp->sense_query, 1);
+		// printf ("Word=%s dj=%s sense=%s score=%f\n", 
+		// 	inflected_word, disjunct, sense, log_prob);
+
+		sns = (Sense *) malloc(sizeof(Sense));
+		sns->next = head;
+		head = sns;
+
+		sns->inflected_word = inflected_word;
+		sns->disjunct = disjunct;
+		sns->sense = strdup(sense);
+		sns->score = log_prob;
+		sns->word = wrd;
+
+		/* Get the next row, if any */
+		rc = sqlite3_step(corp->sense_query);
+	}
+
+	/* Failure to do both a reset *and* a clear will cause subsequent
+	 * binds tp fail. */
+	sqlite3_reset(corp->sense_query);
+	sqlite3_clear_bindings(corp->sense_query);
+
+	return head;
+}
+
+/* ========================================================= */
+
+/**
+ * lg_corpus_linkage_senses -- Given a linkage, look up senses.
+ *
+ * Given a particular linakge, look up the most likely sense
+ * assignments from the database. 
+ *
+ * This function is not used to guide the parsing process; it is
+ * only an informational look-up.
+ */
+
+void lg_corpus_linkage_senses(Linkage linkage)
+{
+	const char * infword;
+	Sentence sent = linkage->sent;
+	Dictionary dict = sent->dict; 
+	Corpus *corp = dict->corpus;
+	int nwords = sent->length;
+	Linkage_info *lifo = linkage->info;
+	int w;
+
+	if (lifo->sense_list) return;
+
+	/* Set up the disjunct strings first */
+	lg_compute_disjunct_strings(sent, lifo);
+
+	lifo->nwords = nwords;
+	lifo->sense_list = (Sense **) malloc(nwords * sizeof (Sense *));
+	memset(lifo->sense_list, 0, nwords * sizeof (Sense *));
+
+	/* Decrement nwords, so as to ignore the RIGHT-WALL */
+	nwords --;
+
+	/* Loop over each word in the sentence (skipping LEFT-WALL, which is
+	 * word 0. */
+	for (w=1; w<nwords; w++)
+	{
+		Disjunct *disj = sent->parse_info->chosen_disjuncts[w];
+
+		/* disj is NULL if word did not participate in parse */
+		if (NULL == disj)
+		{
+			continue;
+		}
+		infword = disj->string;
+
+		lifo->sense_list[w] = lg_corpus_senses(corp, infword, 
+		                        lifo->disjunct_list_str[w], w);
+	}
+}
+
+/* ========================================================= */
+/* Return bits and pieces of the sense assignments */
+
+Sense * lg_get_word_sense(Linkage_info *lifo, int word)
+{
+	if (!lifo->sense_list) return NULL;
+	if (lifo->nwords <= word) return NULL;
+	return lifo->sense_list[word];
+}
+
+Sense * lg_sense_next(Sense *sns)
+{
+	return sns->next;
+}
+
+int lg_sense_get_index(Sense *sns)
+{
+	return sns->word;
+}
+
+const char * lg_sense_get_subscripted_word(Sense *sns)
+{
+	return sns->inflected_word;
+}
+
+const char * lg_sense_get_disjunct(Sense *sns)
+{
+	return sns->disjunct;
+}
+
+const char * lg_sense_get_sense(Sense *sns)
+{
+	return sns->sense;
+}
+
+double lg_sense_get_score(Sense *sns)
+{
+	return sns->score;
+}
+
+void lg_sense_delete(Linkage_info *lifo)
+{
+	size_t nwords = lifo->nwords;
+	size_t w;
+
+	if (NULL == lifo->sense_list) return;
+
+	for (w=0; w<nwords; w++)
+	{
+		Sense *sns = lifo->sense_list[w];
+		while (sns)
+		{
+			Sense * nxt = sns->next;
+			free(sns->sense);
+			free(sns);
+			sns = nxt;
+		}
+	}
+	free (lifo->sense_list);
+	lifo->sense_list = NULL;
+}
+
+/* ======================= END OF FILE ===================== */