BibSonomyburst/user/diego_ma/grammarBibSonomy RSS feed for /user/diego_ma/grammar2012-02-16T12:23:28+01:00http://www.bibsonomy.org/bibtex/2aab4ee41c7330c8564794ad304ec2d59/diego_madiego_ma2007-12-14T02:49:30+01:00grammar <span class="authorEditorList"><a href="/author/Bunt">Harry Bunt</a>, and <a href="/author/van Horck">Arthur van Horck</a> (Eds.). </span><em>Mouton de Gruyer, </em><em>Berlin, </em>(<em>1996</em>)Fri Dec 14 02:49:30 CET 2007BerlinDiscontinuous Constituency1996grammar http://www.bibsonomy.org/bibtex/27f0138f56192ab8b6ee9a58bc8ccd636/diego_madiego_ma2007-12-14T02:48:33+01:00machine_learning grammar <span class="authorEditorList"><a href="/author/van Zaanen">Menno van Zaanen</a> </span><em>COLING 2000 - Proceedings of the 18th International Conference on Computational Linguistics, </em><em>page 961--967. </em>(<em>2000</em>)Fri Dec 14 02:48:33 CET 2007COLING 2000 - Proceedings of the 18th International Conference on Computational Linguistics961--967{ABL}: Alignment-Based Learning2000machine_learning grammar http://www.bibsonomy.org/bibtex/2cb4a3198fa15460df762c602a2fc24fa/diego_madiego_ma2007-12-14T02:48:32+01:00machine_learning grammar <span class="authorEditorList"><a href="/author/van Zaanen">Menno van Zaanen</a> </span><em>Proceedings of the Seventeenth International Conference on Machine Learning, </em><em>page 1063--1070. </em><em>Stanford University, </em><em>Morgan Kaufmann Publishers, </em>(<em>July 2000</em>)Fri Dec 14 02:48:32 CET 2007Proceedings of the Seventeenth International Conference on Machine Learning#jul#1063--1070Bootstrapping Syntax and Recursion using Alignment-Based Learning2000machine_learning grammar http://www.bibsonomy.org/bibtex/2bdd6761816572f92ec958474967412dc/diego_madiego_ma2007-12-14T02:45:29+01:00grammar <span class="authorEditorList"><a href="/author/Quirk">Randolph Quirk</a>, <a href="/author/Greenbaum">Sidney Greenbaum</a>, <a href="/author/Leech">Geoffrey Leech</a>, and <a href="/author/Svartvik">Jan Svartvik</a> </span><em>Longman, </em><em>Harlow, UK, </em>(<em>1972</em>)Fri Dec 14 02:45:29 CET 2007Harlow, UKA Grammar of Contemporary English1972grammar http://www.bibsonomy.org/bibtex/28c507ff92338e2ed380bbd15b30e0333/diego_madiego_ma2007-12-14T02:45:28+01:00grammar <span class="authorEditorList"><a href="/author/Quirk">Randolph Quirk</a>, <a href="/author/Greenbaum">Sidney Greenbaum</a>, <a href="/author/Leech">Geoffrey Leech</a>, and <a href="/author/Svartvik">Jan Svartvik</a> </span><em>Longman, </em><em>London, </em>(<em>1985</em>)Fri Dec 14 02:45:28 CET 2007LondonA Comprehensive Grammar of the English Language1985grammar http://www.bibsonomy.org/bibtex/265ccc6bfaeeea105f9a76256b35ad221/diego_madiego_ma2007-12-14T02:45:19+01:00grammar constraint_programming <span class="authorEditorList"><a href="/author/Pullum">Geoffrey K. Pullum</a>, and <a href="/author/Scholz">Barbara C. Scholz</a> </span><em>Proceedings LACL 2001, </em><em>page 17-43. </em><em>Berlin Heidelberg, </em><em>Springer-Verlag, </em>(<em>2001</em>)Fri Dec 14 02:45:19 CET 2007Berlin HeidelbergProceedings LACL 200117-43Lecture Notes in Artificial IntelligenceOn the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks2001grammar constraint_programming 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.http://www.bibsonomy.org/bibtex/22e2abadb70a8a0c33ee0f138128ae214/diego_madiego_ma2007-12-14T02:43:18+01:00machine_learning grammar <span class="authorEditorList"><a href="/author/Mernik">Marjan Mernik</a>, <a href="/author/Črepinšek">Matej Črepinšek</a>, <a href="/author/Gerlič">Goran Gerlič</a>, <a href="/author/Žumer">Viljem Žumer</a>, <a href="/author/Bryant">Barrett R. Bryant</a>, and <a href="/author/Sprague">Alan Sprague</a> </span><em>University of Maribor and The University of Alabama at Birginham, </em>(<em>2003</em>)Fri Dec 14 02:43:18 CET 2007Learning Context-Free Grammars using an Evolutionary Approach2003machine_learning grammar 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.http://www.bibsonomy.org/bibtex/2fa938ae1e24d2653b482ae4e0a7d5e7b/diego_madiego_ma2007-12-14T02:43:10+01:00NLP grammar <span class="authorEditorList"><a href="/author/McCord">Michael McCord</a>, <a href="/author/Bernth">Arendse Bernth</a>, <a href="/author/Lappin">Shalom Lappin</a>, and <a href="/author/Zadrozny">Wlodek Zadrozny</a> </span><em>International Journal on Artificial Intelligence Tools</em> <em>1(2):229-277</em> (<em>1992</em>)Fri Dec 14 02:43:10 CET 2007International Journal on Artificial Intelligence Tools2229-277Natural Language Processing within a Slot Grammar Framework11992NLP grammar http://www.bibsonomy.org/bibtex/29fd3c9dd70c1723408fa3412a154028e/diego_madiego_ma2007-12-14T02:40:50+01:00DG grammar <span class="authorEditorList"><a href="/author/Hudson">Richard Hudson</a> </span><em>Linguistics</em> (<em>1980</em>)Fri Dec 14 02:40:50 CET 2007Linguistics489-504A Second Attack on Constituency181980DG grammar http://www.bibsonomy.org/bibtex/2ec345b7105132ff9c8c66c36e4f7367d/diego_madiego_ma2007-12-14T02:40:49+01:00DG grammar <span class="authorEditorList"><a href="/author/Hudson">Richard Hudson</a> </span><em>Linguistics</em> (<em>1980</em>)Fri Dec 14 02:40:49 CET 2007Linguistics170-198Constituency and Dependency181980DG grammar http://www.bibsonomy.org/bibtex/270ee87106d50a8b53d89f712379f43a4/diego_madiego_ma2007-12-14T02:39:06+01:00DG grammar <span class="authorEditorList"><a href="/author/Gaifman">H. Gaifman</a> </span><em>Information and Control</em> (<em>1965</em>)Fri Dec 14 02:39:06 CET 2007Information and Control304-337Dependency Systems and Phrase-Structure Systems81965DG grammar http://www.bibsonomy.org/bibtex/28a485f09e7cc050925181420da1ab828/diego_madiego_ma2007-12-14T02:37:56+01:00DG grammar <span class="authorEditorList"><a href="/author/Dahl">Öster Dahl</a> </span><em>Linguistics</em> (<em>1980</em>)Fri Dec 14 02:37:56 CET 2007Linguistics484-488Some Arguments for Higher Nodes in Syntax: A Reply to Hudson's `Constituency and Dependency'181980DG grammar http://www.bibsonomy.org/bibtex/26bc9bb8718cb309bbffb3ae720d3a221/diego_madiego_ma2007-12-14T02:37:46+01:00NLP grammar prolog <span class="authorEditorList"><a href="/author/Covington">Michael A. Covington</a> </span><em>AI-1994-06. </em><em>Artificial Intelligence Center, The University of Georgia, </em>(<em>1994</em>)Fri Dec 14 02:37:46 CET 2007AI-1994-06{GULP} 3.1: An Extension of Prolog for Unification-Based Grammar1994NLP grammar prolog http://www.bibsonomy.org/bibtex/28ff465d7bd9b7c9df5a943dff1d42124/diego_madiego_ma2007-12-14T02:37:23+01:00constraint_programming grammar prolog <span class="authorEditorList"><a href="/author/Christiansen">Henning Christiansen</a> </span><em>http://www.dat.ruc.dk/\~henning/chrg/CHRGusersGuide.html, </em>(<em>November 2002</em>)<em>Visited 28 August 2003 . </em>Fri Dec 14 02:37:23 CET 2007\myurl{http://www.dat.ruc.dk/\~{}henning/chrg/CHRGusersGuide.html}NovemberVisited 28 August 2003User's Guide to CHR Grammars2002constraint_programming grammar prolog 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.http://www.bibsonomy.org/bibtex/24a87de8a3f726dec9e1dba751477ece3/diego_madiego_ma2007-12-14T02:37:22+01:00constraint_programming grammar prolog <span class="authorEditorList"><a href="/author/Christiansen">Henning Christiansen</a> </span>(<em>2002</em>)<em>Submitted to journal Theory and Practice of Logic Programming . </em>Fri Dec 14 02:37:22 CET 2007Submitted to journal Theory and Practice of Logic ProgrammingCHR Grammmars2002constraint_programming grammar prolog 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...http://www.bibsonomy.org/bibtex/20867164030a769fd9596124157d17dcc/diego_madiego_ma2007-12-14T02:37:13+01:00grammar computer <span class="authorEditorList"><a href="/author/Carroll">John Carroll</a>, <a href="/author/Briscoe">Ted Briscoe</a>, and <a href="/author/Grover">Claire Grover</a> </span><em>Computer Laboratory, University of Cambridge, </em>(<em>1991</em>)Fri Dec 14 02:37:13 CET 2007A Development Environment for Large Natural Language Grammars1991grammar computer http://www.bibsonomy.org/bibtex/2ae6caf9d6534238aad9b2d11ed379efb/diego_madiego_ma2007-12-14T02:36:20+01:00grammar <span class="authorEditorList"><a href="/author/Borsley">Robert D. Borsley</a> </span><em>Blackwell, </em><em>Oxford, </em>(<em>1996</em>)Fri Dec 14 02:36:20 CET 2007OxfordModern Phrase Structure Grammar1996grammar http://www.bibsonomy.org/bibtex/2c81b103c7d901af6aae2345d8a7758e3/diego_madiego_ma2007-12-14T02:35:53+01:00DG grammar <span class="authorEditorList"><a href="/author/Baumgärtner">K. Baumgärtner</a> </span><em>Vorschläge für eine strukturale Grammatik des Deutschen, </em><em>Wissenschaftliche Buchgesellschaft, </em><em>Darmstadt, </em>(<em>1970</em>)Fri Dec 14 02:35:53 CET 2007DarmstadtVorschl{\"a}ge f{\"u}r eine strukturale {G}rammatik des {D}eutschenKonstituenz und {D}ependenz. {Z}ur {I}ntegration der beiden grammatischen {P}rinzipien.1970DG grammar