Abstract
The concept of metagrammar has been introduced to factorize information contained in a grammar. A metagrammar compiler can then be used to compute an actual grammar from a metagrammar. In this paper, we present a new metagrammar compiler based on 2 important concepts from logic programming, namely (1) the Warren’s Abstract Machine and (2) constraints on finite set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
XTAG-Research-Group: A lexicalized tree adjoining grammar for english. Technical Report IRCS-01-03, IRCS, University of Pennsylvania (2001), Available at, http://www.cis.upenn.edu/~xtag/gramrelease.html
Abeillé, A., Candito, M., Kinyon, A.: Ftag: current status and parsing scheme. In: VEXTAL, Venice, Italy (1999)
Kroch, A., Joshi, A.: The linguistic relevance of tree adjoining grammars. Technical report, MS-CIS-85-16, University of Pennsylvania, Philadelphia (1985)
Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69–124. Springer, Berlin (1997)
Vijay-Shanker, K., Schabes, Y.: Structure sharing in lexicalized tree adjoining grammars. In: Proceedings of the 16th International Conference on Computational Linguistics (COLING 1992), Nantes, pp. 205–212 (1992)
Candito, M.: Représentation modulaire et paramétrable de grammaires électroniques lexicalisées: application au français et à l’italien. PhD thesis, Université Paris 7 (1999)
Gaiffe, B., Crabbé, B., Roussanaly, A.: A new metagrammar compiler. In: Proceedings of the 6th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+6), Venice (2002)
Xia, F., Palmer, M., Vijay-Shanker, K.: Toward semi-automating grammar development. In: Proc. of the 5th Natural Language Processing Pacific Rim Symposium(NLPRS-1999), Beijing, China (1999)
Rogers, J., Vijay-Shanker, K.: Reasoning with descriptions of trees. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pp. 72–80 (1992)
Crabbé, B.: Lexical classes for structuring the lexicon of a tag. In: Proceedings of the Lorraine/Saarland workshop on Prospects and Advances in the Syntax/Semantics Interface (2003)
Crabbé, B.: Alternations, monotonicity and the lexicon: an application to factorising information in a tree adjoining grammar. In: Proceedings of the 15th ESSLLI, Vienne (2003)
Perrier, G.: Interaction grammars. In: Proceedings of the 18th International Conference on Computational Linguistics (COLING 2000), Saarbrucken, pp. 600–606 (2000)
Van Roy, P.: Extended dcg notation: A tool for applicative programming in prolog. Technical report, Technical Report UCB/CSD 90/583, Computer Science Division, UC Berkeley (1990)
Ait-Kaci, H.: Warren’s abstract machine: A tutorial reconstruction. In: Furukawa, K. (ed.) Logic Programming: Proc. of the Eighth International Conference, p. 939. MIT Press, Cambridge (1991)
Duchier, D.: Constraint programming for natural language processing (2000) Lecture Notes. In: ESSLLI 2000 (2000), Available at, http://www.ps.uni-sb.de/Papers/abstracts/duchier-esslli2000.html
Crabbé, B., Gaiffe, B., Roussanaly, A.: Représentation et gestion du lexique d’une grammaire d’arbres adjoints, Traitement Automatique des Langues, 43,3 (2004)
Villemonte de la Clergerie, E.: Designing efficient parsers with DyALog, Slides presented at GLINT, Universidade Nova de Lisboa (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duchier, D., Le Roux, J., Parmentier, Y. (2005). The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture. In: Van Roy, P. (eds) Multiparadigm Programming in Mozart/Oz. MOZ 2004. Lecture Notes in Computer Science, vol 3389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31845-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-31845-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25079-1
Online ISBN: 978-3-540-31845-3
eBook Packages: Computer ScienceComputer Science (R0)