Enriching a french treebank Lambek calculus, cyclic multiplicative-additive linear logic, noncommutative multiplicative-additive linear logic : language and sequent calculus, Proceedings of Language Ressources and Evaluation Conference Proceedings of 1996 Roma Workshop on Proofs and Linguistic Categoriss, pp.138-159, 1996. ,
Building a Treebank for French Building and Using Parsed Corpora, chapter 10 Non-commutative logic i : the multiplicative fragment, Annals of pure and applied logic, pp.13827-1329, 1935. ,
Computational semantics, Theoria, vol.18, issue.1, pp.27-45, 2003. ,
URL : https://hal.archives-ouvertes.fr/inria-00099715
Representation and inference for natural language : A first course in computational semantics. CSLI, BBH11] Martin Berglund, Henrik Björklund, and Johanna Högberg. Recognizing shuffled languages. Language and Automata Theory and Applications, pp.126-142, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00001208
Implication Textuelle et Réécriture, p.171, 2010. ,
Parser evaluation over local and non-local deep dependencies in a large corpus, Proceedings of 194 ,
Lexical semantics and pragmatics of evaluative adverbs, Adjectives and Adverbs : Syntax, Semantics, and Discourse, pp.274-304, 2008. ,
Semantic normalisation, Proceedings of the Eighth International Conference on Computational Semantics, IWCS-8 '09, pp.146-156, 2003. ,
DOI : 10.3115/1693756.1693805
Analyse syntaxiqué electostatique, ´ Evolutions en analyse syntaxique, p.37, 2003. ,
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation A quasi-arithmetical notation for syntactic description, Proceedings of CoLing, pp.11947-58, 1953. ,
The Prague Dependency Treebank : A Three-Level Annotation Scenario, pp.103-127, 2003. ,
Supertagging : An approach to almost parsing Computational linguistics Supertagging : Using Complex Lexical Descriptions in Natural Language Processing, Handbook of Natural Language Processing, pp.237-265, 0192. ,
Property Grammars: A Fully Constraint-Based Theory, Constraint Solving and Language Processing, pp.119-142, 2005. ,
DOI : 10.1007/11424574_1
URL : https://hal.archives-ouvertes.fr/hal-00134202
Pour une représentation décentralisée de l'information syntaxique, p.25, 2007. ,
Lexical Disambiguation with Polarities and Automata, Procedings of 11th International Conference on Implementation and Application of Automata, pp.72-74, 2006. ,
DOI : 10.1007/11812128_30
URL : https://hal.archives-ouvertes.fr/inria-00113369
Term rewriting and all that, p.146, 1999. ,
Underspecification and Resolution in Discourse Semantics ,
Proposal for a natural language processing syntactic backbone, p.48, 1998. ,
URL : https://hal.archives-ouvertes.fr/inria-00073347
Guided earley parsing, Proceedings of the 8th International Workshop on Parsing Technologies (IWPT 03), pp.43-54, 2003. ,
A nonstatistical parsing-based approach to supertagging, Supertagging : Using Complex Lexical Descriptions in Natural Language Processing, pp.173-191, 2010. ,
Semantic underspecification : Which technique for what purpose ? Computing Meaning, pp.55-85, 2007. ,
Lambek grammars based on pregroups. Logical aspects of computational linguistics, pp.95-109, 2001. ,
DOI : 10.1007/3-540-48199-0_6
On using a parallel graph rewriting formalism in generation, Proceedings of the 8th European workshop on Natural Language Generation , EWNLG '01, pp.1-11, 2001. ,
DOI : 10.3115/1117840.1117847
A principle-based hierarchical representation of ltags, Proceedings of the 16th conference on ComputationalCar08] Olivier Carton. Langages formels, calculabilité et complexité. Vuibert, pp.194-199, 1996. ,
Parser Evaluation, Proceedings of the 1st International Conference on Language Resources and Evaluation, pp.447-454, 1998. ,
DOI : 10.1007/978-94-010-0201-1_17
Statistical french dependency parsing : Treebank conversion and first results, Proceedings of LREC'2010, p.139, 2010. ,
Analyse syntaxique statistique du français : des constituants aux dépendances, p.183, 2009. ,
Dépendances syntaxiques de surface pour le fran¸cais, p.174, 2011. ,
Multi-tagging for lexicalizedgrammar parsing, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, pp.697-704, 2006. ,
An open-source grammar development environment and broad-coverage english grammar using HPSG, Conference on Language Resources and Evaluation, p.127, 2000. ,
Minimal Recursion Semantics: An Introduction, Research on Language and Computation, vol.19, issue.1, pp.281-332, 2005. ,
DOI : 10.1007/s11168-006-6327-9
Statistical parsing with an automatically-extracted tree adjoining grammar, Proceedings of the 38th Annual Meeting on Association for Computational Linguistics , ACL '00, pp.456-463, 2000. ,
DOI : 10.3115/1075218.1075276
URL : http://acl.ldc.upenn.edu/P/P00/P00-1058.pdf
Aspects of the Theory of Syntax, p.170, 1965. ,
Can the tag derivation tree represent a semantic graph ? an answer in the light of meaning-text theory, Proceedings of the Fourth Workshop on Tree-Adjoining Grammars and Related Frameworks, p.129, 1998. ,
Semantics via f-structure rewriting Une approche paresseuse de l'analyse sémantique ou comment construire une interface syntaxe-sémantiquè a partir d'exemples, Proceedings of the LFG06 Conference Actes de TALN, pp.145-165, 2006. ,
Parser Evaluation, Treebanks. Building and Using Parsed Corpora, pp.299-316, 2003. ,
DOI : 10.1007/978-94-010-0201-1_17
Automatic annotation of the penn treebank with lfg f-structure information, LREC, 2002. ,
Semantic composition with (robust) minimal recursion semantics, Proceedings of the Workshop on Deep Linguistic Processing, DeepLP '07, pp.73-80 ,
DOI : 10.3115/1608912.1608925
Slacker semantics, Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics on, EACL '09, pp.1-9, 2005. ,
DOI : 10.3115/1609067.1609167
Semantics and syntax in Lexical Functional Grammar : The resource logic approach Une modélisation en CSP des Grammaires de Propriétés Extensible Dependency Grammar : a modular grammar formalism based on multigraph description, JFPC 2010 Sixì emes Journées Francophones de Programmation par Contraintes, pp.126-123, 1999. ,
Towards abstract categorial grammars, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, pp.252-259 ,
URL : https://hal.archives-ouvertes.fr/inria-00100529
On the expressive power of abstract categorial grammars : Representing context-free formalisms, Journal of Logic, Language and Information, vol.13, issue.4, pp.421-438, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00112956
About Parallel and Syntactocentric Formalisms : A Perspective from the Encoding of Convergent Gram- Bibliographie mar into Abstract Categorial Grammar, Fundamenta Informaticae, vol.106, issue.2-4, pp.211-231, 2011. ,
Master's thesis The metagrammar compiler : An nlp application with a multi-paradigm architecture, Multiparadigm Programming in Mozart/Oz, pp.25-175, 2005. ,
A deductive account of quantification in LFG, pp.33-57, 1996. ,
Formal investigations of underspecified representations, p.126, 2005. ,
Inductively Sequential Term-Graph Rewrite Systems, In ICGT, pp.84-98, 2008. ,
DOI : 10.1007/978-3-540-87405-8_7
The constraint language for lambda structures, Journal of Logic, Language and Information, vol.10, issue.4, pp.457-485, 2001. ,
DOI : 10.1023/A:1017964622902
URL : https://hal.archives-ouvertes.fr/inria-00536795
The english resource grammar, 2007. ,
Extraction des cadres syntaxiquesàsyntaxiquesà partir de P7dep, 2010. ,
Applicability of indexed grammars to natural languages. Number CSLI-85-34 in Technical Report. Center for the Study of Language and Information, p.136, 1985. ,
Semi-Automatic Probanking for French ,
Linear logic. Theoretical computer science, pp.1-101, 1987. ,
URL : https://hal.archives-ouvertes.fr/inria-00075966
Shuffle languages, Petri nets, and context-sensitive grammars, Communications of the ACM, vol.24, issue.9, pp.597-605, 1981. ,
DOI : 10.1145/358746.358767
Semantic construction in feature-based TAG, Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics , EACL '03 ,
DOI : 10.3115/1067807.1067825
URL : https://hal.archives-ouvertes.fr/inria-00107643
Interaction Grammars, Research on Language and Computation, vol.18, issue.4, pp.171-208, 2009. ,
DOI : 10.1007/s11168-010-9066-x
URL : https://hal.archives-ouvertes.fr/inria-00288376
Semantics in generative grammar, p.128, 1998. ,
Introduction to Automata Theory, Languages, and Computation, HS07] Julia Hockenmaier and Mark Steedman. CCGbank : a corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, pp.98355-396, 2006. ,
11 [HY08] Julia Hockenmaier and Peter Young. Non-local scrambling : the equivalence of TAG and CCG revisited, Proceedings of TAG, p.131, 1984. ,
Semantic Parsing as Graph Language Transformation -a Multidimensional Approach to Parsing Highly Inflectional Languages, In COLING, pp.517-520, 1984. ,
A parallel architecture perspective on language processing Learning to transform linguistic graphs, Second Workshop on TextGraphs : Graph-Based Algorithms for Natural Language Processing, pp.2-22, 2007. ,
Structural properties of shuffle automata, Grammars, vol.2, issue.1, pp.35-51, 1999. ,
DOI : 10.1023/A:1009973609765
Analytic Syntax, p.13, 1937. ,
Tree-adjoining grammars. Handbook of Formal Languages : Beyond Words, pp.69-123, 1997. ,
Compositional semantics with lexicalized tree-adjoining grammar (ltag) : How much underspecification is necessary ?, Proceedings of the Third International Workshop on Computational Semantics (IWCS-3), p.129, 1999. ,
Grammaires de dépendance formelles et théorie sens-texte, 2001. ,
Grammaire d'Unification Sens-Texte : Vers un modele mathématique articulé de la langue, p.135, 0129. ,
On the status of the deep syntactic structure, Actes de la premì ere conférence internationale sur la Théorie Sens-Texte, p.177, 2003. ,
URL : https://hal.archives-ouvertes.fr/halshs-00120331
Polarized unification grammars, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL , ACL '06, pp.137-144, 1920. ,
DOI : 10.3115/1220175.1220193
URL : http://acl.ldc.upenn.edu/P/P06/P06-1018.pdf
Using an enriched TAG derivation structure as basis for semantics Comparing lexicalized grammar formalisms in an empirically adequate way : The notion of generative attachment capacity, Proceedings of TAG+ 6 Workshop International Conference on Linguistic Evidence, pp.127-136, 2002. ,
Lexical-functional grammar : A formal system for grammatical representation. Formal Issues in Lexical-Functional Grammar, pp.29-130, 1995. ,
The parc 700 dependency bank, Proceedings of the EACL03 : 4th International Workshop on Linguistically Interpreted Corpora (LINC-03), pp.1-8, 2003. ,
Factoring predicate argument and scope semantics : Underspecified semantics with LTAG, Research on Language and Computation, vol.1, issue.1/2, pp.3-58, 2003. ,
DOI : 10.1023/A:1024564228892
Dependency trees and the strong generative capacity of CCG, Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics on, EACL '09, pp.460-468, 2009. ,
DOI : 10.3115/1609067.1609118
Le statut des compléments du nom en [de NP]. The Canadian Journal of Linguistics/La revue canadienne de linguistique, pp.255-290, 2009. ,
Réalisation de surface : ambigu¨?téambigu¨?té et déterminisme ? Surface realisation : ambiguity and determinism, p.118, 2007. ,
LTAG semantics with semantic unification Scope and situation binding in LTAG using semantic unification, Proceedings of TAG, pp.155-162, 2004. ,
Dependency Structures and Lexicalized Grammars : An Algebraic Approach, p.136, 2010. ,
DOI : 10.1007/978-3-642-14568-1
Generalized quantifiers in linguistics and logic, Handbook of logic and language, p.125, 2011. ,
The Mathematics of Sentence Structure, The American Mathematical Monthly, vol.65, issue.3, pp.154-170, 1958. ,
DOI : 10.2307/2310058
Type grammar revisited. Logical aspects of computational linguistics Vers une grammaire d'unification Sens-Texte du français : le temps verbal dans l'interface sémantique-syntaxe, pp.1-27, 1999. ,
DOI : 10.1007/3-540-48975-4_1
The unity of unbounded dependency constructions. Number 166 in CSLI Lecture Notes. CSLI, p.133, 2006. ,
Implémentation d'une interface sémantique-syntaxe basée sur des grammaires d'unification polarisées, p.135, 2006. ,
TSNLP, Proceedings of the 16th conference on Computational linguistics -, pp.711-716, 1996. ,
DOI : 10.3115/993268.993292
Structural disambiguation with constraint propagation Semantic role labeling : an introduction to the special issue Dependency Syntax : theory and practice, Proceedings of the 28th annual meeting on Association for Computational Linguistics, pp.31-38, 1988. ,
Lexical functions : a tool for the description of lexical relations in a lexicon. Lexical functions in lexicography and natural language processing, pp.37-102, 1996. ,
Motifs de graphe pour le calcul de dépendances syntaxiquescompì etes, pp.27-168, 2010. ,
Strong generative capacity. Number 103 in CSLI Lecture Notes, p.136, 1999. ,
Anaphora resolution. Longman, p.134, 2002. ,
An efficient parser for lfg, Proceedings of LFG, p.131, 1996. ,
Generating typed dependency parses from phrase structure parses, Proceedings of LREC, p.138, 2006. ,
Building a large annotated corpus of english : The penn treebank, Computational linguistics, vol.19, issue.2, pp.313-330, 1993. ,
Universal grammar, Theoria, vol.26, issue.3, pp.373-398, 1970. ,
DOI : 10.1111/j.1755-2567.1970.tb00434.x
The proper treatment of quantification in ordinary English, pp.247-270, 1974. ,
Adjunction As Substitution : An Algebraic Formulation of Regular, Context-Free and Tree Adjoining Languages, Formal Grammar Conference, p.39, 1997. ,
Categorial investigations : logical and linguistic aspects of the Lambek calculus, p.74, 1988. ,
Type logical grammar : categorial logic of signs, Computational Linguistics, vol.23, issue.67, p.128, 1994. ,
DOI : 10.1007/978-94-011-1042-6
Categorial Grammar : Logical Syntax, Semantics, and Processing, p.16, 2010. ,
A formalism and a parser for lexicalised dependency grammars, 4th International Workshop on Parsing Technologies, pp.186-195, 1995. ,
Un modèle de reformulation automatique fondé sur la Théorie Sens Texte : Application aux langues contrôlées, p.16, 1996. ,
Analyse syntaxique probabiliste pour grammaires de dépendances extraites automatiquement. HabilitationàHabilitationà diriger des recherches, p.67, 2004. ,
Practical Experiments with Regular Approximation of Context-Free Languages, Computational Linguistics, vol.26, issue.1, pp.17-44, 2000. ,
DOI : 10.1145/355598.362773
Evaluation of dependency parsers on unbounded dependencies Simpler tag semantics through synchronization SemTAG : une plate-forme pour le calcul sémantiquè a partir de Grammaires d'Arbres Adjoints, Proceedings of the 23rd International Conference on Computational Linguistics, pp.833-841, 2003. ,
10 [Per07] Guy Perrier. A French Interaction Grammar The proposition bank : An annotated corpus of semantic roles, RANLP 2007, pp.463-467, 2005. ,
Dependency-Based Construction of Semantic Space Models, Proceedings of the seventh international workshop on tree adjoining grammar and related formalisms (TAG+ 7), pp.161-199, 2004. ,
DOI : 10.1017/S135132490200298X
Ambigu¨?téAmbigu¨?té de portée et approche fonctionnelle des grammaires d'arbres adjoints, Actes de la 14e conférence sur le Traitement Automatique des Langues Naturelles, pp.325-128, 2007. ,
Generalizing a Proof-Theoretic Account of Scope Ambiguity ,
URL : https://hal.archives-ouvertes.fr/inria-00112898
Generalized phrase structure grammars, head grammars and natural language, p.136, 1984. ,
Strong generative capacity in hpsg. Lexical and constructional aspects of linguistic explanation, pp.281-297, 1999. ,
Covert movement in logical grammar Logic and Grammar 128 [PP10] Sylvain Pogodalla and Florent Pompigne. Controlling extraction in abstract categorial grammars, 15th Conference on Formal Grammar -FG 2010, pp.17-40, 2010. ,
Head-driven phrase structure grammar, pp.127-128, 1994. ,
On the distinction between modeltheoretic and generative-enumerative syntactic frameworks. Logical aspects of computational linguistics Unbounded dependency recovery for parser evaluation, Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pp.17-43, 2001. ,
The logic of categorial grammars. Lecture notes ESSLLI, p.20, 2000. ,
On tough-movement, Minimalist Essays Linguistik Aktuell/Linguistics Today 91, pp.288-325, 2006. ,
DOI : 10.1075/la.91.19rez
URL : https://hal.archives-ouvertes.fr/halshs-00605612
A formal look at dependency grammars and phrase-structure grammars, with special consideration of word-order phenomena. Recent trends in Meaning-Text Theory, pp.167-129, 1997. ,
A model-theoretic framework for theories of syntax, Proceedings of the 34th annual meeting on Association for Computational Linguistics -, pp.10-16, 1996. ,
DOI : 10.3115/981863.981865
Syntactic structures as multi-dimensional trees, Research on Language and Computation, vol.1, issue.3/4, pp.265-305, 2003. ,
DOI : 10.1023/A:1024695608419
D-tree grammars Parsing strategies with 'lexicalized' grammars : application to tree adjoining grammars Combinatory categorial grammar. Nontransformational Syntax : A Guide to Current Models, Proceedings of the 33rd annual meeting on Association for Computational Linguistics Proceedings of the 12th conference on Computational linguistics, pp.151-158, 1988. ,
Ltag-spinal and the treebank . Language Resources and Evaluation The tiger 700 rmrs bank : Rmrs construction from dependencies, Treebank-Based Deep Grammar Acquisition for French Probabilistic Parsing Resources Proceedings of LINC 2005 [SG05] Djamé Seddah and Bertrand Gaiffe. Des arbres de dérivation aux forêts de dépendance : un chemin via les forêts partagées Actes de TALN, pp.184-081, 2005. ,
Evidence against the context-freeness of natural language, Linguistics and Philosophy, vol.8, issue.3, pp.333-343, 1985. ,
Unifying synchronous tree-adjoining grammars and tree transducers via bimorphisms, Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL-2006), pp.377-384, 2006. ,
Synchronous tree-adjoining grammars An alternative conception of tree-adjoining derivation 129 [Tes34] LucienTesnì ere Comment construire une syntaxe Language and Action : Categories, Lambdas and Dynamic Logic. North-Holland, 1991. 73 [vdEM03] Karel van den Eynde and Piet Mertens. La valence : l'approche pronominale et son application au lexique verbal, Proceedings of the 13th conference on Computational Proceedings of the 12th conference on Computational linguistics, pp.253-258, 1934. ,
Using descriptions of trees in a tree adjoining grammar, Computational Linguistics, vol.18, issue.4 2, pp.481-517, 1992. ,
Feature structures based tree adjoining grammars The equivalence of four extensions of contextfree grammars [XTA95] The XTAG Research Group. A lexicalized tree adjoining grammar for english, Proceedings of the 12th conference on Computational linguistics- Theory of Computing Systems, pp.714-719511, 1988. ,