-
Notifications
You must be signed in to change notification settings - Fork 39
/
overlap.c
160 lines (134 loc) · 3.57 KB
/
overlap.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
/*----------------------------------------------------------------------------
*
* overlap.c
*
* Overlap Coefficient is a similarity measure
*
* It computes the overlap between sets, and is defined as the size of the
* intersection divided by the minimum size of the sets.
*
* | A intersection B |
* s = ----------------------
* min(|A|, |B|)
*
* For example:
*
* x: euler = {eu, ul, le, er}
* y: heuser = {he, eu, us, se, er}
*
* 2 2
* s = ----------- = --- = 0.5
* min(4, 5) 4
*
* PS> we call n-grams: (i) n-sequence of letters (ii) n-sequence of words
*
*
* Copyright (c) 2008-2020, Euler Taveira de Oliveira
*
*----------------------------------------------------------------------------
*/
#include "similarity.h"
#include "tokenizer.h"
/* GUC variables */
int pgs_overlap_tokenizer = PGS_UNIT_ALNUM;
double pgs_overlap_threshold = 0.7f;
bool pgs_overlap_is_normalized = true;
PG_FUNCTION_INFO_V1(overlapcoefficient);
Datum
overlapcoefficient(PG_FUNCTION_ARGS)
{
char *a, *b;
TokenList *s, *t;
int atok, btok, comtok, alltok;
int mintok;
float8 res;
a = DatumGetPointer(DirectFunctionCall1(textout,
PointerGetDatum(PG_GETARG_TEXT_P(0))));
b = DatumGetPointer(DirectFunctionCall1(textout,
PointerGetDatum(PG_GETARG_TEXT_P(1))));
if (strlen(a) > PGS_MAX_STR_LEN || strlen(b) > PGS_MAX_STR_LEN)
ereport(ERROR,
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
errmsg("argument exceeds the maximum length of %d bytes",
PGS_MAX_STR_LEN)));
/* sets */
s = initTokenList(1);
t = initTokenList(1);
switch (pgs_overlap_tokenizer)
{
case PGS_UNIT_WORD:
tokenizeBySpace(s, a);
tokenizeBySpace(t, b);
break;
case PGS_UNIT_GRAM:
tokenizeByGram(s, a);
tokenizeByGram(t, b);
break;
case PGS_UNIT_CAMELCASE:
tokenizeByCamelCase(s, a);
tokenizeByCamelCase(t, b);
break;
case PGS_UNIT_ALNUM: /* default */
default:
tokenizeByNonAlnum(s, a);
tokenizeByNonAlnum(t, b);
break;
}
elog(DEBUG3, "Token List A");
printToken(s);
elog(DEBUG3, "Token List B");
printToken(t);
atok = s->size;
btok = t->size;
/* combine the sets */
switch (pgs_overlap_tokenizer)
{
case PGS_UNIT_WORD:
tokenizeBySpace(s, b);
break;
case PGS_UNIT_GRAM:
tokenizeByGram(s, b);
break;
case PGS_UNIT_CAMELCASE:
tokenizeByCamelCase(s, b);
break;
case PGS_UNIT_ALNUM: /* default */
default:
tokenizeByNonAlnum(s, b);
break;
}
elog(DEBUG3, "All Token List");
printToken(s);
alltok = s->size;
destroyTokenList(s);
destroyTokenList(t);
comtok = atok + btok - alltok;
mintok = min2(atok, btok);
elog(DEBUG1, "is normalized: %d", pgs_overlap_is_normalized);
elog(DEBUG1, "token list A size: %d", atok);
elog(DEBUG1, "token list B size: %d", btok);
elog(DEBUG1, "all tokens size: %d", alltok);
elog(DEBUG1, "common tokens size: %d", comtok);
elog(DEBUG1, "min between A and B sizes: %d", mintok);
/* normalized and unnormalized version are the same */
res = (float8) comtok / mintok;
PG_RETURN_FLOAT8(res);
}
PG_FUNCTION_INFO_V1(overlapcoefficient_op);
Datum overlapcoefficient_op(PG_FUNCTION_ARGS)
{
float8 res;
/*
* store *_is_normalized value temporarily 'cause
* threshold (we're comparing against) is normalized
*/
bool tmp = pgs_overlap_is_normalized;
pgs_overlap_is_normalized = true;
res = DatumGetFloat8(DirectFunctionCall2(
overlapcoefficient,
PG_GETARG_DATUM(0),
PG_GETARG_DATUM(1)));
/* we're done; back to the previous value */
pgs_overlap_is_normalized = tmp;
PG_RETURN_BOOL(res >= pgs_overlap_threshold);
}