A syntax-semantics interface for Tree-Adjoining Grammars through Abstract Categorial Grammars

• Autorzy: Pogodalla S.

Identyfikatory

DOI

10.15398/jlm.v5i3.193

• Języki publikacji: EN

Abstrakty

EN

We present a model of the syntax-semantics interface for Tree-Adjoining Grammars (TAGs). It is based on the encoding of TAGs within the framework of Abstract Categorial Grammars (ACGs). This encoding relies on a functional interpretation of the substitution and adjunction operations of TAGs. In ACGs, the abstract terms representing derivation trees are full-fledged objects of the grammar. These terms are mapped onto logical formulas representing the semantic interpretation of natural language expressions that TAGs can analyze. Because of the reversibility properties of ACGs, this provides a way to parse and generate with the same TAG-encoded grammar. We propose several analyses, including for long-distance dependencies, quantification, control and raising verbs, and subordinate clauses. We also show how this encoding easily extends to other phenomena such as idioms or scope ambiguities. All the lexical data for theses modellings are provided and can be run with the ACG toolkit, a software package dedicated to the development of ACGs that can use these grammars both for parsing and generation.

Słowa kluczowe

EN

TAGs; Tree-Adjoining Grammars; syntax-semantics interface; ACGs; Abstract Categorial Grammars

• Wydawca: Instytut Podstaw Informatyki PAN
• Czasopismo: Journal of Language Modelling
• Rocznik: 2017
• Tom: Vol. 5, No. 3
• Strony: 527--605
• Opis fizyczny: Bibliogr. 124 poz., rys., tab.

Twórcy

autor

Pogodalla S.

• INRIA, Villers-lès-Nancy, France
• Université de Lorraine, LORIA, Vandoeuvre-lès-Nancy, France
• CNRS, LORIA, Vandoeuvre-lès-Nancy, France

Bibliografia

• [1] Anne Abeillé (1990), French and English determiners: interaction of morphology, syntax and semantics in Lexicalized Tree Adjoining Grammars, in Karin Harbusch and Wolfgang Wahlster, editors, Proceedings of the 1st International Workshop on Tree Adjoining Grammars: Formal Theory and Applications, pp. 17-20, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloß Dagstuhl, Germany, ACL anthology: W90-0215.
• [2] Anne Abeillé (1993), Les nouvelles syntaxes, Armand Colin.
• [3] Anne Abeillé (1995), The flexibility of French idioms: a representation with Lexicalised Tree Adjoining Grammar, in Martin Everaert, Erik-Jan van der Linden, André Schenk, and Rob Schreuder, editors, Idioms: structural and psychological perspectives, chapter 1, pp. 15-42, Psychology Press, Taylor & Francis Group.
• [4] Anne Abeillé (2002), Une grammaire électronique du français, Sciences du langage, CNRS Éditions.
• [5] Anne Abeillé and Yves Schabes (1989), Parsing idioms in Lexicalized TAGs, in Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics (EACL 1989), pp. 1-9, Association for Computational Linguistics, Manchester, England, ACL anthology: E89-1001.
• [6] Hendrik Pieter Barendregt (1984), The lambda calculus: its syntax and semantics, volume 103 of Studies in logic and the foundations of mathematics, North-Holland.
• [7] Chris Barker (2010), Cosubstitution, derivational locality, and quantifier scope, in Srinivas Bangalore, Robert Frank, and Maribel Romero, editors, Proceedings of the 10th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+10), pp. 135-142, Linguistics Department, Yale University, New Haven, CT, USA, ACL anthology: W10-4417.
• [8] Katalin Bimbó (2015), The decidability of the intensional fragment of classical linear logic, Theoretical Computer Science, 597: 1-17, 10.1016/j.tcs.2015.06.019.
• [9] Philippe Blache, Edward Stabler, Joan Busquets, and Richard Moot, editors (2005), Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics (LACL 2005), volume 3492 of Lecture notes in computer science/Lecture notes in artificial intelligence, Springer, 10.1007/b136076.
• [10] Chris Blom, Philippe de Groote, Yoad Winter, and Joost Zwarts (2012), Implicit arguments: event modification or option type categories?, in Maria Aloni, Vadim Kimmelman, Floris Roelofsen, Galit W. Sassoon, Katrin Schulz, and Matthijs Westera, editors, Logic, language and meaning, volume 7218 of Lecture notes in computer science, pp. 240-250, Springer, 10.1007/978-3-642-31482-7_25.
• [11] Johan Bos (1995), Predicate logic unplugged, in Paul Dekker and Martin Stokhof, editors, Proceedings of the Tenth Amsterdam Colloquium, ILLC, University of Amsterdam, http://www.let.rug.nl/bos/pubs/Bos1996AmCo.pdf.
• [12] Pierre Bourreau (2012), Jeux de typage et analyse de λ-grammaires non-contextuelles, Ph.D. thesis, Université Bordeaux I, HAL open archive: tel-00733964.
• [13] Pierre Bourreau (2013), Traitements d’ellipses: deux approches par les grammaires catégorielles abstraites, in Actes de la 20e conférence sur le Traitement Automatique des Langues Naturelles (TALN 2013), pp. 215-228, Association pour le Traitement Automatique des Langues, Les Sables d’Olonne, France, http://talnarchives.atala.org/TALN/TALN-2013/taln-2013-long-016.pdf.
• [14] Pierre Bourreau and Sylvain Salvati (2011), A Datalog recognizer for almost affine λ-CFGs, in Makoto Kanazawa, András Kornai, Marcus Kracht, and Hiroyuki Seki, editors, The mathematics of language, volume 6878 of Lecture notes in computer science, pp. 21-38, Springer, 10.1007/978-3-642-23211-4_2.
• [15] Marie-Hélène Candito (1996), A principle-based hierarchical representation of LTAGs, in Proceedings of the 16th International Conference on Computational Linguistics (COLING 1996), pp. 194-199, ACL anthology: C96-1034.
• [16] Marie-Hélène Candito (1999), Représentation modulaire et paramétrable de grammaires électroniques lexicalisées: application au français et à l’italien, Ph.D. thesis, Université Paris 7, http://www.linguist.univ-paris-diderot.fr/~mcandito/Publications/candito-these.pdf.
• [17] Marie-Hélène Candito and Sylvain Kahane (1998), Can the TAG derivation tree represent a semantic graph? An answer in the light of Meaning-Text Theory, in Anne Abeillé, Tilman Becker, Owen Rambow, Giorgio Satta, and K. Vijay-Shanker, editors, Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG + 4), volume 98-12 of IRCS Report, University of Pennsylvania, ACL anthology: W98-0106.
• [18] Bob Carpenter (1997), Type-logical semantics, The MIT Press.
• [19] John Chen, Srinivas Bangalore, and K. Vijay-Shanker (2006), Automated extraction of Tree-Adjoining Grammars from treebanks, Natural Language Engineering, 12 (3): 251-299, 10.1017/S1351324905003943.
• [20] Hubert Comon, Max Dauchet, Rémi Gilleron, Christof Löding, Florent Jacquemard, Denis Lugiez, Sophie Tison, and Marc Tommasi (2007), Tree Automata techniques and applications, http://www.grappa.univ-lille3.fr/tata, released October 12th, 2007.
• [21] Benoît Crabbé (2005), Grammatical development with Xmg, in Blache et al. (2005), pp. 84-100, 10.1007/11422532_6.
• [22] Benoît Crabbé, Denys Duchier, Claire Gardent, Joseph Le Roux, and Yannick Parmentier (2013), XMG: eXtensible MetaGrammar, Computational Linguistics, 39 (3): 591-629, ACL anthology: J13-3005.
• [23] Peter W. Culicover and Ray Jackendoff (2005), Simpler syntax, Oxford University Press.
• [24] Haskell Brooks Curry (1961), Some logical aspects of grammatical structure, in Roman Jakobson, editor, Structure of language and its mathematical aspects: proceedings of the twelfth symposium in applied mathematics, pp. 56-68, American Mathematical Society.
• [25] Laurence Danlos (2009), D-STAG: un formalisme d’analyse automatique de discours basé sur les TAG synchrones, Revue TAL, 50 (1): 111-143, HAL open archive: inria-00524743.
• [26] Laurence Danlos (2011), D-STAG: a formalism for discourse analysis based on SDRT and using Synchronous TAG, in Philippe de Groote, Markus Egg, and Laura Kallmeyer, editors, Proceedings of the 14th conference on Formal Grammar (FG 2009), volume 5591 of Lecture notes in computer science/Lecture notes in artificial intelligence, pp. 64-84, Springer, 10.1007/978-3-642-20169-1_5.
• [27] Laurence Danlos, Aleksandre Maskharashvili, and Sylvain Pogodalla (2015), Grammaires phrastiques et discursives fondées sur les TAG: une approche de D-STAG avec les ACG, in Actes de la 22e conférence sur le Traitement Automatique des Langues Naturelles (TALN 2015), pp. 158-169, Association pour le Traitement Automatique des Langues, Caen, France, HAL open archive: hal-01145994.
• [28] Laurence Danlos, Aleksandre Maskharashvili, and Sylvain Pogodalla (2016), Interfacing sentential and discourse TAG-based grammars, in Proceedings of the 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG +12), Düsseldorf, Germany, HAL open archive: hal-01328697. ACL anthology: W16-3303.
• [29] Donald Davidson (2001), Essays on actions and events, volume 1 of Philosophical essays of Donald Davidson, Clarendon Press.
• [30] Philippe de Groote (2001), Towards Abstract Categorial Grammars, in Proceedings of 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), pp. 148-155, ACL anthology: P01-1033.
• [31] Philippe de Groote (2002), Tree-Adjoining Grammars as Abstract Categorial Grammars, in Frank (2002), pp. 145-150, ACL anthology: W02-2220.
• [32] Philippe de Groote (2006), Towards a Montagovian account of dynamics, in Masayuki Gibson and Jonathan Howell, editors, Proceedings of the 16th Semantics and Linguistic Theory Conference (SALT 16), 10.3765/salt.v16i0.2952.
• [33] Philippe de Groote (2015), Abstract Categorial parsing as linear logic programming, in Proceedings of the 14th Meeting on the Mathematics of Language (MoL 2015), pp. 15-25, Association for Computational Linguistics, Chicago, United States, HAL open archive: hal-01188632. ACL anthology: W15-2302.
• [34] Philippe de Groote and Makoto Kanazawa (2013), A note on intensionalization, Journal of Logic, Language and Information, 22 (2): 173-194, 10.1007/s10849-013-9173-9, HAL open archive: hal-00909207.
• [35] Philippe de Groote and Sarah Maarek (2007), Type-theoretic extensions of Abstract Categorial Grammars, in New directions in type-theoretic grammars: proceedings of the workshop, pp. 18-30, http://let.uvt.nl/general/people/rmuskens/ndttg/ndttg2007.pdf.
• [36] Philippe de Groote and Sylvain Pogodalla (2004), On the expressive power of Abstract Categorial Grammars: representing context-free formalisms, Journal of Logic, Language and Information, 13 (4): 421-438, 10.1007/s10849-004-2114-x, HAL open archive: inria-00112956.
• [37] Philippe de Groote, Ryo Yoshinaka, and Sarah Maarek (2007), On two extensions of Abstract Categorial Grammars, in Nachum Dershowitz and Andrei Voronkov, editors, Proceedings of the 14th international conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2007), volume 4790 of Lecture notes in computer science, pp. 273-287, Springer, 10.1007/978-3-540-75560-9_21.
• [38] Éric Villemonte de La Clergerie (2005), From metagrammars to factorized TAG/TIG parsers, in Proceedings of the Ninth International Workshop on Parsing Technology, pp. 190-191, Association for Computational Linguistics, Vancouver, BC, Canada, ACL anthology: W05-1522.
• [39] Marc Dymetman (1994), Inherently reversible grammars, in Tomek Strzalkowski, editor, Reversible grammars in natural language processing, chapter 2, pp. 33-57, Kluwer Academic Publishers.
• [40] Markus Egg, Alexander Koller, and Joachim Niehren (2001), The constraint language for lambda structures, Journal of Logic, Language and Information, 10 (4): 457-485, 10.1023/A:1017964622902.
• [41] Katherine Forbes, Eleni Miltsakaki, Rashmi Prasad, Anoop Sarkar, Aravind K. Joshi, and Bonnie Lynn Webber (2003), D-LTAG system: discourse parsing with a Lexicalized Tree-Adjoining Grammar, Journal of Logic, Language and Information, 12 (3): 261-279, 10.1023/A:1024137719751.
• [42] Katherine Forbes-Riley, Bonnie Lynn Webber, and Aravind K. Joshi (2006), Computing discourse semantics: the predicate-argument semantics of discourse connectives in D-LTAG, Journal of Semantics, 23 (1): 55-106, 10.1093/jos/ffh032.
• [43] Robert Frank, editor (2002), Proceedings of the Sixth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG + 6), Università di Venezia, ACL anthology: W02-22.
• [44] Claire Gardent (2008), Integrating a unification-based semantics in a large scale Lexicalised Tree Adjoining Grammar for French, in Proceedings of the 22nd International Conference on Computational Linguistics (COLING 2008), pp. 249-256, ACL anthology: C08-1032.
• [45] Claire Gardent and Laura Kallmeyer (2003), Semantic construction in Feature-Based TAG, in Proceedings of the 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2003), pp. 123-130, ACL anthology: E03-1030.
• [46] Claire Gardent and Yannick Parmentier (2005), Large scale semantic construction for Tree Adjoining Grammars, in Blache et al. (2005), pp. 131-146, 10.1007/11422532_9.
• [47] Jean-Yves Girard (1987), Linear logic, Theoretical Computer Science, 50 (1): 1-102, 10.1016/0304-3975(87)90045-4.
• [48] Jeroen Groenendijk and Martin Stokhof (1991), Dynamic predicate logic, Linguistics and Philosophy, 14 (1): 39-100, 10.1007/BF00628304.
• [49] Chung-hye Han and Giorgio Satta, editors (2012), Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG + 11), INRIA Paris Rocquencourt & Université Paris Diderot, Paris, France, ACL anthology: W12-4600.
• [50] Mathieu Huot (2017), Conservative extensions of Montague semantics, Master’s thesis, ENS Cachan, Université Paris-Saclay.
• [51] Ray Jackendoff (2002), Foundations of language: brain, meaning, grammar, evolution, Oxford University Press.
• [52] Aravind K. Joshi (1985), Tree-adjoining grammars: how much context sensitivity is required to provide reasonable structural descriptions?, in David R. Dowty, Lauri Karttunen, and Arnold M. Zwicky, editors, Natural language parsing, pp. 206-250, Cambridge University Press.
• [53] Aravind K. Joshi (1994), Preface, Computational Intelligence, 10 (4): VII-XV, 10.1111/j.1467-8640.1994.tb00002.x.
• [54] Aravind K. Joshi, Laura Kallmeyer, and Maribel Romero (2003), Flexible composition in LTAG: quantifier scope and inverse linking, in Harry Bunt, Ielka van der Sluis, and Roser Morante, editors, Proceedings of the Fifth International Workshop on Computational Semantics (IWCS-5).
• [55] Aravind K. Joshi, Leon S. Levy, and Masako Takahashi (1975), Tree adjunct grammars, Journal of Computer and System Sciences, 10 (1): 136-163, 10.1016/S0022-0000(75)80019-5.
• [56] Aravind K. Joshi and Yves Schabes (1997), Tree-adjoining grammars, in Grzegorz Rozenberg and Arto K. Salomaa, editors, Handbook of formal languages, volume 3, chapter 2, Springer.
• [57] Sylvain Kahane, Marie-Hélène Candito, and Yannick de Kercadio (2000), An alternative description of extractions in TAG, in Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG + 5), Université Paris 7, Jussieu, Paris, France, ACL anthology: W00-2016.
• [58] Laura Kallmeyer (2002), Using an enriched TAG derivation structure as basis for semantics, in Frank (2002), pp. 127-136, ACL anthology: W02-2218.
• [59] Laura Kallmeyer (2010), Parsing beyond context-free grammars, Cognitive Technologies, Springer, 10.1007/978-3-642-14846-0.
• [60] Laura Kallmeyer and Aravind K. Joshi (2003), Factoring predicate argument and scope semantics: underspecified semantics with LTAG, Research on Language and Computation, 1 (1-2): 3-58, 10.1023/A:1024564228892.
• [61] Laura Kallmeyer and Marco Kuhlmann (2012), A formal model for plausible dependencies in Lexicalized Tree Adjoining Grammar, in Han and Satta (2012), pp. 108-116, ACL anthology: W12-4613.
• [62] Laura Kallmeyer and Maribel Romero (2004), LTAG semantics with semantic unification, in Rambow and Stone (2004), pp. 155-162, ACL anthology: W04-3321.
• [63] Laura Kallmeyer and Maribel Romero (2008), Scope and situation binding for LTAG, Research on Language and Computation, 6 (1): 3-52, 10.1007/s11168-008-9046-6.
• [64] Hans Kamp and Uwe Reyle (1993), From discourse to logic, Kluwer Academic Publishers.
• [65] Makoto Kanazawa (2007), Parsing and generation as Datalog queries, in Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics (ACL 2007), pp. 176-183, Association for Computational Linguistics, Prague, Czech Republic, ACL anthology: P07-1023.
• [66] Makoto Kanazawa (2008a), Prefix-correct Earley parsing of mildly context-sensitive languages, invited talk at the 15th Workshop on Logic, Language, Information and Computation (WoLLIC 2008), Edinburgh, Scotland.
• [67] Makoto Kanazawa (2008b), A prefix-correct Earley recognizer for multiple context-free grammars, in Claire Gardent and Anoop Sarkar, editors, Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+9), pp. 49-56, University of Tübingen, Tübingen, Germany, ACL anthology: W08-2307.
• [68] Makoto Kanazawa (2009), Second-order Abstract Categorial Grammars as Hyperedge Replacement Grammars, Journal of Logic, Language and Information, 19 (2): 137-161, 10.1007/s10849-009-9109-6.
• [69] Makoto Kanazawa (2017), Parsing and generation as Datalog query evaluation, IfCoLog Journal of Logics and their Applications, 4 (4): 1103-1211, http://www.collegepublications.co.uk/downloads/ifcolog00013.pdf#page=307.
• [70] Makoto Kanazawa and Sylvain Salvati (2007), Generating control languages with Abstract Categorial Grammars, in Gerald Penn, editor, Proceedings of the 12th conference on Formal Grammar (FG 2007), CSLI Publications, http://research.nii.ac.jp/~kanazawa/publications/control.pdf.
• [71] Robert Kasper, Bernd Kiefer, Klaus Netter, and K. Vijay-Shanker (1995), Compilation of HPSG to TAG, in Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL 1995), pp. 92-99, Association for Computational Linguistics, Cambridge, MA, USA, 10.3115/981658.981671, ACL anthology: P95-1013.
• [72] Gregory M. Kobele (2007), Parsing elliptical structure, https://home.uni-leipzig.de/gkobele/files/unpub/Kobele07ParsingEllipsis.pdf, unpublished ms.
• [73] Gregory M. Kobele (2012), Idioms and extended transducers, in Han and Satta (2012), pp. 153-161, ACL anthology: W12-4618.
• [74] Gregory M. Kobele and Jens Michaelis (2012), CoTAGs and ACGs, in Denis Béchet and Alexander Dikovsky, editors, Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics (LACL 2012), volume 7351 of Lecture notes in computer science, pp. 119-134, Springer, 10.1007/978-3-642-31262-5_8.
• [75] Alexander Koller and Marco Kuhlmann (2011), A generalized view on parsing and translation, in Proceedings of the 12th International Conference on Parsing Technologies, pp. 2-13, Association for Computational Linguistics, Dublin, Ireland, ACL anthology: W11-2902.
• [76] Alexander Koller and Marco Kuhlmann (2012), Decomposing TAG parsing algorithms using simple algebraizations, in Han and Satta (2012), pp. 135-143, ACL anthology: W12-4616.
• [77] Marco Kuhlmann and Mathias Möhl (2007), Mildly context-sensitive dependency languages, in Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics (ACL 2007), pp. 160-167, Association for Computational Linguistics, Prague, Czech Republic, ACL anthology: P07-1021.
• [78] Joachim Lambek (1958), The mathematics of sentence structure, American Mathematical Monthly, 65 (3): 154-170, 10.2307/2310058.
• [79] Scott Martin and Carl Pollard (2014), A dynamic categorial grammar, in Glyn Morrill, Reinhard Muskens, Rainer Osswald, and Frank Richter, editors, Proceedings of the 19th conference on Formal Grammar (FG 2014), volume 8612 of Lecture notes in computer science, pp. 138-154, Springer, 10.1007/978-3-662-44121-3_9.
• [80] Aleksandre Maskharashvili and Sylvain Pogodalla (2013), Constituency and dependency relationship from a Tree Adjoining Grammar and Abstract Categorial Grammar perspective, in Proceedings of the 6th International Joint Conference on Natural Language Processing (IJCNLP 2013), pp. 1257-1263, The Asian Federation of Natural Language Processing, Nagoya, Japan, HAL open archive: hal-00868363. ACL anthology: I13-1179.
• [81] Richard Montague (1973), The proper treatment of quantification in ordinary English, in Jaakko Hintikka, Julius Moravcsik, and Patrick Suppes, editors, Approaches to natural language: proceedings of the 1970 Stanford workshop on grammar and semantics, pp. 221-242, D. Reidel Publishing Co.
• [82] Rebecca Nancy Nesson (2009), Synchronous and Multicomponent Tree-Adjoining Grammars: complexity, algorithms, and applications, Ph.D. thesis, Harvard University, https://pdfs.semanticscholar.org/754b/6acaf2660748967d1937a25222538207aabc.pdf.
• [83] Rebecca Nancy Nesson and Stuart M. Shieber (2006), Simpler TAG semantics through synchronization, in Proceedings of the 11th conference on Formal Grammar (FG 2006), CSLI Publications, http://cslipublications.stanford.edu/FG/2006/nesson.pdf.
• [84] Sylvain Pogodalla (2004a), Computing semantic representation: towards ACG abstract terms as derivation trees, in Rambow and Stone (2004), pp. 64-71, HAL open archive: inria-00107768. ACL anthology: W04-3309.
• [85] Sylvain Pogodalla (2004b), Using and extending the ACG technology: endowing categorial grammars with an underspecified semantic representation, in Proceedings of the Categorial Grammars conference, pp. 197-209, Montpellier, France, HAL open archive: inria-00108117.
• [86] Sylvain Pogodalla (2007a), Ambiguïté de portée et approche fonctionnelle des TAG, in Actes de la 14e conférence sur le Traitement Automatique des Langues Naturelles (TALN 2007), pp. 325-334, Association pour le Traitement Automatique des Langues, Toulouse, France, HAL open archive: inria-00141913.
• [87] Sylvain Pogodalla (2007b), Generalizing a proof-theoretic account of scope ambiguity, in 7th International Workshop on Computational Semantics (IWCS-7), Tilburg, Netherlands, HAL open archive: inria-00112898.
• [88] Sylvain Pogodalla (2009), Advances in Abstract Categorial Grammars: language theory and linguistic modeling. ESSLLI 2009 Lecture Notes, Part II, HAL open archive: hal-00749297.
• [89] Florent Pompigne (2013), Modélisation logique de la langue et Grammaires Catégorielles Abstraites, Ph.D. thesis, Université de Lorraine, HAL open archive: tel-00921040.
• [90] Owen Rambow and Matthew Stone, editors (2004), Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG + 7), Simon Fraser University, Vancouver, BC, Canada, ACL anthology: W04-3300.
• [91] Owen Rambow, K. Vijay-Shanker, and David Weir (1995), D-Tree Grammars, in Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL 1995), pp. 151-158, Association for Computational Linguistics, Cambridge, MA, USA, 10.3115/981658.981679, ACL anthology: P95-1021.
• [92] Owen Rambow, K. Vijay-Shanker, and David Weir (2001), D-Tree Substitution Grammars, Computational Linguistics, 27 (1): 87-121, 10.1162/089120101300346813, ACL anthology: J01-1004.
• [93] Jim Rogers (1999), Generalized Tree-Adjoining Grammar, in Proceedings of the Sixth Meeting on Mathematics of Language (MoL 6), Orlando, FL, USA, http://www.cs.earlham.edu/~jrogers/mol6.pdf.
• [94] Sylvain Salvati (2005), Problèmes de filtrage et problèmes d’analyse pour les grammaires catégorielles abstraites, Ph.D. thesis, Institut National Polytechnique de Lorraine.
• [95] Sylvain Salvati (2006), Encoding second order string ACG with deterministic tree walking transducers, in Shuly Wintner, editor, Proceedings of the 11th conference on Formal Grammar (FG 2006), pp. 143-156, CSLI Publications, http://cslipublications.stanford.edu/FG/2006/salvati.pdf.
• [96] Sylvain Salvati (2007), On the complexity of Abstract Categorial Grammars, in Proceedings of the Tenth Meeting on Mathematics of Language (MoL 10), http://wwwhomes.uni-bielefeld.de/mkracht/mol10/abstracts/acg_complexity.pdf.
• [97] Sylvain Salvati (2010), On the membership problem for non-linear Abstract Categorial Grammars, Journal of Logic, Language and Information, 19 (2): 163-183, 10.1007/s10849-009-9110-0.
• [98] Yves Schabes and Stuart M. Shieber (1994), An alternative conception of tree-adjoining derivation, Computational Linguistics, 20 (1): 91-124, ACL anthology: J94-1004.
• [99] Stuart M. Shieber (1988), A uniform architecture for parsing and generation, in Dénes Vargha, editor, Proceedings of the 12th International Conference on Computational Linguistics (COLING 1988), volume 2, pp. 614-619, Budapest, Hungary, ACL anthology: C88-2128.
• [100] Stuart M. Shieber (1993), The problem of logical-form equivalence, Computational Linguistics, 19 (1): 179-190, ACL anthology: J93-1008.
• [101] Stuart M. Shieber (1994), Restricting the weak-generative capacity of Synchronous Tree-Adjoining Grammars, Computational Intelligence, 10 (4): 371-385, 10.1111/j.1467-8640.1994.tb00003.x.
• [102] Stuart M. Shieber (2004), Synchronous grammars as tree transducers, in Rambow and Stone (2004), pp. 88-95, ACL anthology: W04-3312.
• [103] Stuart M. Shieber (2006), Unifying Synchronous Tree-Adjoining Grammars and tree transducers via bimorphisms, in Proceedings of the 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2006), pp. 377-384, Trento, Italy, ACL anthology: E06-1048.
• [104] Stuart M. Shieber (2014), Bimorphisms and synchronous grammars, Journal of Language Modelling, 2 (1): 51-104, 10.15398/jlm.v2i1.84.
• [105] Stuart M. Shieber and Yves Schabes (1990), Synchronous Tree-Adjoining Grammars, in Proceedings of the 13th International Conference on Computational Linguistics (COLING 1990), volume 3, pp. 253-258, Helsinki, Finland, 10.3115/991146.991191.
• [106] Stuart M. Shieber, Gertjan van Noord, Robert C. Moore, and Fernando C. N. Pereira (1989), A semantic-head-driven generation algorithm for unification-based formalisms, in Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics (ACL 1989), pp. 7-17, Association for Computational Linguistics, Vancouver, BC, Canada, 10.3115/981623.981625, ACL anthology: P89-1002.
• [107] Mark Steedman (2001), The syntactic process, The MIT Press.
• [108] Mark Steedman and Jason Baldridge (2011), Combinatory Categorial Grammar, in Robert Borsley and Kersti Börjars, editors, Non-transformational syntax: formal and explicit models of grammar, chapter 5, Wiley-Blackwell.
• [109] Johan van Benthem (1986), Essays in logical semantics, volume 39 of Studies in linguistics and philosophy, Springer, 10.1007/978-94-009-4540-1.
• [110] K. Vijay-Shanker (1987), A study of Tree Adjoining Grammars, Ph.D. thesis, University of Pennsylvania.
• [111] K. Vijay-Shanker (1992), Using descriptions of trees in a Tree Adjoining Grammar, Computational Linguistics, 18 (4): 481-518.
• [112] K. Vijay-Shanker and Aravind K. Joshi (1985), Some computational properties of Tree Adjoining Grammars, in Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics (ACL 1985), pp. 82-93, Association for Computational Linguistics, Chicago, IL, USA, 10.3115/981210.981221, ACL anthology: P85-1011.
• [113] K. Vijay-Shanker and Aravind K. Joshi (1988), Feature structures based Tree Adjoining Grammars, in Dénes Vargha, editor, Proceedings of the 12th International Conference on Computational Linguistics (COLING 1988), volume 2, pp. 714-718, ACL anthology: C88-2147.
• [114] K. Vijay-Shanker and Aravind K. Joshi (1991), Unification-based Tree Adjoining Grammars, Technical Report MS-CIS-91-25, University of Pennsylvania Department of Computer and Information Science (CIS), http://repository.upenn.edu/cis_reports/762, paper 762.
• [115] Bonnie Lynn Webber (2004), D-LTAG: extending lexicalized TAG to discourse, Cognitive Science, 28 (5): 751-779, 10.1207/s15516709cog2805_6.
• [116] Bonnie Lynn Webber and Aravind K. Joshi (1998), Anchoring a Lexicalized Tree-Adjoining Grammar for discourse, in Manfred Stede, Leo Wanner, and Eduard Hovy, editors, Proceedings of the ACL/COLING workshop on discourse relations and discourse markers, ACL anthology: W98-0315.
• [117] David J. Weir (1988), Characterizing mildly context-sensitive grammar formalisms, Ph.D. thesis, University of Pennsylvania.
• [118] Sean Michael Williford (1993), Application of Synchronous Tree-Adjoining Grammar to quantifier scoping in English, Bachelor’s thesis, Harvard College, http://nrs.harvard.edu/urn-3:HUL.InstRepos:10951941.
• [119] Fei Xia (2001), Automatic grammar generation from two different perspectives, Ph.D. thesis, University of Pennsylvania, ftp://ftp.cis.upenn.edu/pub/fxia/thesis/thesis.pdf.
• [120] Fei Xia, Chung-hye Han, Martha Palmer, and Aravind K. Joshi (2000), Comparing lexicalized treebank grammars extracted from Chinese, Korean, and English corpora, in Second Chinese Language Processing Workshop, pp. 52-59, Association for Computational Linguistics, Hong Kong, China, 10.3115/1117769.1117778, ACL anthology: W00-1208.
• [121] Fei Xia, Martha Palmer, and K. Vijay-Shanker (2005), Automatically generating Tree Adjoining Grammars from abstract specifications, Computational Intelligence, 21 (3): 246-285, 10.1111/j.1467-8640.2005.00273.x.
• [122] XTAG Research Group (2001), A Lexicalized Tree Adjoining Grammar for English, Technical Report IRCS-01-03, IRCS, University of Pennsylvania, ftp://ftp.cis.upenn.edu/pub/xtag/release-2.24.2001/tech-report.pdf.
• [123] Ryo Yoshinaka (2006), Linearization of affine Abstract Categorial Grammars, in Proceedings of the 11th conference on Formal Grammar (FG 2006), https://web.stanford.edu/group/cslipublications/cslipublications/FG/2006/yoshinaka.pdf.
• [124] Ryo Yoshinaka and Makoto Kanazawa (2005), The complexity and generative capacity of lexicalized Abstract Categorial Grammars, in Blache et al. (2005), pp. 330-348, 10.1007/11422532_22.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).