Conference article

CG-3 — Beyond Classical Constraint Grammar

Eckhard Bick
University of Southern Denmark, Denmark

Tino Didriksen
GrammarSoft ApS, Denmark

Download article

Published in: Proceedings of the 20th Nordic Conference of Computational Linguistics, NODALIDA 2015, May 11-13, 2015, Vilnius, Lithuania

Linköping Electronic Conference Proceedings 109:7, p. 31-39

NEALT Proceedings Series 23:7, p. 31-39

Show more +

Published: 2015-05-06

ISBN: 978-91-7519-098-3

ISSN: 1650-3686 (print), 1650-3740 (online)

Abstract

This paper discusses methodological strengths and shortcomings of the Constraint Grammar paradigm (CG), showing how the classical CG formalism can be extended to achieve greater expressive power and how it can be enhanced and hybridized with techniques from other parsing paradigms. We present a new, largely theory-independent CG framework and rule compiler (CG-3), that allows the linguist to write CG rules incorporating different types of linguistic information and methodology from a wide range of parsing approaches, covering not only CG’s native topological technique, but also dependency grammar, phrase structure grammar and unification grammar. In addition, we allow the integration of statistical-numerical constraints and non-discrete tag and string sets.

Keywords

No keywords available

References

Arppe, Antti. 2000. Developing a grammar checker for Swedish. In: Torbjørn Nordgård (ed.). Proceedings of NODALIDA ’99. pp. 2840. Trondheim: Department of Linguistics, University of Trondheim.

Bick, Eckhard. 2003. A CG & PSG Hybrid Approach to Automatic Corpus Annotation. In: Kiril Simow& Petya Osenova (eds.). Proceedings of SProLaC2003 (at Corpus Linguistics 2003, Lancaster), pp. 112

Bick, Eckhard. 2004. Parsing and evaluating the French Europarl corpus, In: Patrick Paroubek, Isabelle Robba & Anne Vilnat (red.): Méthodes et outils pour l’évaluation des analyseurs syntaxiques (Journée ATALA, May 15, 2004). pp. 49. Paris: ATALA.

Bick, Eckhard. 2005. Turning Constraint Grammar Data into Running Dependency Treebanks. In: Civit, Montserrat & Kübler, Sandra & Martí, Ma. Antònia (red.). Proceedings of TLT 2005 (4th Workshop on Treebanks and Linguistic Theory, Barcelona), pp.1927

Bick, Eckhard. 2006a. A Constraint Grammar Based Spellchecker for Danish with a Special Focus on Dyslexics". In: Suominen, Mickael et.al. (ed.) A Man of Measure: Festschrift in Honour of Fred Karlsson on his 60th Birthday. Special Supplement to SKY Jounal of Linguistics, Vol. 19. pp. 387396. Turku: The Linguistic Association of Finland

Bick, Eckhard. 2006b. Turning a Dependency Treebank into a PSGstyle Constituent Treebank. In: Calzolari, Nicoletta et al. (eds.). Proceedings of LREC 2000. pp. 19611964

Bick, Eckhard. 2010. A Dependencybased Approach to Anaphora Annotation. In: (eds.) Extended Activities Proceedings, 9th International Conference on Computational Processing of the Portuguese Language (Porto Alegre, Brazil). ISSN 21773580

Bick, Eckhard. 2011. A Barebones Constraint Grammar. In: Helena Hong Gao & Minghui Dong (eds), Proceedings of the 25th Pacific Asia Conference on Language, Information and Computation (Singapore). pp. 226235

Bick, Eckhard. 2013. Using Constraint Grammar for Chunking. In: S. Oepen, K. Hagen & J. B. Joannessen (Eds). Proceedings of the 19th Nordic Conference of Computational Linguistics (NODALIDA 2013). Linköping Electronic Conference Proceedings Vol. 85, pp. 1326. Linköping: Linköping University Electronic Press.

Bick, Eckhard. 2014. PALAVRAS, a Constraint Grammarbased Parsing System for Portuguese. In: Tony Berber Sardinha & Thelma de Lurdes São Bento Ferreira (eds.), Working with Portuguese Corpora, pp 279302. London/New York: Bloomsburry Academic.

Birn, Jussi. 2000. Detecting grammar errors with Lingsoft’s Swedish grammar checker. In: Torbjørn Nordgård (ed.). Proceedings of NODALIDA ’99. p. 2840. Trondheim: Deparment of Linguistics, University of Trondheim.

Graña, Jorge & Gloria Andrade & Jesús Vilares. 2003. Compilation of constraintbased contextual rules for partofspeech tagging into finite state transducers. In: Proceedings of the 7th Conference on Implementation and Application of Automata (CIAA 2002). pp. 128–137. SpringerVerlag, Berlin.

Hagen, Kristin & Pia Lane & Trond Trosterud. 2001. En grammatikkontrol for bokmål. In: Kjell Ivar VAnnebo & Helge Sandøy (eds). Språkknyt 32001, pp. 69.
Oslo: Norsk Språkråd

Karlsson, Fred. 1990. Constraint Grammar as a Framwork for Parsing Running Text. In: Hans Karlgren (ed.). Proceedings of COLING90, Vol. 3, pp. 168173

Karlsson, Fred & Atro Voutilainen & Juha Heikkilä & Arto Anttila. 1995. Constraint Grammar: A languageindependent system for parsing unrestricted text. Natural Language Processing 4. Berlin & New York: Mouton de Gruyter.

Lager, Torbjörn. 1999. The µTBL System: Logic Programming Tools for TransformationBased Learning. In: Proceedings of CoNLL’99 (Bergen).

Lindberg, Nikolaj & Martin Eineborg. 1998. Learning Constraint Grammarstyle Disambiguation Rules Using Inductive Logic Programming. In: Proceedings of the 36th ACL / 17th COLING (Montreal, Canada). volume 2, pages 775–779

Tapanainen, Pasi. 1996. The Constraint Grammar Parser CG2. No 27, Publications of the Department of Linguistics, University of Helsinki. Tapanainen, Pasi. 1997. A Dependency Parser for English. Technical Reports No TR1. Department of Linguistics, University of Helsinki.

YliJyrä, Anssi Mikael. 2011. An Efficient Constraint Grammar Parser based on Inward Deterministic Automata. In: Proceedings of the NODALIDA 2011 Workshop ConstraintGrammar Applications, pp. 5060 NEALT ProceedingsSeries , vol. 14

Citations in Crossref