Then for each n/2 < i ≤ n we create a set F i by adding consecutively one more word found at position i in the entire set F .
in order to inspect our results we used a hierarchical clustering method and draw conclusions based on the most frequent result.