{"paper":{"title":"Combining pattern-based CRFs and weighted context-free grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.FL","authors_text":"Rustem Takhanov, Vladimir Kolmogorov","submitted_at":"2014-04-22T12:44:42Z","abstract_excerpt":"We consider two models for the sequence labeling (tagging) problem. The first one is a {\\em Pattern-Based Conditional Random Field }(\\PB), in which the energy of a string (chain labeling) $x=x_1\\ldots x_n\\in D^n$ is a sum of terms over intervals $[i,j]$ where each term is non-zero only if the substring $x_i\\ldots x_j$ equals a prespecified word $w\\in \\Lambda$. The second model is a {\\em Weighted Context-Free Grammar }(\\WCFG) frequently used for natural language processing. \\PB and \\WCFG encode local and non-local interactions respectively, and thus can be viewed as complementary.\n  We propose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5475","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}