-
Notifications
You must be signed in to change notification settings - Fork 1
/
kex.hs
250 lines (218 loc) · 9.23 KB
/
kex.hs
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
{-# LANGUAGE DeriveDataTypeable, FlexibleInstances, MultiParamTypeClasses #-}
import GenProg
import Data.Generics
import Control.Monad
import Control.Monad.Random
import qualified Data.Map as M
import qualified Data.Set as S
import Data.Char
import Data.List
import Data.Maybe
import System.Directory
import Data.List.Split
import System.Environment
stopWordFile = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "stopwords.txt"
morphLexicon = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "morphLexicon.txt"
candidateFrequency = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "phraseFreq.txt"
--------------------------
--GENPROG
--------------------------
data E = Plus E E
| Minus E E
| Times E E
| Div E E
| Log E
| Inv E
| TimTen E
| DivTen E
| Tf
| Idf
| Tfidf
| First
| Last
| NumberF
| NumberS
| NumberT
| Length
| Rare
| Title
deriving (Typeable,Data,Eq,Show,Read)
eval :: E -> Candidate -> Maybe Float
eval (Plus e1 e2) c = liftM2 (+) (eval e1 c) (eval e2 c)
eval (Minus e1 e2) c = liftM2 (-) (eval e1 c) (eval e2 c)
eval (Times e1 e2) c = liftM2 (*) (eval e1 c) (eval e2 c)
eval (Div e1 e2) c | ok = liftM2 (/) x1 x2
| otherwise = Nothing
where (x1,x2) = (eval e1 c,eval e2 c)
ok = x2 /= Just 0
eval (Log e1) c | ok = liftM (log) x1
| otherwise = Nothing
where x1 = eval e1 c
ok = x1 > Just 0
eval (Inv e1) c | ok = liftM (1.0 / ) x1
| otherwise = Nothing
where x1 = eval e1 c
ok = x1 /= Just 0
eval (TimTen e1) c = liftM (10.0 *) (eval e1 c)
eval (DivTen e1) c = liftM (/ 10.0) (eval e1 c)
eval Tf c = Just (cTF c)
eval Idf c = Just (cIDF c)
eval Tfidf c = Just (cTFIDF c)
eval First c = Just (cFirst c)
eval Last c = Just (cLast c)
eval NumberF c = Just (cF c)
eval NumberS c = Just (cS c)
eval NumberT c = Just (cT c)
eval Length c = Just (cNumber c)
eval Rare c = Just (cRare c)
eval Title c = Just (cTitle c)
data Phrase = Phrase {
pWords :: [String],
pPos :: [Int] } deriving (Show, Read, Eq, Ord)
data Candidate = Candidate {
cTF :: Float,
cIDF :: Float,
cTFIDF :: Float,
cFirst :: Float,
cLast :: Float,
cF :: Float,
cS :: Float,
cT :: Float,
cNumber :: Float,
cRare :: Float,
cTitle :: Float,
cOrig :: String } deriving (Show, Read, Eq, Ord)
--------------------------------------------------------------
getDict :: String -> M.Map String [String] -> M.Map String [String]
getDict s m = M.insert fi le m
where w = words s
le = filter (\w' -> (isUpper $ head w') && length w' == 1) $ tail w
fi = map toLower $ head w
getComb :: [String] -> [String] -> M.Map String [String] -> [String]
getComb [] l _ = l
getComb ss [] m = getComb (tail ss) el m
where el = fin $ M.lookup (head ss) m
fin (Just x) = x
fin (Nothing) = ["X"]
getComb ss l m = getComb (tail ss) con m
where el = fin $ M.lookup (head ss) m
fin (Just x) = x
fin (Nothing) = ["X"]
con = concat $ map (\el' -> map (\l' -> l' ++ el') l) el
posPat = ["N","AN","NN","X","NSN","V"]
filterPOS :: [String] -> M.Map String [String] -> Bool
filterPOS phr m = any (\pat' -> elem pat' posPat) pat
where pat = getComb phr [] m
takeTuple :: [String] -> [[String]]
takeTuple [] = []
takeTuple w
| l >= 4 = [take 4 w] ++ [take 3 w] ++ [take 2 w] ++ [[head w]] ++ (takeTuple $ tail w)
| l == 3 = [w] ++ [take 2 w] ++ [[head w]] ++ (takeTuple $ tail w)
| l >= 2 = [w] ++ [[head w]] ++ [tail w]
| otherwise = [w]
where l = length w
splitText :: String -> String -> [String]
splitText word [] = [word]
splitText word (t:ts)
| not (isAlpha t || isSpace t || isDigit t || elem t "-'\"") = [word] ++ splitText "" ts
| isDigit t || elem t "-'\"" = splitText word ts
| isSpace t = splitText (word ++ " ") ts
| otherwise = splitText (word ++ [toLower t]) ts
makeTuples :: String -> [[String]]
makeTuples = concat . map takeTuple . map words . splitText "" . filter (\x -> not (elem x "€—£§«»<@♦¬°►•[_{„¥©>^~■®▼]"))
stem2 :: String -> String
stem2 "" = error "stemming empty string"
stem2 s
| i >= stemN && i > div (length s) 2 = take i s
| otherwise = s
where i = if fi == [] then 10 else maximum fi
fi = findIndices (\a -> elem a "aeiouAEIOU") s
stem :: [String] -> [String]
stem (x:[]) = [stem2 x]
stem xs = map (take 5) xs
removeStop :: S.Set String -> [String] -> Bool
removeStop stopW (a:[]) = not (S.member a stopW)
removeStop stopW (a:b:[]) = not (S.member a stopW) && not (S.member b stopW)
removeStop stopW (a:b:c:[]) = not (S.member a stopW) && not (S.member c stopW)
removeStop stopW (a:b:c:d:[]) = not (S.member a stopW) && not (S.member d stopW)
getTextOnly :: String -> String
getTextOnly s = head $ splitOn "</body>" $ last $ splitOn "<body>" s
getTitle :: String -> String
getTitle s = head $ splitOn "</title>" $ last $ splitOn "<title>" s
makeTuples' :: String -> [String]
makeTuples' = stem . words
getKeywords :: String -> [[[String]]]
getKeywords s = map getKW . tail $ splitOn "<keywords " s
where getKW st = map (makeTuples' . map toLower . head . splitOn "</keyword>") . tail $ splitOn "<keyword>" st
getKeys :: String -> ([[String]], [[String]])
getKeys s = (uniq, allk)
where kw = getKeywords s
kw' = concat kw
uniq = foldl (\l k -> if elem k l then l else k : l) [] kw'
allk = foldl (\a b -> filter (\a' -> elem a' b) a) (head kw) (tail kw)
getPhrases :: [[String]] -> M.Map [String] Phrase
getPhrases s = foldl (\map (i,c) -> M.insertWith addPhrase (stem c) (Phrase c [i]) map) M.empty cand
where cand = zip [1..] s
addPhrase (Phrase c1 is) (Phrase c2 is') = Phrase c1 (is' ++ is)
onlyOneword :: M.Map [String] Phrase -> M.Map [String] Int -> Int -> S.Set (Float, String)
onlyOneword m dfm l = M.foldWithKey (\k o s -> S.insert (tfidf k o,w o) s) S.empty okW
where onlyOne (x:[]) = True
onlyOne _ = False
okW = M.filter (\(Phrase w _) -> onlyOne w) m
w (Phrase (x:[]) _ ) = x
p (Phrase _ l') = fromIntegral $ length l'
tfidf k o = ((p o) / (fromIntegral l)) * log ((fromIntegral $ takeNumber) / (fromIntegral $ getdfm k $ M.lookup k dfm))
getdfm k (Nothing) = 1
getdfm k (Just a) = a
makeCandidates :: M.Map [String] Phrase -> S.Set String -> M.Map [String] Int -> [[String]] -> Int -> M.Map [String] Candidate
makeCandidates phrases toponeword dfm title doclen = M.mapWithKey (\k a -> mkC k a) phrases
where tf (Phrase _ l) = (fromIntegral $ length l) / (fromIntegral doclen)
idf k = (fromIntegral $ takeNumber) / (fromIntegral $ getdfm k $ M.lookup k dfm)
getdfm k (Nothing) = 1
getdfm k (Just a) = a
cfirst (Phrase _ l) = fromIntegral $ head l
clast (Phrase _ l) = fromIntegral $ last l
oneTh = div doclen 3
first (Phrase _ l) = fromIntegral $ length $ filter (\l' -> l' <= oneTh) l
secon (Phrase _ l) = fromIntegral $ length $ filter (\l' -> l' > oneTh && l' <= (2*oneTh)) l
third (Phrase _ l) = fromIntegral $ length $ filter (\l' -> l' > (2*oneTh)) l
numb k = fromIntegral $ length k
rare k | length k == 1 = fromIntegral $ length $ filter (\k' -> S.member k' toponeword) k
| otherwise = fromIntegral $ length $ filter (\k' -> S.member k' toponeword') k
toponeword' = S.map (\str -> take 5 str) toponeword
titl k = if elem k title then 1 else 0
orig (Phrase w _) = unwords w
mkC k a = Candidate (tf a) (idf k) ((tf a) * log(idf k)) (cfirst a) (clast a) (first a) (secon a) (third a) (numb k) (rare k) (titl k) (orig a)
takeBest :: S.Set (Float, String) -> S.Set String
takeBest s = S.fromList $ map (\(f,s') -> s') $ take rareNumber $ reverse $ S.toList s
rankCandidates :: (Candidate -> Maybe Float) -> M.Map [String] Candidate -> Int -> [String]
rankCandidates evF m i = take i $ map snd l
where l = sort $ M.foldWithKey (\k c s -> (solve (evF c), cOrig c) : s) [] m
solve (Nothing) = 1000000
solve (Just a ) = a
---------------------------------------------------------------------
stemN = 5 :: Int
rareNumber = 10 :: Int
takeNumber = 300 :: Int
takeSample = 60 :: Int
main = do
args <- getArgs
let tr = head $ args
let fn = head $ tail args
sws <- readFile stopWordFile
pos <- readFile morphLexicon
s' <- readFile candidateFrequency
tree' <- readFile tr
let lem = foldl (\m a' -> (getDict a' m)) M.empty $ lines pos
let stopW = S.fromList $ lines sws
let tree'' = read $ tree' :: (String,Float)
let tree = read $ fst $ tree'' :: E
let pfq = M.fromList $ read s'
txt <- readFile fn
let ttl = head $ lines txt
let phr = getPhrases $ filter (\ph -> filterPOS ph lem) $ filter (removeStop stopW) $ makeTuples txt
let len = M.size phr
let owp = onlyOneword phr pfq len
let can = makeCandidates phr (takeBest owp) pfq (filter (removeStop stopW) $ makeTuples ttl) len
let mRes = unlines $ rankCandidates (eval tree) can 10
putStrLn mRes