Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1007/978-3-662-53826-5_16guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

XMG 2: Describing Description Languages

Published: 05 December 2016 Publication History

Abstract

This paper introduces XMG 2, a modular and extensible tool for various linguistic description tasks. Based on the notion of meta-compilation (that is, compilation of compilers), XMG 2 reuses the main concepts underlying XMG, namely logic programming and constraint satisfaction, to generate on-demand XMG-like compilers by assembling elementary units called bricks. This brick-based definition of compilers permits users to design description languages in a highly flexible way. In particular, it makes it possible to support several levels of linguistic description (e.g. syntax, morphology) within a single description language. XMG 2 aims to offer means for users to easily define description languages that fit as much as possible the linguistic intuition.

References

[1]
Abeillé, A., Candito, M., Kinyon, A.: FTAG: current status and parsing scheme. In: Proceedings of Vextal-1999, Venice, Italy (1999)
[2]
Ben Khelil, C., Duchier, D., Parmentier, Y., Zribi, C., Ben Fraj, F.: ArabTAG: from a handcrafted to a semi-automatically generated TAG. In: Proceedings of 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+12), Düsseldorf, Germany, pp. 18–26. (2016). http://aclweb.org/anthology/W16-3302
[3]
Cazzola W Gschwind T, Paoli F, Gruhn V, and Book M Domain-specific languages in few steps Software Composition 2012 Heidelberg Springer 162-177
[4]
Clément, L., Kinyon, A.: Generating parallel multilingual LFG-TAG grammars from a MetaGrammar. In: Proceedings of 41st Annual Meeting of the Association for Computational Linguistics, Sapporo, Japan, pp. 184–191 (2003). https://doi.org/10.3115/1075096.1075120
[5]
Copestake A, Sanfilippo A, Briscoe T, and de Paiva V Briscoe T, de Paiva V, and Copestake A The ACQUILEX LKB: an introduction Inheritance, Defaults, and the Lexicon 1993 Cambridge Cambridge University Press 148-163
[6]
Crabbé B, Duchier D, Gardent C, Le Roux J, and Parmentier YXMG: eXtensible MetaGrammarComput. Linguist.20133931-66http://dx.doi.org/10.1162/COLI_a_00144
[7]
Duchier, D., Magnana Ekoukou, B., Parmentier, Y., Petitjean, S., Schang, E.: Describing morphologically-rich languages using Metagrammars: a look at verbs in Ikota. In: Workshop on “Language Technology for Normalisation of Less-resourced Languages”, pp. 55–60. LREC, Istanbul (2012)
[8]
Duchier D, Niehren J, et al. Lloyd J et al. Dominance constraints with set operators Computational Logic — CL 2000 2000 Heidelberg Springer 326-341
[9]
Ekman T and Hedin GThe JastAdd system modular extensible compiler constructionSci. Comput. Program.2007691314-26http://dx.doi.org/10.1016/j.scico.2007.02.003
[10]
Evans R and Gazdar G DATR: a language for lexical knowledge representation Comput. Linguist. 1996 22 2 167-216 http://www.aclweb.org/anthology/J/J96/J96-2002.pdf
[11]
Gardent, C.: Integrating a unification-based semantics in a large scale lexicalised tree adjoining grammar for French. In: Proceedings of 22nd International Conference on Computational Linguistics (Coling 2008), Manchester, UK, pp. 249–256 (2008). http://www.aclweb.org/anthology/C08-1032
[12]
Gardent, C., Kallmeyer, L.: Semantic construction in FTAG. In: EACL 2003, 10th Conference of the European Chapter of the Association for Computational Linguistics, pp. 123–130. Budapest, Hungary (2003). https://doi.org/10.3115/1067807.1067825
[13]
Henriques PR, Pereira MJV, Mernik M, Lenic M, Gray J, and Wu HAutomatic generation of language-based tools using the LISA systemIEE Proc. Softw.2005152254-69http://dx.doi.org/10.1049/ip-sen:20041317
[14]
Holzbaur C Bruynooghe M and Wirsing M Metastructures vs. attributed variables in the context of extensible unification Programming Language Implementation and Logic Programming 1992 Heidelberg Springer 260-268
[15]
Lichte T and Petitjean SImplementing semantic frames as typed feature structures with XMGJ. Lang. Model.201531185-228http://dx.doi.org/10.15398/jlm.v3i1.96
[16]
Ohori AA polymorphic record calculus and its compilationACM Trans. Program. Lang. Syst.1995176844-895http://doi.acm.org/10.1145/218570.218572
[17]
Pereira F and Warren DDefinite clause grammars for language analysis – a survey of the formalism and a comparison to augmented transition networksArtif. Intell.198013231-278http://dx.doi.org/10.1016/0004-3702(80)90003-X
[18]
Ranta AModular grammar engineering in GFRes. Lang. Comput.200752133-158http://dx.doi.org/10.1007/s11168-007-9030-6
[19]
Sag I and Wasow T Syntactic Theory. A Formal Introduction 1999 Stanford CSLI Publications
[20]
Schang, E., Duchier, D., Magnana Ekoukou, B., Parmentier, Y., Petitjean, S.: Describing São tomense using a tree-adjoining meta-grammar. In: 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11), Paris, France, pp. 82–89 (2012). http://www.aclweb.org/anthology/W12-4610
[21]
Shieber, S.M.: The design of a computer language for linguistic information. In: 10th International Conference on Computational Linguistics (COLING) and 22nd Annual Meeting of the Association for Computational Linguistics (ACL), pp. 362–366 (1984). http://aclweb.org/anthology/P84-1075
[22]
Van Roy, P.: Extended DCG notation: a tool for applicative programming in prolog. Technical report UCB/CSD 90/583, UC Berkeley (1990). http://www2.eecs.berkeley.edu/Pubs/TechRpts/1990/5471.html
[23]
Villemonte De La Clergerie, É.: 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 (2010). http://www.aclweb.org/anthology/W10-4414
[24]
Xia, F.: Automatic grammar generation from two different perspectives. Ph.D. thesis, University of Pennsylvania (2001)
[25]
XTAG Research Group: A lexicalized tree adjoining grammar for English. Technical report IRCS-01-03, IRCS, University of Pennsylvania (2001)

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016): 9th International Conference, LACL 2016, Nancy, France, December 5-7, 2016, Proceedings
Dec 2016
353 pages
ISBN:978-3-662-53825-8
DOI:10.1007/978-3-662-53826-5
  • Editors:
  • Maxime Amblard,
  • Philippe de Groote,
  • Sylvain Pogodalla,
  • Christian Retoré
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 05 December 2016

Author Tags

  1. Formal grammar
  2. Meta-grammar
  3. Compilation
  4. Logic programming

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media