1. A method for visually identifying spam in a text-based dataset, comprising the steps of: calculating, via a lexicon engine of a data processing module, a correlation K ij between combinations of words, wherein K ij is a coefficient between a correlation parameter C ij of lemmas i with lemmas j, over F i F j , where F i is frequency of word i and F j is frequency of word j; concatenating lemmas that have a correlation K ij above a predetermined level into an artificial word via the lexicon engine; recalculating, via the lexicon engine, a correlation K ij between combinations of words in an expanded dataset comprised of said text-based dataset and artificial words obtained by concatenation; repeating the steps above for N lemmas; and using a force directed graph to visually display, via a display in communication with the data processing module, the results obtained above into separate conversations, wherein each node in the graph has N outgoing partners, and the N co-words with the highest value of K ij above a minimum value are connected together.
1. A method for visually identifying spam in a text-based dataset, comprising the steps of: calculating, via a lexicon engine of a data processing module, a correlation K ij between combinations of words, wherein K ij is a coefficient between a correlation parameter C ij of lemmas i with lemmas j, over F i F j , where F i is frequency of word i and F j is frequency of word j; concatenating lemmas that have a correlation K ij above a predetermined level into an artificial word via the lexicon engine; recalculating, via the lexicon engine, a correlation K ij between combinations of words in an expanded dataset comprised of said text-based dataset and artificial words obtained by concatenation; repeating the steps above for N lemmas; and using a force directed graph to visually display, via a display in communication with the data processing module, the results obtained above into separate conversations, wherein each node in the graph has N outgoing partners, and the N co-words with the highest value of K ij above a minimum value are connected together. 3. A method according to claim 1 , wherein said step of calculating a correlation K ij between combinations of words includes the following steps performed by the lexicon engine of the data processing module: replacing each word in said dataset with a lemma; correlating each lemma with every other lemma to provide a value c ij , wherein c ij is the frequency of lemma i with lemma j; calculating a correlation parameter C ij between all combinations of entries; determining a frequency of each lemma F i ; calculating said correlation K ij according to the relation K ij =C ij 2 over F i F j , wherein F i is a frequency of a word i, F j is a frequency of a word j, and F i F j is the product of frequency of word i and frequency of word j.