22 |
Annotated corpora and tools of the PARSEME Shared Task on Semi-Supervised Identification of Verbal Multiword Expressions (edition 1.2)
|
|
|
|
BASE
|
|
Show details
|
|
24 |
Leçons de l'annotation linguistique en dépendances de corpus écrits du français
|
|
|
|
In: Les corpus en sciences humaines et sociales ; https://hal.inria.fr/hal-02267428 ; Les corpus en sciences humaines et sociales, Presses Universitaires de Nancy, A paraître (2019)
|
|
BASE
|
|
Show details
|
|
25 |
Improving Surface-syntactic Universal Dependencies (SUD): surface-syntactic relations and deep syntactic features
|
|
|
|
In: TLT 2019 - 18th International Workshop on Treebanks and Linguistic Theories ; https://hal.inria.fr/hal-02266003 ; TLT 2019 - 18th International Workshop on Treebanks and Linguistic Theories, Aug 2019, Paris, France (2019)
|
|
BASE
|
|
Show details
|
|
26 |
Graph Matching for Corpora Exploration
|
|
|
|
In: JLC 2019 - 10èmes Journées Internationales de la Linguistique de corpus ; https://hal.inria.fr/hal-02267475 ; JLC 2019 - 10èmes Journées Internationales de la Linguistique de corpus, Nov 2019, Grenoble, France (2019)
|
|
BASE
|
|
Show details
|
|
29 |
Application de la réécriture de graphes au traitement automatique des langues
|
|
|
|
In: https://hal.inria.fr/hal-01930591 ; ISTE editions, 1, pp.242, 2018, Série Logique, linguistique et informatique, Christian Rétoré, 9781784054762 (2018)
|
|
BASE
|
|
Show details
|
|
30 |
SUD or Surface-Syntactic Universal Dependencies: An annotation scheme near-isomorphic to UD
|
|
|
|
In: Universal Dependencies Workshop 2018 ; https://hal.inria.fr/hal-01930614 ; Universal Dependencies Workshop 2018, Nov 2018, Brussels, Belgium (2018)
|
|
BASE
|
|
Show details
|
|
31 |
Application of Graph Rewriting to Natural Language Processing
|
|
|
|
In: https://hal.inria.fr/hal-01814386 ; ISTE Wiley, 1, pp.272, 2018, Logic, Linguistics and Computer Science Set, Christian Rétoré, 1786300966 (2018)
|
|
BASE
|
|
Show details
|
|
32 |
Produire des données pour la recherche en jouant aux zombies
|
|
|
|
In: ISSN: 2270-6224 ; Interstices ; https://hal.inria.fr/hal-01827612 ; Interstices, INRIA, 2018 ; https://interstices.info/produire-des-donnees-pour-la-recherche-en-jouant-aux-zombies (2018)
|
|
BASE
|
|
Show details
|
|
33 |
Non-size increasing Graph Rewriting for Natural Language Processing
|
|
|
|
In: ISSN: 0960-1295 ; EISSN: 1469-8072 ; Mathematical Structures in Computer Science ; https://hal.inria.fr/hal-00921038 ; Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2018, 28 (08), pp.1451 - 1484. ⟨10.1017/S0960129518000178⟩ (2018)
|
|
BASE
|
|
Show details
|
|
34 |
La réécriture de graphes au service de l'annotation de corpus et de l'exploitation de corpus annotés
|
|
|
|
In: Grammar and Corpora 2018 ; https://hal.inria.fr/hal-01930651 ; Grammar and Corpora 2018, Nov 2018, Paris, France ; http://drehu.linguist.univ-paris-diderot.fr/gac-2018/ (2018)
|
|
BASE
|
|
Show details
|
|
35 |
"Fingers in the Nose": Evaluating Speakers' Identification of Multi-Word Expressions Using a Slightly Gamified Crowdsourcing Platform
|
|
|
|
In: Proceedings of the Joint Workshop on Linguistic Annotation, Multiword Expressions and Constructions (LAW-MWE-CxG-2018) ; https://hal.archives-ouvertes.fr/hal-01912706 ; Proceedings of the Joint Workshop on Linguistic Annotation, Multiword Expressions and Constructions (LAW-MWE-CxG-2018), Aug 2018, Santa Fe, United States. pp.207 - 213 ; https://aclanthology.coli.uni-saarland.de/events/ws-2018/#W18-49 (2018)
|
|
BASE
|
|
Show details
|
|
36 |
Universal Dependencies 2.2
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-01930733 ; 2018 (2018)
|
|
BASE
|
|
Show details
|
|
39 |
Universal Dependencies 2.1
|
|
|
|
In: https://hal.inria.fr/hal-01682188 ; 2017 (2017)
|
|
BASE
|
|
Show details
|
|
40 |
Enhanced UD Dependencies with Neutralized Diathesis Alternation
|
|
|
|
In: Depling 2017 - Fourth International Conference on Dependency Linguistics ; https://hal.inria.fr/hal-01625466 ; Depling 2017 - Fourth International Conference on Dependency Linguistics, Sep 2017, Pisa, Italy (2017)
|
|
Abstract:
International audience ; The 2.0 release of the Universal Dependency treebanks demonstrates the effectiveness of the UD scheme to cope with very diverse languages. The next step would be to get more of syntactic analysis , and the " enhanced dependencies " sketched in the UD 2.0 guidelines is a promising attempt in that direction. In this work we propose to go further and enrich the enhanced dependency scheme along two axis: extending the cases of recovered arguments of non-finite verbs, and neutralizing syntactic alternations. Doing so leads to both richer and more uniform structures, while remaining at the syntactic level, and thus rather neutral with respect to the type of semantic representation that can be further obtained. We implemented this proposal in two UD treebanks of French, using deterministic graph-rewriting rules. Evaluation on a 200 sentence gold standard shows that deep syntactic graphs can be obtained from surface syntax annotations with a high accuracy. Among all arguments of verbs in the gold standard, 13.91% are impacted by syntactic alternation normalization, and 18.93% are additional deep edges.
|
|
Keyword:
[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
|
|
URL: https://hal.inria.fr/hal-01625466/file/Depling_2017_paper_28-version-finale.pdf https://hal.inria.fr/hal-01625466 https://hal.inria.fr/hal-01625466/document
|
|
BASE
|
|
Hide details
|
|
|
|