| 2 |
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
|
|
|
| 3 |
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
|
|
|
| 4 |
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
|
|
|
| 5 |
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)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Grew : un outil de réécriture de graphes pour le TAL
|
|
|
|
In: 12ième Conférence annuelle sur le Traitement Automatique des Langues (TALN'12) ; https://hal.inria.fr/hal-00760637 ; 12ième Conférence annuelle sur le Traitement Automatique des Langues (TALN'12), ATALA, Jun 2012, Grenoble, France. pp.1-2 (2012)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Enrichissement de structures en dépendances par réécriture de graphes
|
|
|
|
In: Traitement Automatique des Langues Naturelles (TALN) ; https://hal.inria.fr/inria-00579251 ; Traitement Automatique des Langues Naturelles (TALN), Jun 2011, Montpellier, France (2011)
|
|
Abstract:
International audience ; We show how to enrich a syntactic dependency annotation of the French Paris 7 Treebank format, using graph rewriting, in order to compute its semantic representation. The rewriting system is composed of grammatical and lexical rules structured in modules. The lexical rules use a control information extracted from Dicovalence, a lexicon of French verbs. ; Nous montrons comment enrichir une annotation en dépendances syntaxiques au format du French Treebank de Paris 7 en utilisant la réécriture de graphes, en vue du calcul de sa représentation sémantique. Le système de réécriture est composé de règles grammaticales et lexicales structurées en modules. Les règles lexicales utilisent une information de contrôle extraite du lexique des verbes français Dicovalence.
|
|
Keyword:
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; dependency; Dicovalence; French Treebank; graph rewriting
|
|
URL: https://hal.inria.fr/inria-00579251
|
|
BASE
|
|
Hide details
|
|
|
| 9 |
Modular Graph Rewriting to Compute Semantics
|
|
|
|
In: 9th International Conference on Computational Semantics - IWCS 2011 ; https://hal.inria.fr/inria-00579244 ; 9th International Conference on Computational Semantics - IWCS 2011, Jan 2011, Oxford, United Kingdom. pp.65--74 (2011)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Réécriture de graphes de dépendances pour l'interface syntaxe-sémantique
|
|
|
|
In: Traitement Automatique des Langues Naturelles - TALN 2010 ; https://hal.inria.fr/inria-00526437 ; Traitement Automatique des Langues Naturelles - TALN 2010, Jul 2010, Montréal, Canada (2010)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Dependency Constraints for Lexical Disambiguation
|
|
|
|
In: 11th International Conference on Parsing Technologies - IWPT'09 ; https://hal.inria.fr/inria-00440795 ; 11th International Conference on Parsing Technologies - IWPT'09, Oct 2009, Paris, France. pp.242-253 (2009)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Word Order Constraints for Lexical Disambiguation of Interaction Grammars
|
|
|
|
In: Workshop on Parsing with Categorial Grammars - ESSLLI ; https://hal.inria.fr/inria-00440785 ; Workshop on Parsing with Categorial Grammars - ESSLLI, Jul 2009, Bordeaux, France (2009)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Des fondements de la virologie informatique vers une immunologie formelle ; From the computer virology fudments toward a formal immunology
|
|
|
|
BASE
|
|
Show details
|
|
|
| 15 |
INtersection Optimization is NP-Complete
|
|
|
|
In: Sixth International Workshop on Finite-State Methods and Natural Language Processing - FSMNLP 2007 ; https://hal.inria.fr/inria-00185232 ; Sixth International Workshop on Finite-State Methods and Natural Language Processing - FSMNLP 2007, Sep 2007, Postdam, Germany (2007)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Intersection Optimization is NP Complete
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-00146671 ; 2007 (2007)
|
|
BASE
|
|
Show details
|
|
|
| 17 |
Lexical disambiguation with polarities and automata
|
|
|
|
In: 11th International Conference on Implementation and Application of Automata - CIAA 2006 ; https://hal.inria.fr/inria-00113369 ; 11th International Conference on Implementation and Application of Automata - CIAA 2006, Aug 2006, Taipei/Taiwan (2006)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation
|
|
|
|
In: 20th Conference on Computational Linguistics - CoLing'2004 ; https://hal.inria.fr/inria-00099886 ; 20th Conference on Computational Linguistics - CoLing'2004, 2004, Genève, Suisse, pp.303-309 (2004)
|
|
BASE
|
|
Show details
|
|
|
| 20 |
Analyse syntaxique électrostatique
|
|
|
|
In: ISSN: 1248-9433 ; EISSN: 1965-0906 ; Revue TAL ; https://hal.inria.fr/inria-00099582 ; Revue TAL, ATALA (Association pour le Traitement Automatique des Langues), 2003, 44 (3), pp.93-120 (2003)
|
|
BASE
|
|
Show details
|
|
|
|
|
