src/Gargantext/Text/Terms.hs

   1 {-|
   2 Module      : Gargantext.Text.Ngrams
   3 Description : Ngrams definition and tools
   4 Copyright   : (c) CNRS, 2017 - present
   5 License     : AGPL + CECILL v3
   6 Maintainer  : team@gargantext.org
   7 Stability   : experimental
   8 Portability : POSIX
   9
  10 An @n-gram@ is a contiguous sequence of n items from a given sample of
  11 text. In Gargantext application the items are words, n is a non negative
  12 integer.
  13
  14 Using Latin numerical prefixes, an n-gram of size 1 is referred to as a
  15 "unigram"; size 2 is a "bigram" (or, less commonly, a "digram"); size
  16 3 is a "trigram". English cardinal numbers are sometimes used, e.g.,
  17 "four-gram", "five-gram", and so on.
  18
  19 Source: https://en.wikipedia.org/wiki/Ngrams
  20
  21 TODO
  22 group Ngrams -> Tree
  23 compute occ by node of Tree
  24 group occs according groups
  25
  26 compute cooccurrences
  27 compute graph
  28
  29 -}
  30
  31 {-# LANGUAGE NoImplicitPrelude #-}
  32
  33 module Gargantext.Text.Terms
  34   where
  35
  36 import Data.Text (Text)
  37
  38 import Gargantext.Prelude
  39 import Gargantext.Core
  40 import Gargantext.Core.Types
  41 import Gargantext.Text.Terms.Multi (multiterms)
  42 import Gargantext.Text.Terms.Mono  (monoterms')
  43
  44 data TermType = Mono | Multi
  45
  46 -- remove Stop Words
  47 -- map (filter (\t -> not . elem t)) $
  48 ------------------------------------------------------------------------
  49 terms :: TermType -> Lang -> Text -> IO [Terms]
  50 terms Mono  lang txt = pure $ monoterms' lang txt
  51 terms Multi lang txt = multiterms lang txt
  52 ------------------------------------------------------------------------
  53