-
Notifications
You must be signed in to change notification settings - Fork 1
/
getCandidates.hs
188 lines (156 loc) · 7.41 KB
/
getCandidates.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
import Data.Char
import Data.List
import System.IO
import Data.List.Split
import Data.Maybe
import Control.Monad
import qualified Data.Map as M
import qualified Data.Set as S
import System.Directory
import System.FilePath
inDir = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "/home/user/Documents/training_set/"
outDir = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "/home/user/Documents/candidates/"
stopWordFile = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "stopwords.txt"
morphLexicon = ""--HAS TO BE ADDED BEFORE COMPILING AND EXECUTING; example: "morphLexicon.txt"
stemN = 5 :: Int
rareNumber = 10 :: Int
takeNumber = 960 :: Int
data Phrase = Phrase {
pWords :: [String],
pPos :: [Int] } deriving (Show, Read, Eq, Ord)
data Candidate = Candidate {
cTF :: Float,
cIDF :: Float,
cTFIDF :: Float,
cFirst :: Int,
cLast :: Int,
cF :: Int,
cS :: Int,
cT :: Int,
cNumber :: Int,
cRare :: Int,
cTitle :: Int,
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
getLemma :: String -> M.Map String String -> M.Map String String
getLemma s m = M.insert fi le m
where w = words s
fi = map toLower $ head w
le = map (\c -> toLower c) $ head $ tail $ w
lemmatize :: [String] -> M.Map String String -> [String]
lemmatize ws m = map (\w -> solve w (M.lookup w m)) ws
where solve w (Nothing) = w
solve _ (Just a) = a
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
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 "€—£§«»<@♦¬°►•[_{„¥©>^~■®▼]"))
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
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
getTextOnly :: String -> String
getTextOnly s = head $ splitOn "</body>" $ last $ splitOn "<body>" s
getTitle :: String -> String
getTitle s = head $ splitOn "</title>" $ last $ splitOn "<title>" s
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) = error $ "only" ++ show k
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) = error $ show k
getdfm k (Just a) = a
cfirst (Phrase _ l) = head l
clast (Phrase _ l) = last l
oneTh = div doclen 3
first (Phrase _ l) = length $ filter (\l' -> l' <= oneTh) l
secon (Phrase _ l) = length $ filter (\l' -> l' > oneTh && l' <= (2*oneTh)) l
third (Phrase _ l) = length $ filter (\l' -> l' > (2*oneTh)) l
numb k = length k
rare k | length k == 1 = length $ filter (\k' -> S.member k' toponeword) k
| otherwise = 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
main = do
sws <- readFile stopWordFile
pos <- readFile morphLexicon
let lem = foldl (\m a' -> (getDict a' m)) M.empty $ lines pos
let lemmas = foldl (\m a' -> (getLemma a' m)) M.empty $ lines pos
let stopW = S.fromList $ lines sws
fns <- getDirectoryContents inDir
s' <- readFile "phraseFreq.txt"
let pfq = M.fromList $ read s'
let a = take takeNumber $ filterFiles fns
forM a (processFiles stopW lem lemmas pfq)
filterFiles [] = error "empty folder"
filterFiles fs = map (\f -> inDir ++ f) $ sort $ filter (\f -> isSuffixOf ".xml" f) fs
processFiles stopW lem lemmas pfq fn = do
s <- readFile fn
let ttl = getTitle s
let txt = ttl ++ " . " ++ getTextOnly s
let phr = getPhrases $ map (\ph -> lemmatize ph lemmas) $ 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 (map (\ph -> lemmatize ph lemmas) $ filter (\ph -> filterPOS ph lem) $ filter (removeStop stopW) $ makeTuples ttl) len
let nfn = outDir ++ (snd $ splitFileName fn)
writeFile nfn $ show $ M.toList can
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)