TY - RPRT AU - Mernik, Marjan AU - v Crepinv sek, Matej AU - Gerliv c, Goran AU - v Zumer, Viljem AU - Bryant, Barrett R. AU - Sprague, Alan A2 - T1 - Learning Context-Free Grammars using an Evolutionary Approach PB - University of Maribor and The University of Alabama at Birginham AD - PY - 2003/ VL - IS - SP - EP - UR - http://www.comp.mq.edu.au/~asloane/plrg/reading/genPar03.pdf DO - KW - machine_learning grammar L1 - N1 - N1 - N1 - AB - Machine learning of grammars finds many applications in syntactic pattern recognition, computational biology, natural language acquisition, etc. In this paper a new application of grammatical inference is suggested. Development of domain-specific languages is a hard problem for domain experts not versed in programming language design. We believe that syntax of a small domain-specific language can be inferred from positive and negative programs provided by domain experts. In our work we are the using genetic programming approach in grammatical inference. Grammar-specific heuristic operators and non-random construction of the initial population are proposed to achieve this task. Suitability of the approach is shown by small examples where underlying context-free grammars are successfully inferred. ER - TY - UNPB AU - Christiansen, Henning A2 - T1 - CHR Grammmars PY - 2002/ SP - EP - UR - http://www.dat.ruc.dk/~henning/chrg/PapersOnCHRG/index.html DO - KW - constraint_programming grammar prolog L1 - N1 - N1 - AB - A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena... ER - TY - GEN AU - Christiansen, Henning A2 - T1 - User's Guide to CHR Grammars JO - PB - C1 - PY - 2002/november VL - IS - SP - EP - UR - http://www.dat.ruc.dk/\~{}henning/chrg/CHRGusersGuide.html DO - KW - constraint_programming grammar prolog L1 - N1 - N1 - AB - This document explains how to use CHRG which is a grammar notation implemented on top of the CHR language of Constraint Handling Rules. CHR is an extension to Prolog with committed choice multiple-headed rules. You need to have a recent version of SICSTUS Prolog installed on your computer that supports the CHR library. ER - TY - CONF AU - Pullum, Geoffrey K. AU - Scholz, Barbara C. A2 - de Groote, Philippe A2 - Morrill, Glyn A2 - Retoré, Christian T1 - On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks T2 - Proceedings LACL 2001 PB - Springer-Verlag C1 - Berlin Heidelberg PY - 2001/ CY - IS - SP - 17 EP - 43 UR - http://www.informatik.uni-trier.de/~ley/db/conf/lacl/lacl2001.html#PullumS01 DO - KW - grammar constraint_programming L1 - SN - N1 - N1 - AB - Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES)an d model-theoretic syntax (MTS). They are based on very different mathematics. GES developed in the 1950s out of Post's work on the syntactic side of logic. MTS arose somewhat later out of the semantic side of logic. We identify some distinguishing theoretical features of these frameworks, relating to cardinality of the set of expressions, size of individual expressions, and �transderivational constraints�. We then turn to three kinds of linguistic phenomena: partial grammaticality, the syntactic properties of expression fragments, and the fact that the lexicon of any natural language is in constant flux, and conclude that MTS has some major advantages for linguistic description that have been overlooked. We briefly consider the issue of what natural languages in MTS terms, and touch on implications for parsing and acquisition. ER - TY - CONF AU - van Zaanen, Menno A2 - T1 - ABL: Alignment-Based Learning T2 - COLING 2000 - Proceedings of the 18th International Conference on Computational Linguistics PB - C1 - PY - 2000/ CY - IS - SP - 961 EP - 967 UR - http://www.ics.mq.edu.au/\~{}menno/docs/p_coling00.pdf DO - KW - machine_learning grammar L1 - SN - N1 - N1 - AB - ER - TY - CONF AU - van Zaanen, Menno A2 - Langley, Pat T1 - Bootstrapping Syntax and Recursion using Alignment-Based Learning T2 - Proceedings of the Seventeenth International Conference on Machine Learning PB - Morgan Kaufmann Publishers C1 - PY - 2000/07 CY - IS - SP - 1063 EP - 1070 UR - http://www.ics.mq.edu.au/\~{}menno/docs/p_icml00.pdf DO - KW - machine_learning grammar L1 - SN - N1 - N1 - AB - ER - TY - BOOK AU - Borsley, Robert D. A2 - T1 - Modern Phrase Structure Grammar PB - Blackwell C1 - Oxford PY - 1996/ VL - IS - SP - EP - UR - DO - KW - grammar L1 - SN - N1 - N1 - AB - ER - TY - BOOK AU - A2 - Bunt, Harry A2 - van Horck, Arthur T1 - Discontinuous Constituency PB - Mouton de Gruyer C1 - Berlin PY - 1996/ VL - IS - SP - EP - UR - DO - KW - grammar L1 - SN - N1 - N1 - AB - ER - TY - RPRT AU - Covington, Michael A. A2 - T1 - GULP 3.1: An Extension of Prolog for Unification-Based Grammar PB - Artificial Intelligence Center, The University of Georgia AD - PY - 1994/ VL - IS - AI-1994-06 SP - EP - UR - http://www.ai.uga.edu/\~{}mc/ DO - KW - NLP grammar prolog L1 - N1 - N1 - N1 - AB - ER - TY - JOUR AU - McCord, Michael AU - Bernth, Arendse AU - Lappin, Shalom AU - Zadrozny, Wlodek T1 - Natural Language Processing within a Slot Grammar Framework JO - International Journal on Artificial Intelligence Tools PY - 1992/ VL - 1 IS - 2 SP - 229 EP - 277 UR - DO - KW - NLP grammar L1 - SN - N1 - N1 - AB - ER - TY - RPRT AU - Carroll, John AU - Briscoe, Ted AU - Grover, Claire A2 - T1 - A Development Environment for Large Natural Language Grammars PB - Computer Laboratory, University of Cambridge AD - PY - 1991/ VL - IS - SP - EP - UR - DO - KW - grammar computer L1 - N1 - N1 - N1 - AB - ER - TY - BOOK AU - Quirk, Randolph AU - Greenbaum, Sidney AU - Leech, Geoffrey AU - Svartvik, Jan A2 - T1 - A Comprehensive Grammar of the English Language PB - Longman C1 - London PY - 1985/ VL - IS - SP - EP - UR - DO - KW - grammar L1 - SN - N1 - N1 - AB - ER - TY - JOUR AU - Dahl, Öster T1 - Some Arguments for Higher Nodes in Syntax: A Reply to Hudson's `Constituency and Dependency' JO - Linguistics PY - 1980/ VL - 18 IS - SP - 484 EP - 488 UR - DO - KW - DG grammar L1 - SN - N1 - N1 - AB - ER - TY - JOUR AU - Hudson, Richard T1 - A Second Attack on Constituency JO - Linguistics PY - 1980/ VL - 18 IS - SP - 489 EP - 504 UR - DO - KW - DG grammar L1 - SN - N1 - N1 - AB - ER - TY - JOUR AU - Hudson, Richard T1 - Constituency and Dependency JO - Linguistics PY - 1980/ VL - 18 IS - SP - 170 EP - 198 UR - DO - KW - DG grammar L1 - SN - N1 - N1 - AB - ER - TY - BOOK AU - Quirk, Randolph AU - Greenbaum, Sidney AU - Leech, Geoffrey AU - Svartvik, Jan A2 - T1 - A Grammar of Contemporary English PB - Longman C1 - Harlow, UK PY - 1972/ VL - IS - SP - EP - UR - DO - KW - grammar L1 - SN - N1 - N1 - AB - ER - TY - CHAP AU - Baumgärtner, K. A2 - Steger, H. T1 - Konstituenz und Dependenz. Zur Integration der beiden grammatischen Prinzipien. T2 - Vorschläge für eine strukturale Grammatik des Deutschen PB - Wissenschaftliche Buchgesellschaft C1 - Darmstadt PY - 1970/ VL - IS - SP - EP - UR - DO - KW - DG grammar L1 - SN - N1 - N1 - AB - ER - TY - JOUR AU - Gaifman, H. T1 - Dependency Systems and Phrase-Structure Systems JO - Information and Control PY - 1965/ VL - 8 IS - SP - 304 EP - 337 UR - DO - KW - DG grammar L1 - SN - N1 - N1 - AB - ER -