no code implementations • COLING 2018 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
Not all dependencies are equal when training a dependency parser: some are straightforward enough to be learned with only a sample of data, others embed more complexity.
no code implementations • NAACL 2018 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
Because the most common transition systems are projective, training a transition-based dependency parser often implies to either ignore or rewrite the non-projective training examples, which has an adverse impact on accuracy.
no code implementations • CONLL 2017 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
This paper describes LIMSI{'}s submission to the CoNLL 2017 UD Shared Task, which is focused on small treebanks, and how to improve low-resourced parsing only by ad hoc combination of multiple views and resources.
no code implementations • EACL 2017 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
This paper formalizes a sound extension of dynamic oracles to global training, in the frame of transition-based dependency parsers.
no code implementations • COLING 2016 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
This paper studies cross-lingual transfer for dependency parsing, focusing on very low-resource settings where delexicalized transfer is the only fully automatic option.
no code implementations • WS 2016 • Jan-Thorsten Peter, Tamer Alkhouli, Hermann Ney, Matthias Huck, Fabienne Braune, Alex Fraser, er, Ale{\v{s}} Tamchyna, Ond{\v{r}}ej Bojar, Barry Haddow, Rico Sennrich, Fr{\'e}d{\'e}ric Blain, Lucia Specia, Jan Niehues, Alex Waibel, Alex Allauzen, re, Lauriane Aufrant, Franck Burlot, Elena Knyazeva, Thomas Lavergne, Fran{\c{c}}ois Yvon, M{\=a}rcis Pinnis, Stella Frank
Ranked #12 on Machine Translation on WMT2016 English-Romanian
no code implementations • JEPTALNRECITAL 2016 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
Dans cet article, nous proposons trois am{\'e}liorations simples pour l{'}apprentissage global d{'}analyseurs en d{\'e}pendances par transition de type A RC E AGER : un oracle non d{\'e}terministe, la reprise sur le m{\^e}me exemple apr{\`e}s une mise {\`a} jour et l{'}entra{\^\i}nement en configurations sous-optimales.
no code implementations • JEPTALNRECITAL 2016 • Oph{\'e}lie Lacroix, Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
Cet article pr{\'e}sente une m{\'e}thode simple de transfert cross-lingue de d{\'e}pendances.
no code implementations • LREC 2016 • Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon
Because of the small size of Romanian corpora, the performance of a PoS tagger or a dependency parser trained with the standard supervised methods fall far short from the performance achieved in most languages.