Semi-CRFs (Sarawagi and Cohen, 2004) are general CRFs that relax the Markovian assumptions to allow sequence labeling at the segment level.
arbitrarily long expressions can be modeled and their boundaries can be influenced by probable syntactic structure.