Observations on grammar and language families

In this report, we emphasize the differences of grammar families and their properties versus language families and their properties. To this end, we investigate grammar families from an abstract standpoint, developping a new framework of reasoning. In particular when considering decidability questions, special care must be taken when trying to use decidability results (which are, in the first place, properties of grammar families) in order to establish results (e.g. hierarchy results) on language families. We illustrate this by inspecting some theorems and their proofs in the field of regulated rewriting. In this way, we also correct the formulation of an important theorem of Hinz and Dassow. As an exercise, we show that there is no `effective\u27 grammatical characterization of the family of recursive languages. Moreover, we show how to prove the strictness of the Chomsky hierarchy using decidability properties only. Most of the material of this report will be published in `fundamenta informaticae\u27

Passive sentences and structural parsing

Traditional language parsing is mainly based on generative grammar in English. As English and Chinese belong to two different families of language, a grammar is not sufficient for Chinese parsing although it is still important. In passive sentences in English and Chinese, there exists some similarity, but there also exists some difference. In this paper, first the sememe analysis is introduced in Chinese parsing. Second, we will compare the passive sentence in English and Chinese with respect to sentence pattern, semantic relations and other aspects in view of knowledge graph theory. We find that after we use sememe analysis in Chinese parsing, we can easily deal with Chinese passive sentences

Time-Bounded Controlled Bidirectional Grammars

We study regularly controlled bidirectional (RCB) grammars from the viewpoint of time-bounded grammars. RCB-grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this kind of grammar. A time-bound on such a grammar is a measure of its derivational complexity. For some families of time bounds and for some modes of derivation we establish closure properties and a normal form theorem. In addition parsing algorithms are given for some modes of derivation. We conclude with considering generalizations with respect to the family of control languages and the family of bounding functions

Equational reasoning with context-free families of string diagrams

String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we define a class of context-free grammars, called B-ESG grammars, that are suitable for defining entire families of string graphs, and crucially, of string graph rewrite rules. We show that the language-membership and match-enumeration problems are decidable for these grammars, and hence that there is an algorithm for rewriting string graphs according to B-ESG rewrite patterns. We also show that it is possible to reason at the level of grammars by providing a simple method for transforming a grammar by string graph rewriting, and showing admissibility of the induced B-ESG rewrite pattern.Comment: International Conference on Graph Transformation, ICGT 2015. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21145-9_

A dynamic network Aapproach to the study of syntax

Usage-based linguists and psychologists have produced a large body of empirical results suggesting that linguistic structure is derived from language use. However, while researchers agree that these results characterize grammar as an emergent phenomenon, there is no consensus among usage-based scholars as to how the various results can be explained and integrated into an explicit theory or model. Building on network theory, the current paper outlines a structured network approach to the study of grammar in which the core concepts of syntax are analyzed by a set of relations that specify associations between different aspects of a speaker’s linguistic knowledge. These associations are shaped by domain-general processes that can give rise to new structures and meanings in language acquisition and language change. Combining research from linguistics and psychology, the paper proposes specific network analyses for the following phenomena: argument structure, word classes, constituent structure, constructions and construction families, and grammatical categories such as voice, case and number. The article builds on data and analyses presented in Diessel (2019 ; The Grammar Network. How Linguistic Structure is Shaped by Language Use ) but approaches the topic from a different perspective

Innovative Family-Based Genetically Informed Series of Analyses of Whole-Exome Data Supports Likely Inheritance for Grammar in Children with Specific Language Impairment

Individuals with specific language impairment (SLI) struggle with language acquisition despite average non-verbal intelligence and otherwise typical development. One SLI account focuses on grammar acquisition delay. The current study aimed to detect novel rare genetic variants associated with performance on a grammar assessment, the Test of Early Grammatical Impairment (TEGI), in English-speaking children. The TEGI was selected due to its sensitivity and specificity, consistently high heritability estimates, and its absence from all but one molecular genetic study. We performed whole exome sequencing (WES) in eight families with SLI (n = 74 total) and follow-up Sanger sequencing in additional unrelated probands (n = 146). We prioritized rare exonic variants shared by individuals with low TEGI performance (n = 34) from at least two families under two filtering workflows: (1) novel and (2) previously reported candidate genes. Candidate variants were observed on six new genes (PDHA2, PCDHB3, FURIN, NOL6, IQGAP3, and BAHCC1), and two genes previously reported for overall language ability (GLI3 and FLNB). We specifically suggest PCDHB3, a protocadherin gene, and NOL6 are critical for ribosome synthesis, as they are important targets of SLI investigation. The proposed SLI candidate genes associated with TEGI performance emphasize the utility of precise phenotyping and family-based genetic study

Static watson-crick linear grammars and its computational power

DNA computing, or more generally, molecular computing, is a recent development on computations using biological molecules, instead of the traditional siliconchips. Some computational models which are based on different operations of DNA molecules have been developed by using the concept of formal language theory. The operations of DNA molecules inspire various types of formal language tools which include sticker systems, grammars and automata. Recently, the grammar counterparts of Watson-Crick automata known as Watson-Crick grammars which consist of regular, linear and context-free grammars, are defined as grammar models that generate doublestranded strings using the important feature of Watson-Crick complementarity rule. In this research, a new variant of static Watson-Crick linear grammar is introduced as an extension of static Watson-Crick regular grammar. A static Watson-Crick linear grammar is a grammar counterpart of sticker system that generates the double-stranded strings and uses rule as in linear grammar. There is a difference in generating double-stranded strings between a dynamic Watson-Crick linear grammar and a static Watson-Crick linear grammar. A dynamic Watson-Crick linear grammar produces each stranded string independently and only check for the Watson-Crick complementarity of a generated complete double-stranded string at the end; while the static Watson-Crick linear grammar generates both stranded strings dependently, i.e., checking for the WatsonCrick complementarity for each complete substring. The main result of the paper is to determine some computational properties of static Watson-Crick linear grammars. Next, the hierarchy between static Watson-Crick languages, Watson-Crick languages, Chomsky languages and families of languages generated by sticker systems are presented

Controlled Bidirectional Grammars

We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar. The resulting language families (properly) extend the family of context-free languages. We establish some closure properties of these language families and some grammatical transformations which yield a few normal forms for this type of grammar. Finally, we consider some special cases (viz. the context-free grammar is linear or left-linear), and generalizations, in particular, the use of arbitrary rather than regular control languages

Controlled Fuzzy Parallel Rewriting

We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show (i) regular control does not provide additional generating power to the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyper-AFFL, i.e., a hyper-algebraically closed full Abstract Family of Fuzzy Languages