42 |
Universal Dependencies 2.1
|
|
|
|
In: https://hal.inria.fr/hal-01682188 ; 2017 (2017)
|
|
BASE
|
|
Show details
|
|
43 |
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
|
|
44 |
Generalized Quantifiers and Dynamicity — preliminary results —
|
|
|
|
In: QUAD2017 - QUantifiers And Determiners as part of ESSLLI 2017 ; https://hal.archives-ouvertes.fr/hal-01651668 ; QUAD2017 - QUantifiers And Determiners as part of ESSLLI 2017, Jul 2017, Toulouse, France (2017)
|
|
BASE
|
|
Show details
|
|
47 |
Universal Dependencies 2.0 – CoNLL 2017 Shared Task Development and Test Data
|
|
|
|
BASE
|
|
Show details
|
|
49 |
Le rôle de l’acquisition de l’allongement final dans le développement morphologique et l’explosion lexicale en français langue maternelle. ...
|
|
|
|
BASE
|
|
Show details
|
|
50 |
Crowdsourcing Complex Language Resources: Playing to Annotate Dependency Syntax
|
|
|
|
In: International Conference on Computational Linguistics (COLING) ; https://hal.inria.fr/hal-01378980 ; International Conference on Computational Linguistics (COLING), Dec 2016, Osaka, Japan ; http://coling2016.anlp.jp/ (2016)
|
|
BASE
|
|
Show details
|
|
53 |
Frigram: a French Interaction Grammar
|
|
|
|
In: ISSN: 2299-856X ; EISSN: 2299-8470 ; Journal of Language Modelling ; https://hal.inria.fr/hal-01188687 ; Journal of Language Modelling, Institute of Computer Science, Polish Academy of Sciences, Poland, 2015, High-level methodologies for grammar engineering, 3 (1), pp.265-316. ⟨10.15398/jlm.v3i1.93⟩ ; http://jlm.ipipan.waw.pl/index.php/JLM/article/view/93 (2015)
|
|
BASE
|
|
Show details
|
|
55 |
Mapping the Lexique des Verbes du Français (Lexicon of French Verbs) to a NLP Lexicon using Examples
|
|
|
|
In: International Conference on Language Resources and Evaluation (LREC) ; https://hal.inria.fr/hal-00969184 ; International Conference on Language Resources and Evaluation (LREC), May 2014, Reykjavik, Iceland (2014)
|
|
BASE
|
|
Show details
|
|
56 |
Deep Syntax Annotation of the Sequoia French Treebank
|
|
|
|
In: International Conference on Language Resources and Evaluation (LREC) ; https://hal.inria.fr/hal-00969191 ; International Conference on Language Resources and Evaluation (LREC), May 2014, Reykjavik, Iceland (2014)
|
|
BASE
|
|
Show details
|
|
57 |
Parsing Coordination Extragrammatically
|
|
|
|
In: Human Language Technology. Challenges for Computer Science and Linguistics. 5th Language and Technology Conference, LTC 2011, Poznan, Poland, November 25-27, 2011, Revised Selected Papers ; https://hal.inria.fr/hal-00921033 ; Zygmunt Vetulani; Joseph Mariani. Human Language Technology. Challenges for Computer Science and Linguistics. 5th Language and Technology Conference, LTC 2011, Poznan, Poland, November 25-27, 2011, Revised Selected Papers, 8387, Springer International Publishing, pp.12, 2014, Lecture Notes in Computer Science (LNCS) series / Lecture Notes in Artificial Intelligence (LNAI) subseries, 978-3-319-08957-7. ⟨10.1007/978-3-319-08958-4_5⟩ ; http://link.springer.com/chapter/10.1007%2F978-3-319-08958-4_5 (2014)
|
|
BASE
|
|
Show details
|
|
58 |
Un schéma d'annotation en dépendances syntaxiques profondes pour le français
|
|
|
|
In: TALN - Traitement Automatique des Langues Naturelles ; https://hal.inria.fr/hal-01054407 ; TALN - Traitement Automatique des Langues Naturelles, Jul 2014, Marseille, France. pp.574-579 (2014)
|
|
BASE
|
|
Show details
|
|
59 |
FRIGRAM: a French Interaction Grammar
|
|
|
|
In: ESSLLI 2013 - Workshop on High-level Methodologies for Grammar Engineering ; https://hal.inria.fr/hal-00920717 ; ESSLLI 2013 - Workshop on High-level Methodologies for Grammar Engineering, Université de Düsseldorf, Aug 2013, Düsseldorf, Germany. pp.63-74 (2013)
|
|
BASE
|
|
Show details
|
|
60 |
Non-simplifying Graph Rewriting Termination
|
|
|
|
In: TERMGRAPH ; https://hal.inria.fr/hal-00921053 ; TERMGRAPH, Mar 2013, Rome, Italy. pp.4-16 ; http://termgraph2013.imag.fr/pages/TERMGRAPH2013Proceedings.pdf (2013)
|
|
Abstract:
International audience ; So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those structures. Justified by some linguistic considerations, graph rewriting is characterized by two features: first, there is no node creation along computations and second, there are non-local edge modifications. Under these hypotheses, we show that uniform termination is undecidable and that non-uniform termination is decidable. We describe two termination techniques based on weights and we give complexity bound on the derivation length for these rewriting systems.
|
|
Keyword:
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
|
|
URL: https://hal.inria.fr/hal-00921053/document https://hal.inria.fr/hal-00921053/file/termgraph.pdf https://hal.inria.fr/hal-00921053
|
|
BASE
|
|
Hide details
|
|
|
|