github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-20 05:11:44 +03:00
Code Issues Projects Releases Wiki Activity

Revert "Carry indices along through the computation."

Browse Source 
This reverts commit 2cc2d4d78688266a4a6791de47bfd27bfa3cca43.
This commit is contained in:
Rob Rix 2016-06-29 10:30:32 -04:00
parent a5cce717c8
commit 11a2ab907a
1 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
src/Data/RandomWalkSimilarity.hs
View File

@ -22,25 +22,24 @@ rws compare getLabel as bs
| null as, null bs = []
| null as = insert <$> bs
| null bs = delete <$> as
| otherwise = uncurry deleteRemaining . (`runState` Set.empty) $ traverse findNearestNeighbourTo fbs
| otherwise = uncurry deleteRemaining . (`runState` Set.empty) $ traverse findNearestNeighbourTo (featurize <$> bs)
where insert = pure . Insert
delete = pure . Delete
replace = (pure .) . Replace
(p, q) = (2, 2)
d = 15
fas = zip (featurize <$> as) [0..]
fbs = zip (featurize <$> bs) [0..]
kdas = KdTree.build (Vector.toList . fst . fst) fas
fas = featurize <$> as
kdas = KdTree.build (Vector.toList . fst) fas
featurize = featureVector d . pqGrams p q getLabel &&& identity
findNearestNeighbourTo kv@((_, v), i) = do
findNearestNeighbourTo kv@(_, v) = do
mapped <- get
let ((k, nearest), j) = KdTree.nearest kdas kv
let (k, nearest) = KdTree.nearest kdas kv
if k `Set.member` mapped
then pure $! insert v
else do
put (Set.insert k mapped)
pure $! fromMaybe (replace nearest v) (compare nearest v)
deleteRemaining diff mapped = diff <> (delete . snd . fst <$> filter (not . (`Set.member` mapped) . fst . fst) fas)
deleteRemaining diff mapped = diff <> (delete . snd <$> filter (not . (`Set.member` mapped) . fst) fas)
data Gram label = Gram { stem :: [Maybe label], base :: [Maybe label] }
deriving (Eq, Show)