About this paper

Combines local pattern-based sequence models with the longer-range structure of weighted context-free grammars.

The resulting grammatical pattern-based CRF captures complementary forms of interaction. The paper analyzes inference complexity and develops polynomial-time algorithms, with faster inference for a special family of interaction grammars.