<?xml version="1.0" ?>
<!-- This file was exported from BibSonomy, http://www.bibsonomy.org -->

<bibliography>

<biblioentry xreflabel="Mernik:2003" id="Mernik:2003">
   <authorgroup>
       <author><firstname>Mernik&#44;</firstname><surname>Marjan</surname></author>
       <author><firstname>\v</firstname><othername role="mi">Crepin\v sek&#44;</othername><surname>Matej</surname></author>
       <author><firstname>Gerli\v</firstname><othername role="mi">c&#44;</othername><surname>Goran</surname></author>
       <author><firstname>\v</firstname><othername role="mi">Zumer&#44;</othername><surname>Viljem</surname></author>
       <author><firstname>Bryant&#44;</firstname><othername role="mi">Barrett</othername><surname>R.</surname></author>
       <author><firstname>Sprague&#44;</firstname><surname>Alan</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Learning Context&#45;Free Grammars using an Evolutionary Approach</citetitle>





   <pubdate>2003</pubdate>  
   <abstract>
      <para>Machine learning of grammars finds many applications in syntactic pattern recognition&#44; computational biology&#44; natural language acquisition&#44; etc. In this paper a new application of grammatical inference is suggested. Development of domain&#45;specific languages is a hard problem for domain experts not versed in programming language design. We believe that syntax of a small domain&#45;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&#45;specific heuristic operators and non&#45;random construction of the initial population are proposed to achieve this task. Suitability of the approach is shown by small examples where underlying context&#45;free grammars are successfully inferred.
      </para>
   </abstract>
</biblioentry>
<biblioentry xreflabel="Christiansen:2002" id="Christiansen:2002">
   <authorgroup>
       <author><firstname>Christiansen&#44;</firstname><surname>Henning</surname></author> 
   </authorgroup>
<citetitle pubwork="article">CHR Grammmars</citetitle>





   <pubdate>2002</pubdate>  
   <abstract>
      <para>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&#45;up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena...
      </para>
   </abstract>
</biblioentry>
<biblioentry xreflabel="Christiansen:2002b" id="Christiansen:2002b">
   <authorgroup>
       <author><firstname>Christiansen&#44;</firstname><surname>Henning</surname></author> 
   </authorgroup>
<citetitle pubwork="article">User&#39;s Guide to CHR Grammars</citetitle>





   <pubdate>2002</pubdate>  
   <abstract>
      <para>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&#45;headed rules. You need to have a recent version of SICSTUS Prolog installed on your computer that supports the CHR library.
      </para>
   </abstract>
</biblioentry>
<biblioentry xreflabel="Pullum:2001" id="Pullum:2001">
   <authorgroup>
       <author><firstname>Pullum&#44;</firstname><othername role="mi">Geoffrey</othername><surname>K.</surname></author>
       <author><firstname>Scholz&#44;</firstname><othername role="mi">Barbara</othername><surname>C.</surname></author> 
   </authorgroup>
<citetitle pubwork="article">On the Distinction between Model&#45;Theoretic and Generative&#45;Enumerative Syntactic Frameworks</citetitle>

   <publisher>
      <publishername>Springer&#45;Verlag</publishername>
   </publisher>


   <artpagenums>17-43</artpagenums> 
   <pubdate>2001</pubdate>  
   <abstract>
      <para>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&#45;theoretic syntax (MTS). They are based on very different mathematics. GES developed in the 1950s out of Post&#39;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&#44; relating to cardinality of the set of expressions&#44; size of individual expressions&#44; and &#65533;transderivational constraints&#65533;. We then turn to three kinds of linguistic phenomena: partial grammaticality&#44; the syntactic properties of expression fragments&#44; and the fact that the lexicon of any natural language is in constant flux&#44; 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&#44; and touch on implications for parsing and acquisition.
      </para>
   </abstract>
</biblioentry>
<biblioentry xreflabel="vanZaanen:2000:2" id="vanZaanen:2000:2">
   <authorgroup>
       <author><firstname>van</firstname><othername role="mi">Zaanen&#44;</othername><surname>Menno</surname></author> 
   </authorgroup>
<citetitle pubwork="article">ABL: Alignment&#45;Based Learning</citetitle>




   <artpagenums>961&#x2013;967</artpagenums> 
   <pubdate>2000</pubdate>  

</biblioentry>
<biblioentry xreflabel="vanZaanen:2000" id="vanZaanen:2000">
   <authorgroup>
       <author><firstname>van</firstname><othername role="mi">Zaanen&#44;</othername><surname>Menno</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Bootstrapping Syntax and Recursion using Alignment&#45;Based Learning</citetitle>

   <publisher>
      <publishername>Morgan Kaufmann Publishers</publishername>
   </publisher>


   <artpagenums>1063&#x2013;1070</artpagenums> 
   <pubdate>2000</pubdate>  

</biblioentry>
<biblioentry xreflabel="Borsley:1996" id="Borsley:1996">
   <authorgroup>
       <author><firstname>Borsley&#44;</firstname><othername role="mi">Robert</othername><surname>D.</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Modern Phrase Structure Grammar</citetitle>

   <publisher>
      <publishername>Blackwell</publishername>
   </publisher>



   <pubdate>1996</pubdate>  

</biblioentry>
<biblioentry xreflabel="Bunt:1996" id="Bunt:1996">
   <authorgroup>

   </authorgroup>
<citetitle pubwork="article">Discontinuous Constituency</citetitle>

   <publisher>
      <publishername>Mouton de Gruyer</publishername>
   </publisher>



   <pubdate>1996</pubdate>  

</biblioentry>
<biblioentry xreflabel="Covington:1994:3" id="Covington:1994:3">
   <authorgroup>
       <author><firstname>Covington&#44;</firstname><othername role="mi">Michael</othername><surname>A.</surname></author> 
   </authorgroup>
<citetitle pubwork="article">GULP 3.1: An Extension of Prolog for Unification&#45;Based Grammar</citetitle>





   <pubdate>1994</pubdate>  

</biblioentry>
<biblioentry xreflabel="McCord:1992" id="McCord:1992">
   <authorgroup>
       <author><firstname>McCord&#44;</firstname><surname>Michael</surname></author>
       <author><firstname>Bernth&#44;</firstname><surname>Arendse</surname></author>
       <author><firstname>Lappin&#44;</firstname><surname>Shalom</surname></author>
       <author><firstname>Zadrozny&#44;</firstname><surname>Wlodek</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Natural Language Processing within a Slot Grammar Framework</citetitle>
   <citetitle pubwork="journal">International Journal on Artificial Intelligence Tools</citetitle>

   <volumenum>1</volumenum> 

   <artpagenums>229-277</artpagenums> 
   <pubdate>1992</pubdate>  

</biblioentry>
<biblioentry xreflabel="Carroll:1991" id="Carroll:1991">
   <authorgroup>
       <author><firstname>Carroll&#44;</firstname><surname>John</surname></author>
       <author><firstname>Briscoe&#44;</firstname><surname>Ted</surname></author>
       <author><firstname>Grover&#44;</firstname><surname>Claire</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Development Environment for Large Natural Language Grammars</citetitle>





   <pubdate>1991</pubdate>  

</biblioentry>
<biblioentry xreflabel="Quirk:1985:G" id="Quirk:1985:G">
   <authorgroup>
       <author><firstname>Quirk&#44;</firstname><surname>Randolph</surname></author>
       <author><firstname>Greenbaum&#44;</firstname><surname>Sidney</surname></author>
       <author><firstname>Leech&#44;</firstname><surname>Geoffrey</surname></author>
       <author><firstname>Svartvik&#44;</firstname><surname>Jan</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Comprehensive Grammar of the English Language</citetitle>

   <publisher>
      <publishername>Longman</publishername>
   </publisher>



   <pubdate>1985</pubdate>  

</biblioentry>
<biblioentry xreflabel="Dahl:1980" id="Dahl:1980">
   <authorgroup>
       <author><firstname>Dahl&#44;</firstname><surname>&#38;&#35;x00D6;ster</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Some Arguments for Higher Nodes in Syntax: A Reply to Hudson&#39;s &#96;Constituency and Dependency&#39;</citetitle>
   <citetitle pubwork="journal">Linguistics</citetitle>

   <volumenum>18</volumenum> 

   <artpagenums>484-488</artpagenums> 
   <pubdate>1980</pubdate>  

</biblioentry>
<biblioentry xreflabel="Hudson:1980b" id="Hudson:1980b">
   <authorgroup>
       <author><firstname>Hudson&#44;</firstname><surname>Richard</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Second Attack on Constituency</citetitle>
   <citetitle pubwork="journal">Linguistics</citetitle>

   <volumenum>18</volumenum> 

   <artpagenums>489-504</artpagenums> 
   <pubdate>1980</pubdate>  

</biblioentry>
<biblioentry xreflabel="Hudson:1980a" id="Hudson:1980a">
   <authorgroup>
       <author><firstname>Hudson&#44;</firstname><surname>Richard</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Constituency and Dependency</citetitle>
   <citetitle pubwork="journal">Linguistics</citetitle>

   <volumenum>18</volumenum> 

   <artpagenums>170-198</artpagenums> 
   <pubdate>1980</pubdate>  

</biblioentry>
<biblioentry xreflabel="Quirk:1972" id="Quirk:1972">
   <authorgroup>
       <author><firstname>Quirk&#44;</firstname><surname>Randolph</surname></author>
       <author><firstname>Greenbaum&#44;</firstname><surname>Sidney</surname></author>
       <author><firstname>Leech&#44;</firstname><surname>Geoffrey</surname></author>
       <author><firstname>Svartvik&#44;</firstname><surname>Jan</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Grammar of Contemporary English</citetitle>

   <publisher>
      <publishername>Longman</publishername>
   </publisher>



   <pubdate>1972</pubdate>  

</biblioentry>
<biblioentry xreflabel="Baumgaertner:1970" id="Baumgaertner:1970">
   <authorgroup>
       <author><firstname>Baumg&#38;&#35;x00E4;rtner&#44;</firstname><surname>K.</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Konstituenz und Dependenz. Zur Integration der beiden grammatischen Prinzipien.</citetitle>

   <publisher>
      <publishername>Wissenschaftliche Buchgesellschaft</publishername>
   </publisher>



   <pubdate>1970</pubdate>  

</biblioentry>
<biblioentry xreflabel="Gaifman:1965" id="Gaifman:1965">
   <authorgroup>
       <author><firstname>Gaifman&#44;</firstname><surname>H.</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Dependency Systems and Phrase&#45;Structure Systems</citetitle>
   <citetitle pubwork="journal">Information and Control</citetitle>

   <volumenum>8</volumenum> 

   <artpagenums>304-337</artpagenums> 
   <pubdate>1965</pubdate>  

</biblioentry>
</bibliography>

