| 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)
|
|
Abstract:
International audience ; A very large amount of work in Natural Language Processing use tree structure as the first class citizen mathematical structures to represent linguistic structures such as parsed sentences or feature structures. However, some linguistic phenomena do not cope properly with trees: for instance, in the sentence "Max decides to leave", "Max" is the subject of the both predicates "to decide" and "to leave". Tree-based linguistic formalisms generally use some encoding to manage sentences like the previous example. In former papers, we discussed the interest to use graphs rather than trees to deal with linguistic structures and we have shown how Graph Rewriting could be used for their processing, for instance in the transformation of the sentence syntax into its semantics. Our experiments have shown that Graph Rewriting applications to Natural Language Processing do not require the full computational power of the general Graph Rewriting setting. The most important observation is that all graph vertices in the final structures are in some sense "predictable" from the input data and so, we can consider the framework of Non-size increasing Graph Rewriting. In our previous papers, we have formally described the Graph Rewriting calculus we used and our purpose here is to study the theoretical aspect of termination with respect to this calculus. In our framework, we show that uniform termination is undecidable and that non-uniform termination is decidable. We define termination techniques based on weight, we prove the termination of weighted rewriting systems and we give complexity bounds on derivation lengths for these rewriting systems.
|
|
Keyword:
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
|
|
URL: https://hal.inria.fr/hal-00921038v2/document
https://doi.org/10.1017/S0960129518000178
https://hal.inria.fr/hal-00921038v2/file/grew.pdf
https://hal.inria.fr/hal-00921038
|
|
BASE
|
|
Hide 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)
|
|
BASE
|
|
Show details
|
|
|
|
|
