no code implementations • 23 Oct 2023 • Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier
Given any duals for these constraints, called Lagrangian Multipliers (LMs), it returns a bound on the optimal value of the MILP, and Lagrangian methods seek the LMs giving the best such bound.
no code implementations • CONLL 2019 • Joseph Le Roux, Antoine Rozenknop, Mathieu Lacroix
We present a new method for transition-based parsing where a solution is a pair made of a dependency tree and a derivation graph describing the construction of the former.
no code implementations • EMNLP 2017 • Caio Corro, Joseph Le Roux, Mathieu Lacroix
We present a new method for the joint task of tagging and non-projective dependency parsing.