Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound.
Caio CorroJoseph Le RouxMathieu LacroixAntoine RozenknopRoberto Wolfler CalvoPublished in: ACL (1) (2016)
Keyphrases
- dependency parsing
- branch and bound
- lagrangian relaxation
- branch and bound algorithm
- column generation
- lower bound
- lagrangian heuristic
- network design problem
- upper bound
- search algorithm
- optimal solution
- mixed integer programming
- branch and bound search
- combinatorial optimization
- dependency parser
- search space
- lagrangian dual
- branch and bound procedure
- lower and upper bounds
- set covering problem
- np hard
- neural network
- integer program
- linear programming
- valid inequalities
- search tree
- linear programming relaxation
- tree search
- optimization problems
- objective function
- integer programming
- itemsets
- learning algorithm
- machine learning