src-test/Core/Text.hs

   1
   2 {-|
   3 Module      : Graph.Clustering
   4 Description : Basic tests to avoid quick regression
   5 Copyright   : (c) CNRS, 2017-Present
   6 License     : AGPL + CECILL v3
   7 Maintainer  : team@gargantext.org
   8 Stability   : experimental
   9 Portability : POSIX
  10
  11 -}
  12
  13
  14 module Core.Text where
  15
  16 {-
  17 import Gargantext.API.Ngrams.Types (NgramsTerm(..))
  18 import Gargantext.Core.Viz.Graph (Graph(..))
  19 import Gargantext.Prelude
  20 import Test.Hspec
  21 import Data.HashMap.Strict (HashMap)
  22 import qualified Data.HashMap.Strict as HashMap
  23 import qualified Data.List as List
  24 import Gargantext.Core.Viz.Graph.Tools (PartitionMethod(..))
  25 import Gargantext.Core.Viz.Graph.Tools.IGraph (spinglass)
  26 import Gargantext.Core.Methods.Distances (Distance(..))
  27
  28 -- | https://en.wikipedia.org/wiki/Text_mining
  29 testText_en :: Text
  30 testText_en = DT.pack "Text mining, also referred to as text data mining, roughly equivalent to text analytics, is the process of deriving high-quality information from text. High-quality information is typically derived through the devising of patterns and trends through means such as statistical pattern learning. Text mining usually involves the process of structuring the input text (usually parsing, along with the addition of some derived linguistic features and the removal of others, and subsequent insertion into a database), deriving patterns within the structured data, and finally evaluation and interpretation of the output. 'High quality' in text mining usually refers to some combination of relevance, novelty, and interestingness. Typical text mining tasks include text categorization, text clustering, concept/entity extraction, production of granular taxonomies, sentiment analysis, document summarization, and entity relation modeling (i.e., learning relations between named entities). Text analysis involves information retrieval, lexical analysis to study word frequency distributions, pattern recognition, tagging/annotation, information extraction, data mining techniques including link and association analysis, visualization, and predictive analytics. The overarching goal is, essentially, to turn text into data for analysis, via application of natural language processing (NLP) and analytical methods. A typical application is to scan a set of documents written in a natural language and either model the document set for predictive classification purposes or populate a database or search index with the information extracted."
  31
  32
  33 testText_en_2 :: Text
  34 testText_en_2 = DT.pack "It is hard to detect important articles in a specific context. Information retrieval techniques based on full text search can be inaccurate to identify main topics and they are not able to provide an indication about the importance of the article. Generating a citation network is a good way to find most popular articles but this approach is not context aware. The text around a citation mark is generally a good summary of the referred article. So citation context analysis presents an opportunity to use the wisdom of crowd for detecting important articles in a context sensitive way. In this work, we analyze citation contexts to rank articles properly for a given topic. The model proposed uses citation contexts in order to create a directed and edge-labeled citation network based on the target topic. Then we apply common ranking algorithms in order to find important articles in this newly created network. We showed that this method successfully detects a good subset of most prominent articles in a given topic. The biggest contribution of this approach is that we are able to identify important articles for a given search term even though these articles do not contain this search term. This technique can be used in other linked documents including web pages, legal documents, and patents as well as scientific papers."
  35
  36
  37 -- | https://fr.wikipedia.org/wiki/Fouille_de_textes
  38 testText_fr :: Text
  39 testText_fr = DT.pack "La fouille de textes ou « l'extraction de connaissances » dans les textes est une spécialisation de la fouille de données et fait partie du domaine de l'intelligence artificielle. Cette technique est souvent désignée sous l'anglicisme text mining. Elle désigne un ensemble de traitements informatiques consistant à extraire des connaissances selon un critère de nouveauté ou de similarité dans des textes produits par des humains pour des humains. Dans la pratique, cela revient à mettre en algorithme un modèle simplifié des théories linguistiques dans des systèmes informatiques d'apprentissage et de statistiques. Les disciplines impliquées sont donc la linguistique calculatoire, l'ingénierie des langues, l'apprentissage artificiel, les statistiques et l'informatique."
  40
  41
  42 termTests :: Text
  43 termTests = "It is hard to detect important articles in a specific context. Information retrieval techniques based on full text search can be inaccurate to identify main topics and they are not able to provide an indication about the importance of the article. Generating a citation network is a good way to find most popular articles but this approach is not context aware. The text around a citation mark is generally a good summary of the referred article. So citation context analysis presents an opportunity to use the wisdom of crowd for detecting important articles in a context sensitive way. In this work, we analyze citation contexts to rank articles properly for a given topic. The model proposed uses citation contexts in order to create a directed and edge-labeled citation network based on the target topic. Then we apply common ranking algorithms in order to find important articles in this newly created network. We showed that this method successfully detects a good subset of most prominent articles in a given topic. The biggest contribution of this approach is that we are able to identify important articles for a given search term even though these articles do not contain this search term. This technique can be used in other linked documents including web pages, legal documents, and patents as well as scientific papers."
  44
  45
  46 -- | Ngrams Test
  47 -- >> ngramsTest testText
  48 -- 248
  49 --ngramsTest :: Text -> Int
  50 --ngramsTest x =  length ws
  51 --  where
  52 --    --txt = concat <$> lines <$> clean <$> readFile filePath
  53 --    txt = clean x
  54 --    -- | Number of sentences
  55 --    --ls   = sentences $ txt
  56 --    -- | Number of monograms used in the full text
  57 --    ws   = ngrams    $ txt
  58 --    -- | stem ngrams
  59     -- TODO
  60     -- group ngrams
  61     --ocs  = occ       $ ws
  62     --
  63 -}