G_apres_r G_jean (G_fait_une_sieste_sws I_s G_a) (G_avoir_passe_laspirateur I_s I_vp)) :T ,
G_faire_une_sieste I_s I_vp)) :T; We translate them using the lexicon lexyield to strings. For instance, we translate one of the obtained term as follows: lexyield analyse G_ensuiteTS (AnchorT (G_passe_laspirateur I_s G_a G_jean)) (G_fait_une_sieste I_s G_a G_jean, G_passe_laspirateur_sws I_s G_a) ,
Sinf: type; I_vp : VPa; I_s : Sa; I_n : Na ,
Sa -> VPa -> Sws; ( * clause lacking a subject * ) G_passer_laspirateur_inf: Sa -> VPa -> Sinf ,
Sws := qnp -> t; N := qnp; N := (e => t) -> t; Na_d:= (e => t) -> (e => t) -> t ,
P j; G_marie := lambda P.P m; G_petit_dejeuner := lambda d a . d (a (Lambda x ,
G_ensuiteST := lambda s1 s2. SUCC s1 s2 ,
G_auparavantST := lambda s1 s2. SUCC s2 s1 ,
* constant encoding clause-medial adverbial :ensuite * ) g_auparavantTT : * constant encoding adverbial :auparavant * ) g_auparavant_m : T -> S -> T; ( * constant encoding clause-medial adverbial :ensuite * ) g_avant_c: S -> S ->S; ( * canonical g-derivation tree avant * ) g_avant_r: S -> S ->S; ( * reduced conjunction g-derivation tree avant * ) g_pour_c: S -> S ->S; ( * canonical g-derivation tree pour * ) g_pour_r: S -> S ->S; ( * reduced conjunction g-derivation tree pour * ) g_apres_c: S -> S ->S; ( * canonical g-derivation tree apres * ) g_apres_r: S -> S ->S; ( * reduced conjunction g-derivation tree apres * ) g_recomepnse: Sa -> VPa -> N -> N -> S; g_recomepnse_subjunctive: Sa -> VPa -> N -> N -> S; g_etre_recomepnse_par: Sa -> VPa -> N -> S; ( * reduced clause -infinitive clause * ) g_passe_laspirateur: Sa -> VPa -> N->S, I_vp : VPa; I_s : Sa; I_n : Na; g_jean ) ( * We define the usual types * ) e,t:type; qnp = (e => t) -> t : type ,
MAKE : e -> e -> t; j, m :e; KINDLY, really: t -> t; seem : (e -> t) -> e -> t; new,big,black, delicious: e ->t; claim,say,think : e -> t -> t, pp.e->t ,
Sws := qnp -> t ,
P j; G_marie := lambda P.P m; G_petit_dejeuner := lambda d a . d (a (Lambda x ,
G_ensuite_m := lambda s1 s2. SUCC s1 s2 ,
G_auparavant_m := lambda s1 s2. SUCC s2 s1 ,
G_avoir_fait:= lambda s a O ,
LOGIN: A logic programming language with built-in inheritance In: The Journal of logic programming, pp.10-1016 ,
SDRT and Continuation Semantics Revised Selected Papers, New Frontiers in Artiicial Intelligence JSAI-isAI Workshops, pp.10-1007 ,
EasyText: an Operational NLG System, ENLG -th European Workshop on Natural Language Generation ,
URL : https://hal.archives-ouvertes.fr/inria-00614760
On two Extensions of Abstract Categorial Grammars Artiicial Intel ligence and Reasoning -LPAR, th International Conference on Logic for Programming ,
D-LTAG System: Discourse Parsing with a Lexicalized Tree-Adjoining Grammar, Journal of Logic, Language and Information ... Special Issue: Discourse and Information Structure ,
Computing Discourse Semantics: The Predicate-Argument Semantics of Discourse Connectives in D-LTAG, Journal of Semantics, vol.23, issue.1 ,
DOI : 10.1093/jos/ffh032
Dynamic predicate logic, Linguistics and Philosophy, pp.10-1007 ,
Introduction to Automata Theory, Languages, and Computation ,
Cambridge Books Online, p.pp. ???? (cit ,
Tree adjunct grammars, Journal of Computer and System Sciences, vol.10, issue.1, pp.10-1016 ,
DOI : 10.1016/S0022-0000(75)80019-5
URL : http://doi.org/10.1016/s0022-0000(75)80019-5
Tree-Adjoining Grammars In: Handbook of Formal Languages ,
Flexible Composition In Ltag: Quantifier Scope and Inverse Linking In: Computing Meaning, Studies in Linguistics and Philosophy, pp.10-1007 ,
DOI : 10.1007/978-1-4020-5958-2_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.7470
Discourse Representation Theory ,
DOI : 10.1007/978-94-007-0485-5_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.6621
Rhetorical Structure Theory: A Theory of Text Organization, Information Sciences Institute ,
Rhetorical Structure Theory: Toward a functional theory of text organization, Text - Interdisciplinary Journal for the Study of Discourse, vol.8, issue.3, p.pp. ????. : http ,
DOI : 10.1515/text.1.1988.8.3.243
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars In: Logical Aspects of Computational Linguistics, Lecture Notes in Computer Science, pp.10-1007 ,
Annotating Discourse Connectives and Their Arguments, HLT-NAACL Workshop: Frontiers in Corpus Annotation ,
Lambda-Grammars and the Syntax-Semantics Interface In: Proceedings of the Thirteenth Amsterdam Colloquium, p.pp. ???? ( ,
Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar, Computational Linguistics, vol.20, issue.1, pp.10-1162 ,
DOI : 10.1016/S0019-9958(67)80007-X
Multi-Dimensional Compositional Functions as a Basis for Grammatical Analysis In: Categorial Grammars and Natural Language BIBLIOGRAPHY Structures, Studies in Linguistics and Philosophy, pp.10-1007 ,
Term-labeled categorial type systems, Linguistics and Philosophy, pp.10-1007 ,
The Mathematics of Language: th and th Biennial Conference Revised Selected Papers, Chap. A Note on the Complexity of Abstract Categorial Grammars, pp.10-1007 ,
An alternative conception of tree-adjoining derivation, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, pp.94-1004 ,
DOI : 10.3115/981967.981989
URL : http://arxiv.org/abs/cmp-lg/9404001
DRT with local contexts, Natural Language Semantics, pp.10-1007 ,
Evidence against the context-freeness of natural language, Linguistics and Philosophy, pp.10-1007 ,
Synchronous tree-adjoining grammars, Proceedings of the 13th conference on Computational linguistics -, pp.90-3045 ,
DOI : 10.3115/991146.991191
URL : http://acl.ldc.upenn.edu/C/C90/C90-3045.pdf
Sentence level discourse parsing using syntactic and lexical information, Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology , NAACL '03, pp.3-1030 ,
DOI : 10.3115/1073445.1073475
URL : http://acl.ldc.upenn.edu/N/N03/N03-1030.pdf
Combinatory grammars and parasitic gaps, pp.10-1007 ,
Characterizing structural descriptions produced by various grammatical formalisms, Proceedings of the 25th annual meeting on Association for Computational Linguistics - ,
DOI : 10.3115/981175.981190
URL : http://acl.ldc.upenn.edu/P/P87/P87-1015.pdf
Discourse structure and language technology, Natural Language Engineering, vol.47, issue.04, pp.10-1017 ,
DOI : 10.1162/0891201041850911
Discourse relations, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -, pp.99-1006 ,
DOI : 10.3115/1034678.1034695