With the recent development of fast fully unsupervised parsers, it is now possible to add parserbased information to lexical patterns while keeping the language-independence of the whole framework and still avoiding heavy computational costs.
we incorporate the bracketings induced by the parser into the meta-patterns used by a symmetric patterns and graph-based unsupervised concept discovery algorithm.