/* This file is part of Pazpar2.
- Copyright (C) 2006-2009 Index Data
+ Copyright (C) 2006-2010 Index Data
Pazpar2 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
#include <stdlib.h>
#include "relevance.h"
-#include "pazpar2.h"
+#include "session.h"
struct relevance
{
int *doc_frequency_vec;
int vec_len;
struct word_entry *entries;
- pp2_charset_t pct;
+ pp2_relevance_token_t prt;
NMEM nmem;
};
return 0;
}
-static struct word_entry *build_word_entries(pp2_charset_t pct, NMEM nmem,
+static struct word_entry *build_word_entries(pp2_relevance_token_t prt,
+ NMEM nmem,
const char **terms)
{
int termno = 1; /* >0 signals THERE is an entry */
for (; *p; p++)
{
- pp2_relevance_token_t prt = pp2_relevance_tokenize(pct, *p, 0);
const char *norm_str;
+ pp2_relevance_first(prt, *p, 0);
while ((norm_str = pp2_relevance_token_next(prt)))
add_word_entry(nmem, &entries, norm_str, termno);
-
- pp2_relevance_token_destroy(prt);
-
termno++;
}
return entries;
void relevance_countwords(struct relevance *r, struct record_cluster *cluster,
const char *words, int multiplier, const char *name)
{
- pp2_relevance_token_t prt = pp2_relevance_tokenize(r->pct, words, 0);
int *mult = cluster->term_frequency_vec_tmp;
const char *norm_str;
int i, length = 0;
+ pp2_relevance_first(r->prt, words, 0);
for (i = 1; i < r->vec_len; i++)
mult[i] = 0;
- while ((norm_str = pp2_relevance_token_next(prt)))
+ while ((norm_str = pp2_relevance_token_next(r->prt)))
{
int res = word_entry_match(r->entries, norm_str);
if (res)
}
cluster->term_frequency_vec[0] += length;
- pp2_relevance_token_destroy(prt);
}
struct relevance *relevance_create(pp2_charset_t pct,
res->doc_frequency_vec = nmem_malloc(nmem, res->vec_len * sizeof(int));
memset(res->doc_frequency_vec, 0, res->vec_len * sizeof(int));
res->nmem = nmem;
- res->entries = build_word_entries(pct, nmem, terms);
- res->pct = pct;
+ res->prt = pp2_relevance_tokenize(pct);
+ res->entries = build_word_entries(res->prt, nmem, terms);
return res;
}
+void relevance_destroy(struct relevance **rp)
+{
+ if (*rp)
+ {
+ pp2_relevance_token_destroy((*rp)->prt);
+ *rp = 0;
+ }
+}
+
void relevance_newrec(struct relevance *r, struct record_cluster *rec)
{
if (!rec->term_frequency_vec)
int i;
float *idfvec = xmalloc(rel->vec_len * sizeof(float));
- reclist_rewind(reclist);
+ reclist_enter(reclist);
// Calculate document frequency vector for each term.
for (i = 1; i < rel->vec_len; i++)
{
#endif
relevance += 100000 * (termfreq * idfvec[t] + 0.0000005);
}
- rec->relevance = relevance;
+ rec->relevance_score = relevance;
}
- reclist_rewind(reclist);
+ reclist_leave(reclist);
xfree(idfvec);
}