A fast finite-state relaxation method for enforcing global constraints on sequence decoding
نویسندگان
چکیده
We describe finite-state constraint relaxation, a method for applying global constraints, expressed as automata, to sequence model decoding. We present algorithms for both hard constraints and binary soft constraints. On the CoNLL-2004 semantic role labeling task, we report a speedup of at least 16x over a previous method that used integer linear programming.
منابع مشابه
Global Optimization of Stacking Sequence in a Laminated Cylindrical Shell Using Differential Quadrature Method
Based on 3-D elasticity approach, differential quadrature method (DQM) in axial direction is adopted along with Globalized Nelder–Mead (GNM) algorithm to optimize the stacking sequence of a laminated cylindrical shell. The anisotropic cylindrical shell has finite length with simply supported boundary conditions. The elasticity approach, combining the state space method and DQM is used to obtain...
متن کاملNumerical analysis of a control and state constrained elliptic control problem with piecewise constant control approximations
We consider an elliptic optimal control problem with control and pointwise state constraints. The cost functional is approximated by a sequence of functionals which are obtained by discretizing the state equation with the help of linear finite elements and enforcing the state constraints in the nodes of the triangulation. Controls are discretized piecewise constant on every simplex of the trian...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملA Soft Global Precedence Constraint
Hard and soft precedence constraints play a key role in many application domains. In telecommunications, one application is the configuration of callcontrol feature subscriptions where the task is to sequence a set of user-selected features subject to a set of hard (catalogue) precedence constraints and a set of soft (user-selected) precedence constraints. When no such consistent sequence exist...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کامل