Instructions / number of words for Chink & Chunk (logarithmic scale) With the shallow parser algorithm, we can detect and label more syntactic and hierarchic data: in the average, worst a nd best cases, for M sentences, each sentence consisting of Nw words; for a set of C precompiled categories, its complexity has an order of M*C*(Nw²+Nw)*Constant.
mandatory cooccurrence between sets of categories Uniqueness (Uniq) Set of categories which cannot be repeated in a phrase In this approach, describing a phrase consists in specifying a set of constraints over some categories that can constitute it.