Learn More About This
Directory
This directory sponsored by SIQL, a Spider Makers company...
1. The Chomsky Hierarchy of formal grammars
- www.spectrum.uni-bielefeld.de
- Next: Some useful properties of Up: Formalisms Previous: Formal Grammars .
- The Chomsky Hierarchy of formal grammars.
- The languages defined by Type 0 grammars are accepted by Turing machines; Chomskyan transformations are defined as Type 0 grammars. Type 0 grammars have rules of the form where and are arbitrary strings over a vocabulary V and. ...
- Type 1: Context-sensitive grammars. The languages defined by Type 1 grammars are accepted by linear bounded automata; the syntax of some natural languages (including Dutch, Swiss German and Bambara), but not all, is generally held in computational linguistics to have structures of this type. Type 1 grammars have rules of the form B where , , , or of the form , where is the initial symbol and is the empty string. ...
- Type 2: Context-free grammars. The languages defined by Type 2 grammars are accepted by push-down automata; the syntax of natural languages is definable almost entirely in terms of context-free languages and the tree structures generated by them. Type 2 grammars have rules of the form , where ,. ...
- Type 3: Regular grammars. The languages defined by Type 3 grammars are accepted by finite state automata; morphological structure and perhaps all the syntax of informal spoken dialogue is describable by regular grammars. ...
- Right-linear (right-regular), with rules of the form or ; the structural descriptions generated with these grammars are right-branching. ...
- Left-linear (left-regular), with rules of the form or ; the structural descriptions generated with these grammars are left-branching. ...
2. Conjunctive grammars
- www.cs.queensu.ca
- Conjunctive grammars Conjunctive grammars, introduced by Okhotin in 2000 1 , are an extension context-free grammars, in which the formalism of rules includes an explicit set-theoretic intersection operation, i. ...
- It is known that the family of languages generated by conjunctive grammars properly contains the intersection closure of the context-free languages and that conjunctive grammars can provide very succinct descriptions of some context-free languages. On the other hand, it has been proved that a number of "good" properties of context-free grammars, such as the notion of derivation tree and the existence of efficient recognition algorithms, are retained. ...
- A survey of known results on conjunctive grammars has recently appeared in .
- Okhotin, An overview of conjunctive grammars (ps, pdf, html), in: Paun, Rozenberg, Salomaa (Eds. ...
- Following is the list of papers on conjunctive grammars: .
- Okhotin, On augmenting the formalism of context-free grammars with an intersection operation, Trudy IV Mezhdunarodnoi konferentsii "Diskretnye modeli v teorii upravlyayushchikh sistem" (Proceedings of the Fourth International conference "Discrete models in the theory of control systems"), 2000, 106-109, in Russian. ...
- Okhotin, Conjunctive grammars, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519-535. ...
- Okhotin, Top-down parsing of conjunctive languages, Grammars, 5:1 (2002), 21-40. ...
- Okhotin, On P-completeness of the membership problem for conjunctive grammars an abstract of a conference talk, Diskretnaya matematika i matematicheskaya kibernetika: trudy mezhdunarodnoi shkoly-seminara, Ratmino, 31 May-3 June 2001 (Proceedings of the International School-Seminar on Discrete Mathematics and Mathematical Cybernetics). ...
- Okhotin, A recognition and parsing algorithm for arbitrary conjunctive grammars (journal version), Theoretical Computer Science, 302 (2003), 365-399. ...
- Okhotin, LR parsing for conjunctive grammars, Grammars, 5:2 (2002), 81-124. ...
- Okhotin, Conjunctive grammars and systems of language equations, in Russian, Programmirovanie, 28:5 (2002). ...
- Okhotin, On the equivalence of linear conjunctive grammars and trellis automata (ps, pdf), Informatique Théorique et Applications, to appear. ...
- Okhotin, Whale Calf, a parser generator for conjunctive grammars, presented at CIAA 2002; slides from the talk. ...
- Okhotin, An overview of conjunctive grammars (ps, pdf, html), to appear. ...
3. cs/0008021 Compact non-left-recursive grammars using the selective left-corner transform and factoring
- arxiv.org
- From: Brian Roark view email Date: Tue, 22 Aug 2000 15:16:22 GMT (37kb) Compact non-left-recursive grammars using the selective left-corner transform and factoring.
- 7 Journal-ref: Proceedings of the 18th International Conference on Computational Linguistics (COLING), 2000, pages 355-361 The left-corner transform removes left-recursion from (probabilistic) context-free grammars and unification grammars, permitting simple top-down parsing techniques to be used. Unfortunately the grammars produced by the standard left-corner transform are usually much larger than the original. ... Combined with two factorizations, it produces non-left-recursive grammars that are not much larger than the original. ...
4. HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION
- www.worldscibooks.com
- HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION.
- Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then the list of areas which have interacted with the development of graph grammars has grown quite impressively. ...
- The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact within the area of graph grammars, graph transformation is considered a fundamental programming paradigm where computation includes specification, programming, and implementation. ...
- Over the last 25-odd years graph grammars have developed at a steady pace into a theoretically attractive and well-motivated research field. ... Volume 1 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations includes a state-of-the-art presentation of the foundations of all the basic approaches to rule-based graph specification and transformation: algebraic approach, logic approach, node-based rewriting, (hyper)edge-based rewriting, programmed graph rewriting, and 2-structures. ...
- Node Replacement Graph Grammars (J Engelfriet & G Rozenberg) .
- Hyperedge Replacement Graph Grammars (F Drewes et al. ...
- HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATION ">Recommend this book .
5. Dotted Grammars - Generalized Deterministic Parsing
- www.gits.nl
- Dotted Grammars Home Page.
- You are in the right place for information on dotted grammars and my generalized deterministic parser generator for these grammars. ...
- Phrase structure grammars .
- Dotted grammars .
- Two example grammars .
- So I tried to model "recording" and "playing back" with Chomsky's phrase structure grammars. This line of thought lead to the definition of what I call dotted grammars. Phrase structure grammars .
- As I understand it, phrase structure grammars were originally introduced by Noam Chomsky as a mathematical tool with which to define the syntax and semantics of natural languages. These grammars are generally divided into the following four classes. ...
- Unrestricted phrase structure grammars .
- This is the most general class of grammars. These grammars can be shown to be equal in expressive prower with Turing machines and as such are said to generate the set of recursively enumerable languages. ...
- Context sensitive phrase structure grammars .
- The expressive power of context sensitive grammars has been shown to equal that of Linear Bounded Automata (nondeterministic Turing machines with a linear bound on the length of their tape). These grammars are said to generate the set of context sensitive languages. ...
6. Excalibur - SCSP - Grammars
- www.ai-center.com
- Grammars Elements Structural Constraints SCSPs Generation Redundancy Combination Conclusion .
- Algebraic Graph Grammars.
- This section provides a more or less informal introduction in algebraic graph grammars (see @ @ @ for a detailed overview). ...
- Algebraic graph grammars are a generalization of Chomsky grammars. ...
- Graph grammars can be used as a mechanism for describing potential neighbor states in the search space. ...
- Grammars Elements Structural Constraints SCSPs Generation Redundancy Combination Conclusion .
7. C Language Grammars
- www.vendian.org
- C Language - Grammars.
- Some artifacts of my playing with C grammars.
- A sloppy diff between ANSI and C9X grammars. ...
8. Google Directory - Science > Social Sciences > Linguistics > Morphology and Syntax > Grammars
- directory.google.com
- Grammars.
- Science > Social Sciences > Linguistics > Morphology and Syntax > Grammars Go to Directory Home .
- Head-Driven Phrase Structure Grammars (11).
9. Introduction to Grammars
- www.cs.ucl.ac.uk
- Introduction to Grammars.
- Grammars are something we may have learned at school. However, those sort of grammars are for natural languages, like Chinese, Spanish or English. ...
- Alphabets are just lists of letters allowed, and lexicons are fairly obvious too, but grammars are less so. ...
10. 9 More on Grammars
- cafe.bevocal.com
- 9 More on Grammars .
- Grammars are a very powerful feature of VoiceXML. ... VoiceXML allows you to write grammars using several formats; all examples in this tutorial use the Nuance GSL format. This chapter describes how grammars work and the basics of the Nuance GSL format you can use to create grammars.
- Grammars are defined with the <grammar> tag. ...
- This section gives a basic look at grammars. ...
- Grammars for Mixed-Initiative Forms.
- This rule illustrates several basic facts about writing GSL grammars. ...
- Slot names are frequently used in a grammar for an entire form or for external grammars that will be reused by multiple forms. ...
- Grammars for Mixed-Initiative Forms.
11. The AGFL Grammar Work Lab
- www.cs.kun.nl
- This is the website of the AGFL-project (Affix Grammars over a Finite Lattice) whose goal is the development of a technology for Natural Language Processing available in the public domain. ...
- It is a formalism in which large context free grammars can be described in a compact way. AGFLs belong to the family of two level grammars, along with attribute grammars: a first, context-free level is augmented with set-valued features for expressing agreement between parts of speech. ...
- The AGFL parser generation system for Natural Languages generates efficient parsers from AGFL grammars. ...
- Together with the AGFL system, free grammars and lexica for a number of languages are made available: .
12. PHRASE Parsers from Multi-Axiom Grammars
- www.cs.uiowa.edu
- PHRASE Parsers from Multi-Axiom Grammars.
- The multi-axiom grammars (MAG) are alternatives to the single-axiom context free grammars (CFG) and all-axiom algebraic grammars (AG) for programming language specification. ...
- 2 Grammars and other rewriting systems , F. ...
Other related topics:
Do you have a great site about Grammars? Is
your Grammars site listed here?
Would you like a prefered placement of your site in this directory?
It's easy! First place, the HTML from the box below on your page that
you would like listed in this directory.
Then use our link submission request with
your name, your contact information, and the URL of your site that has
a link to this directory. After we
verify your link to us, we'll make sure your site stays in our directory,
and we'll give it prefered placement here also.
Here is how to make a simple text link to us. Just copy the code in this
box to your website:
We can also develop a custom Guide To The Internet for your site. Please
request your own
custom Guide To The Internet.
This custom Guide To The Internet produced by
Siql. Visit us today, and find out how to get your own
custom guide to the Internet, and how to get your site
listed in our guides.
Copyright 1995-2005 by Siql. All
Rights Reserved.