-
Notifications
You must be signed in to change notification settings - Fork 0
/
relations.c
163 lines (123 loc) · 3.92 KB
/
relations.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
161
162
163
/*
* relations.c
*
* Copyright (C) 2003 Nadav Rotem <nadav256@hotmail.com>
*
* 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 2 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 Library General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "grader-tc.h"
#include "libots.h"
/*
The Inner product of two texts is defined as the number of topics they
share. This set of functions implements this relations using the ots
api.
Application: a relation between a slashdot article and a comment made
usage: ots_text_relations(story,"en",comment,"en",n);
where n is the max number of most important topics to consider; safe to give a high number (ex: 20);
returns:
0 - off topic
n - number of topics they share
*/
#define OTS_MAX_TOPIC_WORD_SIZE 256
/*Returns the number of topics that two blocks of text share*/
int ots_text_relations(
const unsigned char *text1,const unsigned char *lang_code1,
const unsigned char *text2,const unsigned char *lang_code2,const int topic_num)
{
GList* top1;
GList* top2;
int score;
top1=ots_text_stem_list(text1,lang_code1,topic_num);
top2=ots_text_stem_list(text2,lang_code2,topic_num);
score=ots_topic_list_score(top1,top2);
if (top1){g_list_foreach (top1, (GFunc) g_free, NULL);g_list_free (top1);}
if (top2){g_list_foreach (top2, (GFunc) g_free, NULL);g_list_free (top2);}
return score;
}
/*For a given text, return the list of the topics*/
char* ots_text_topics(
const unsigned char *text,const unsigned char *lang_code,int topic_num)
{
int i;
GString *word;
unsigned char *str;
unsigned char *tmp;
OtsArticle *Art;
if (NULL==text) return NULL;
word = g_string_new (NULL);
Art = ots_new_article ();
ots_load_xml_dictionary(Art,lang_code); /*Load the dictionary*/
if (text!=NULL) ots_parse_stream (text,strlen(text), Art); /* read text , put it in struct Article */
ots_grade_doc (Art);
for (i=0;i<=topic_num;i++)
{
tmp=ots_word_in_list(Art->ImpWords,i);
if ((tmp!=NULL)&&(strlen(tmp)>0)) {g_string_append(word,tmp);
g_string_append(word," "); }
}
str=word->str;
g_string_free (word, FALSE);
ots_free_article (Art);
return str;
}
/*For a given text, return the list of the stemmed topics*/
GList* ots_text_stem_list(const unsigned char *text, const unsigned char *lang_code, int topic_num)
{
int i;
GList *topics=NULL;
unsigned char *tmp;
OtsArticle *Art;
if (NULL==text) return NULL;
Art = ots_new_article ();
ots_load_xml_dictionary(Art,lang_code);
if (text!=NULL) ots_parse_stream (text,strlen(text), Art);
ots_grade_doc (Art);
for (i=0;i<=topic_num;i++)
{
tmp=ots_stem_in_list(Art->ImpWords,i);
if ((tmp)&&(strlen(tmp)>0))
topics=g_list_append(topics,g_strdup(tmp));
}
ots_free_article (Art);
return topics;
}
/*Gives a score on the relations between two lists of topics; simmilar to the inner product*/
int ots_topic_list_score(
const GList *topic_list1,
const GList *topic_list2)
{
int count=0;
GList *tmplist1;
GList *tmplist2;
if (!(topic_list1)) return 0;
if (!(topic_list2)) return 0;
tmplist1 = g_list_first(topic_list1);
while(tmplist1)
{
tmplist2 = g_list_first(topic_list2);
while(tmplist2)
{
if ((tmplist1->data)&&(tmplist2->data)&&(strlen(tmplist2->data)>1))
if (0==strncmp(tmplist1->data,tmplist2->data,OTS_MAX_TOPIC_WORD_SIZE))
{count++;}
tmplist2 = g_list_next(tmplist2);
}
tmplist1 = g_list_next(tmplist1);
}
return count;
}