Compressing the representation of a causal graph

摘要

the aim of this paper is to introduce procedure capable of compressing the representation of causal graphs, removing the redundant information introduced. In previous works we have presented several algorithms to extract causal information from text documents by means of a semi-automatic process. As result we obtained a causal graph connecting concepts related to a given topic.