74 citations
- Laboratoire d'Informatique Gaspard-MongeFR25 papers
- Université Gustave EiffelFR11 papers
- Laboratoire d'Informatique, Signaux et Systèmes de Sophia AntipolisFR2 papers
- Laboratoire Traitement et Communication de l’InformationFR2 papers
- Disco (Germany)DE1 paper
- IGlobal UniversityUS1 paper
- Institut Camille JordanFR1 paper
- Institut de Mathématiques de MarseilleFR1 paper
- Instituto de Gastroenterologia de GoiâniaBR1 paper
- International Center for Transitional JusticeUS1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Laboratoire d'Astrophysique de BordeauxFR1 paper
39 papers
Phylogeny.fr: the phylogenetic platform designed for non-specialists
Valentin Gorgodian, Olivier Poirot, Alain Schmitt +5
Phylogenetic analysis has become a standard approach across many areas of biology, yet the growing complexity of phylogenetic methods and software remains a major obstacle for non-…
A generic tool to generate a lexicon for NLP from Lexicon-Grammar tables
Matthieu Constant, Elsa Tolone
Lexicon-Grammar tables constitute a large-coverage syntactic lexicon but they cannot be directly used in Natural Language Processing (NLP) applications because they sometimes rely…
Les Entités Nommées : usage et degrés de précision et de désambiguïsation
Claude Martineau, Elsa Tolone, Stavroula Voyatzi
The recognition and classification of Named Entities (NER) are regarded as an important component for many Natural Language Processing (NLP) applications. The classification is usu…
Syntactic variation of support verb constructions
Eric Laporte, Elisabete Ranchhod, Anastasia Yannacopoulou
We report experiments about the syntactic variations of support verb constructions, a special type of multiword expressions (MWEs) containing predicative nouns. In these expression…
An Order on Sets of Tilings Corresponding to an Order on Languages
Nathalie Aubrun, Mathieu Sablik
Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in t…
On the Average Complexity of Moore's State Minimization Algorithm
Frédérique Bassino, Julien David, Cyril Nicaud
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state…