Natural Language Processing

Conceptual Knowledge Processing 109

2007). Starting with a context K := (G, M, I), the NextClosure

algorithm will compute the list Int((G, M, I)) of all intents or dually,

the list Ext((G, M, I)) of all extents.

If we have computed the system of all intents, Int((G, M, I)), then

B(G, M, I) = {(B', B)|B ¢ Int((G, M, I))}.

Hence, the entire conceptual hierarchy B(K) can be reconstructed

from the set of intents (dually, extents).

We start by giving a linear ordering on the attributes set, i.e.,

M := {1, 2, . . . , n}. This is not restricting at all, since even writing

them in the cross-table means to order them.

We defi ne the lectic order on the set ...