|
|
|
|
| LEADER |
02631nmm a2200325 u 4500 |
| 001 |
EB000721079 |
| 003 |
EBX01000000000000000574161 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9789401589697
|
| 100 |
1 |
|
|a Paun, Gheorghe
|
| 245 |
0 |
0 |
|a Marcus Contextual Grammars
|h Elektronische Ressource
|c by Gheorghe Paun
|
| 250 |
|
|
|a 1st ed. 1997
|
| 260 |
|
|
|a Dordrecht
|b Springer Netherlands
|c 1997, 1997
|
| 300 |
|
|
|a XIV, 378 p
|b online resource
|
| 505 |
0 |
|
|a 1. Origin and Motivation -- 2. Formal Language Theory Prerequisites -- 3. Contexts (Adjoining) Everywhere -- 4. Basic Classes of Contextual Grammars -- 5. Generative Capacity -- 6. Language Theoretic Properties -- 7. Linguistically Relevant Properties -- 8. Grammars with Restricted Selection -- 9. Grammars with Minimal/Maximal Use of Selectors -- 10. Variants of Contextual Grammars -- 11. Two-Level Contextual Grammars -- 12. Regulated Contextual Grammars -- 13. A Generalization: n-contextual Grammars -- 14. A Dual Model: Insertion Grammars -- 15. Further Topics -- 16. Open Problems and Research Topics
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computational Linguistics
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Computer Science
|
| 653 |
|
|
|a Computational linguistics
|
| 653 |
|
|
|a Artificial intelligence
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Studies in Linguistics and Philosophy
|
| 028 |
5 |
0 |
|a 10.1007/978-94-015-8969-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-94-015-8969-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004
|
| 520 |
|
|
|a Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts interplay (selection). Most of the theoretical results obtained so far about the many variants of contextual grammars are presented with emphasis on classes of questions with relevance for applications in the study of natural language syntax: generative powers, descriptive and computational complexity, automata recognition, semilinearity, structure of the generated strings, ambiguity, regulated rewriting, etc. Constant comparison with families of languages in the Chomsky hierarchy is made. Connections with non-linguistic areas are established, such as molecular computing. Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax
|