Conditional random fields (CRF) are widely used for sequence labeling such as Named Entity Recognition (NER) problems. Most CRFs, in Natural Language Processing (NLP) tasks, model the dependencies between predicted labels without any consideration for the syntactic specificity of the document. Unfortunately, these approaches are not flexible enough to consider grammatically rich documents like patents. Additionally, the position and the grammatical class of the words may influence the text’s understanding. Therefore, in this paper, we introduce SynCRF which considers grammatical information to compute pairwise potentials. Syn-CRF is applied to TRIZ (Theory of Inventive Problem Solving), which offers a comprehensive set of tools to analyze and solve problems. TRIZ aims to provide users with inventive solutions given technical contradiction parameters. SynCRF is applied to mine these parameters from patent documents. Experiments on a labeled real-world dataset of patents show that SynC RF outperforms state-of-the-art and baseline approaches.