Abstract
We show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming; the other is a supermodular quadratic pseudo-Boolean maximization problem, which can be solved in cubic time using a minimum cut algorithm. We use dual decomposition to force their agreement. Experimental results on Twitter named entity recognition and sentence dependency tagging tasks show that our method outperforms spanning tree based dual decomposition.
This content is only available as a PDF.
©2014 Association for Computational
Linguistics.
2014
Association for Computational Linguistics
This is an open-access article distributed under the terms of the
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
License, which permits you to copy and redistribute in any medium or format,
for non-commercial use only, provided that the original work is not remixed,
transformed, or built upon, and that appropriate credit to the original
source is given. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.