High-level methodologies for grammar engineering. Introduction to the special issue

• Autorzy: Duchier D. , Parmentier Y.

Identyfikatory

DOI

10.15398/jlm.v3i1.117

• Języki publikacji: EN

Abstrakty

EN

Grammar engineering is the task of designing and implementing linguistically motivated electronic descriptions of natural language (socalled grammars). These grammars are expressed within well-defined theoretical frameworks, and offer a fine-grained description of natural language. While grammars were first used to describe syntax, that is to say, the relations between constituents in a sentence, they often go beyond syntax and include semantic information. Grammar engineering provides precise descriptions which can be used for natural language understanding and generation, making these valuable resources for various natural language applications, including textual entailment, dialogue systems, or machine translation. The first attempts at designing large-scale resource grammars were costly because of the complexity of the task (Erbach 1990) and of the number of persons that were needed (see e.g. Doran et al. 1997). Advances in the field have led to the development of environments for semi-automatic grammar engineering, borrowing ideas from compilation (grammar engineering is compared with software development) and machine learning. This special issue reports on new trends in the field, where grammar engineering benefits from elaborate high-level methodologies and techniques, dealing with various issues (both theoretical and practical).

Słowa kluczowe

EN

grammar engineering; formal language; syntax; semantics

• Wydawca: Instytut Podstaw Informatyki PAN
• Czasopismo: Journal of Language Modelling
• Rocznik: 2015
• Tom: Vol. 3, No. 1
• Strony: 5--19
• Opis fizyczny: Bibliogr. 54 poz., tab.

Twórcy

autor

Duchier D.

• Laboratoire d’Informatique Fondamentale d’Orléans, Université d’Orléans, France

autor

Parmentier Y.

• Laboratoire d’Informatique Fondamentale d’Orléans, Université d’Orléans, France

Bibliografia

• [1] Anne Abeillé (2003), Treebanks: Building and Using Parsed Corpora, Text, Speech and Language Technology, Springer.
• [2] Jason Baldridge, Sudipta Chatterjee, Alexis Palmer, and Ben Wing (2007), DotCCG and VisCCG: Wiki and Programming Paradigms for Improved Grammar Engineering with OpenCCG, in Tracy Holloway King and Emily M. Bender, editors, Proceedings of the GEAF07 Workshop, pp. 5-25, Center for the Study of Language and Information (CSLI), Stanford, California, http://csli-publications.stanford.edu/GEAF/2007/geaf07-toc.html.
• [3] Timothy Baldwin, John Beavers, Emily M. Bender, Dan Flickinger, Ara Kim, and Stephan Oepen (2005), Beauty and the Beast: What running a broad-coverage precision grammar over the BNC taught us about the grammar — and the corpus, in Stephan Kepser and Marga Reis, editors, Linguistic Evidence: Empirical, Theoretical, and Computational Perspectives, pp. 49-70, Mouton de Gruyter, Berlin.
• [4] Srinivas Bangalore and Aravind K. Joshi (1999), Supertagging: An Approach to Almost Parsing, Computational Linguistics, 25 (2): 237-262.
• [5] Emily M. Bender (2008), Evaluating a Crosslinguistic Grammar Resource: A Case Study of Wambaya, in Proceedings of ACL-08: HLT, pp. 977-985, Association for Computational Linguistics, Columbus, Ohio.
• [6] Emily M. Bender, Scott Drellishak, Antske Fokkens, Michael Wayne Goodman, Daniel P. Mills, Laurie Poulson, and Safiyyah Saleem (2010), Grammar Prototyping and Testing with the LinGO Grammar Matrix Customization System, in Proceedings of the ACL 2010 System Demonstrations, pp. 1-6, Association for Computational Linguistics, Uppsala, Sweden.
• [7] Luciana Benotti (2009), Frolog: an Accommodating Text-Adventure Game, in Proceedings of the Demonstrations Session at EACL 2009, pp. 1-4, Association for Computational Linguistics, Athens, Greece.
• [8] Alexandra Birch, Miles Osborne, and Philipp Koehn (2007), CCG Supertags in Factored Statistical Machine Translation, in Proceedings of the Second Workshop on Statistical Machine Translation, pp. 9-16, Association for Computational Linguistics, Prague, Czech Republic.
• [9] Philippe Blache (2005), Property Grammars: A Fully Constraint-Based Theory, in Henning Christiansen, Peter Rossen Skadhauge, and Jørgen Villadsen, editors, Constraint Solving and Language Processing, volume 3438 of Lecture Notes in Computer Science, pp. 1-16, Springer, Berlin Heidelberg.
• [10] Johan Bos, Stephen Clark, Mark Steedman, James R. Curran, and Julia Hockenmaier (2004), Wide-coverage Semantic Representations from a CCG Parser, in Proceedings of the 20th International Conference on Computational Linguistics, COLING ’04, pp. 1240-1246, Association for Computational Linguistics, Stroudsburg, PA, USA.
• [11] Miriam Butt, Helge Dyvik, Tracy Holloway King, Hiroshi Masuichi, and Christian Rohrer (2002), The Parallel Grammar Project, in Proceedings of COLING-2002 Workshop on Grammar Engineering and Evaluation, pp. 1-7, Taipei, Taiwan.
• [12] Miriam Butt, Tracy H. King, Marma-Eugenia Niño, and Frédérique Segond (1999), A Grammar Writer’s Cookbook, Center for the Study of Language and Information (CSLI), Stanford, California.
• [13] Aoife Cahill, Michael Burke, Ruth O’Donovan, Stefan Riezler, Josef van Genabith, and Andy Way (2008), Wide-Coverage Deep Statistical Parsing Using Automatic Dependency Structure Annotation, Computational Linguistics, 34 (1): 81-124.
• [14] Aoife Cahill, Martin Forst, Michael Burke, Mairead McCarthy, Ruth O’Donovan, Christian Rohrer, Josef van Genabith, and Andy Way (2005), Treebank-Based Acquisition of Multilingual Unification Grammar Resources, Journal of Research on Language and Computation; Special Issue on “Shared Representations in Multilingual Grammar Engineering”, 3 (2): 247-279.
• [15] Aoife Cahill, Mairéad McCarthy, Josef Van Genabith, and Andy Way (2002), Parsing with PCFGs and automatic f-structure annotation, in Proceedings of the 7th International Conference on LFG, pp. 76-95, Center for the Study of Language and Information (CSLI), Palo Alto, California.
• [16] Bob Carpenter and Gerald Penn (1999), ALE 3.2 User’s Guide, Technical Memo CMU-LTI-99-MEMO, Carnegie Mellon Language Technologies Institute.
• [17] John Carroll, Nicholas Nicolov, O. Shaumyan, M. Smets, and D. Weir (2000), Engineering a wide-coverage lexicalized grammar, in Proceedings of the Fifth International Workshop on Tree Adjoining Grammars and Related Frameworks, pp. 55-60, Paris, France.
• [18] Eugene Charniak (1994), Statistical Language Learning, MIT Press, Cambridge, Massachusetts.
• [19] N. Chomsky (1956), Three models for the description of language, Information Theory, IEEE Transactions on, 2 (3): 113-124.
• [20] Noam Chomsky (1957), Syntactic Structures, Mouton, The Hague.
• [21] Lionel Clément and Alexandra Kinyon (2003), Generating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar, in Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, pp. 184-191, Sapporo, Japan.
• [22] Ann Copestake (2002), Implementing Typed Feature Structure Grammars, Center for the Study of Language and Information (CSLI), Stanford, California.
• [23] Benoît Crabbé, Denys Duchier, Claire Gardent, Joseph Le Roux, and Yannick Parmentier (2013), XMG : eXtensible MetaGrammar, Computational Linguistics, 39 (3): 591-629.
• [24] Benoît Crabbé, Denys Duchier, Yannick Parmentier, and Simon Petitjean (2014), Constraint-driven Grammar Description, in Philippe Blache, Henning Christiansen, Verónica Dahl, Denys Duchier, and Jørgen Villadsen, editors, Constraints and Language, pp. 93-121, Cambridge Scholar Publishing.
• [25] Christine Doran, Beth Hockey, Philip Hopely, Joseph Rosenzweig, Anoop Sarkar, Srinivas Bengalore, Fei Xia, Alexis Nasr, and Owen Rambow (1997), Maintaining the Forest and Burning out the Underbrush in XTAG, in Proceedings of the ACL Workshop on Computational Environments for Grammar Development and Language Engineering (ENVGRAM), pp. 30-37, Madrid, Spain.
• [26] Denys Duchier, Brunelle Magnana Ekoukou, Yannick Parmentier, Simon Petitjean, and Emmanuel Schang (2012), Describing Morphologically-rich Languages using Metagrammars: a Look at Verbs in Ikota, in Workshop on “Language technology for normalisation of less-resourced languages”, 8th SALTMIL Workshop on Minority Languages and the 4th workshop on African Language Technology, pp. 55-60, Istanbul, Turkey, http://aflat.org/files/saltmil8-aflat2012.pdf.
• [27] Gregor Erbach (1990), Grammar Engineering: Problems And Prospects, report on the Saarbrücken Grammar Engineering Workshop.
• [28] Roger Evans and Gerald Gazdar (1996), DATR: A Language for Lexical Knowledge Representation, Computational Linguistics, 22 (2): 167-213.
• [29] Dan Flickinger, Valia Kordoni, Yi Zhang, Ant Branco, K. Simov, Petya Osenova, Catarina Carvalheiro, Francisco Costa, and S Castro (2012), ParDeepBank : multiple parallel deep treebanking, in Proceedings of the Eleventh International Workshop on Treebanks and Linguistic Theories (TLT11), pp. 97-108, Lisbon, Portugal.
• [30] Mary E. Foster, Michael White, Andrea Setzer, and Roberta Catizone (2005), Multimodal Generation in the COMIC Dialogue System, in Proceedings of the ACL Interactive Poster and Demonstration Sessions, pp. 45-48, Association for Computational Linguistics, Ann Arbor, Michigan.
• [31] Claire Gardent (2008), Integrating a unification-based semantics in a large scale Lexicalised Tree Adjoininig Grammar for French, in Proceedings of the 22nd International Conference on Computational Linguistics (COLING’08), pp. 249-256, Manchester, United Kingdom.
• [32] Claire Gardent and German Kruszewski (2012), Generation for Grammar Engineering, in INLG 2012 Proceedings of the Seventh International Natural Language Generation Conference, pp. 31-39, Association for Computational Linguistics, Utica, Illinois.
• [33] Claire Gardent, Yannick Parmentier, Guy Perrier, and Sylvain Schmitz (2014), Lexical Disambiguation in LTAG using Left Context, in Zygmunt Vetulani and Joseph Mariani, editors, 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, volume 8387, pp. 67-79, Springer.
• [34] Julia Hockenmaier and Mark Steedman (2002), Generative Models for Statistical Parsing with Combinatory Categorial Grammar, in Proceedings of 40th Annual Meeting of the Association for Computational Linguistics, pp. 335-342, Association for Computational Linguistics, Philadelphia, Pennsylvania.
• [35] Kenneth Hoetmer (2005), Higher-Order Types for Grammar Engineering, Master’s thesis, University of Toronto, Department of Computer Science, http://www.cs.toronto.edu/~hoetmer/hoetmerthesis.pdf.
• [36] 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 Zwicky, editors, Natural Language Parsing, pp. 206-250, Cambridge University Press, Cambridge.
• [37] Aravind K. Joshi, Leon S. Levy, and Masako Takahashi (1975), Tree Adjunct Grammars, Journal of Computer and System Sciences, 10 (1): 136-163.
• [38] Laura Kallmeyer and Rainer Osswald (2013), Syntax-Driven Semantic Frame Composition in Lexicalized Tree Adjoining Grammars, Journal of Language Modelling, 1 (2): 267-330.
• [39] Ronald M. Kaplan and Joan Bresnan (1982), Lexical-Functional Grammar: A Formal System for Grammatical Representations, in The Mental Representation of Grammatical Relations, pp. 173-281, MIT Press.
• [40] Jan Tore Lønning and Stephan Oepen (2006), Re-Usable Tools for Precision Machine Translation, in Proceedings of the COLING/ACL 2006 Interactive Presentation Sessions, pp. 53-56, Association for Computational Linguistics, Sydney, Australia.
• [41] W. Detmar Meurers, Gerald Penn, and Frank Richter (2002), A Web-based Instructional Platform for Contraint-Based Grammar Formalisms and Parsing, in Proceedings of the ACL-02 Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Computational Linguistics, pp. 19-26, Association for Computational Linguistics, Philadelphia, Pennsylvania, USA.
• [42] Yusuke Miyao, Takashi Ninomiya, and Jun’ichi Tsujii (2005), Corpus-Oriented Grammar Development for Acquiring a Head-Driven Phrase Structure Grammar from the Penn Treebank, in Keh-Yih Su, Jun’ichi Tsujii, Jong-Hyeok Lee, and OiYee Kwong, editors, Natural Language Processing – IJCNLP 2004, volume 3248 of Lecture Notes in Computer Science, pp. 684-693, Springer, Berlin, Heidelberg.
• [43] Laura Perez-Beltrachini, Claire Gardent, and German Kruszewski (2012), Generating Grammar Exercises, in Proceedings of the Seventh Workshop on Building Educational Applications Using NLP, pp. 147-156, Association for Computational Linguistics, Montréal, Canada.
• [44] Guy Perrier (2000), Interaction Grammars, in Proceedings of the 18th International Conference on Computational Linguistics (COLING 2000), pp. 600-606, Saarbruecken, Germany.
• [45] Aarne Ranta (2011), Grammatical Framework: Programming with Multilingual Grammars, Center for the Study of Language and Information (CSLI), Stanford, California.
• [46] Ivan A. Sag and Carl J. Pollard (1987), Head-Driven Phrase Structure Grammar: An Informal Synopsis, CSLI Report 87-79, Stanford University.
• [47] Stuart M. Shieber (1984), The Design of a Computer Language for Linguistic Information, in Proceedings of the Tenth International Conference on Computational Linguistics, pp. 362-366, Stanford, California.
• [48] Mark Steedman (1987), Combinatory grammars and parasitic gaps, Natural Language & Linguistic Theory, 5 (3): 403-439.
• [49] Yael Sygal and Shuly Wintner (2011), Towards Modular Development of Typed Unification Grammars, Computational Linguistics, 37 (1): 29-74.
• [50] Aline Villavicencio (2002), The acquisition of a unification-based generalised categorial grammar, Technical Report UCAM-CL-TR-533, Number 533, Computer Laboratory, University of Cambridge.
• [51] Éric Villemonte De La Clergerie (2010), Building factorized TAGs with meta-grammars, in The 10th International Conference on Tree Adjoining Grammars and Related Formalisms - TAG+10, pp. 111-118, New Haven, Connecticut, https://hal.inria.fr/inria-00551974.
• [52] Fei Xia (1999), Extracting Tree Adjoining Grammars from bracketed corpora, Proceedings of the 5th Natural Language Processing Pacific Rim Symposium (NLPRS-99), pp. 398-403.
• [53] Yao-zhong Zhang, Takuya Matsuzaki, and Jun’ichi Tsujii (2009), HPSG Supertagging: A Sequence Labeling View, in Proceedings of the 11th International Conference on Parsing Technologies (IWPT’09), pp. 210-213, Association for Computational Linguistics, Paris, France.
• [54] Yi Zhang, Valia Kordoni, Aline Villavicencio, and Marco Idiart (2006), Automated Multiword Expression Prediction for Grammar Engineering, in Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties, pp. 36-44, Association for Computational Linguistics, Sydney, Australia.