The main idea behind our approach is that edges in the co-occurrence graph participating in cycles are likely to connect vertices (i.e., words) belonging to the same meaning component.
we focus on cycles of length 3 and 4, called respectively triangles and squares in graph theory.