| 摘要 |
Disclosed is a method that structures a sequentially-ordered set of elements (S305), each being characterized by a set of features. N-grams (sequence of n features) are computed (S320) from a set for n contiguous elements, and n-grams which are repetitive (Kleene cross) are selected (S330). Elements matching the most frequent repetitive n-gram are grouped together under a new node, and a new sequence is created (S335). The method is iteratively applied (S340) to this new sequence. The output is an ordered set of trees. |
