Contextual Grammars Research Articles

Various Types of Comet Languages and their Application in External Contextual Grammars

Various Types of Comet Languages and their Application in External Contextual Grammars

Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection

Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection

Relations of contextual grammars with strictly locally testable selection languages

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate the computational capacity of contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages. With these results, also an open problem regarding ordered and non-counting selection languages is solved.

On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages.

CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages

The [Formula: see text] problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it characterizes the family of context sensitive languages by two-component CD grammar systems with propagating scattered context rules.

Generative Capacity of Contextual Grammars with Subregular Selection Languages*

A contextual grammar is a language generating mechanism inspired by generating sentences in natural languages. An existing string can be extended to a new string of the language by adjoining a context before and behind the string or by inserting it into the string around some subword. The first mode is called external derivation whereas the second mode is called internal derivation. If conditions are given, around which words which contexts can be adjoined, we speak about contextual grammars with selection. We give an overview about the generative capacity of contextual grammars (working externally or internally) where the selection languages belong to subregular language classes. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We compare such families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages, or based on languages defined by restrictions regarding the descriptional complexity.

Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete

This paper investigates the reduction of scattered context grammars with respect to the number of non-context-free productions. It proves that every recursively enumerable language is generated by a scattered context grammar that has no more than one non-context-free production. An open problem is formulated.

Remarks on external contextual grammars with selection

In an external contextual grammar with selection, contexts are associated with selection languages, and the context (u,v) can be wrapped around a word w if and only if w belongs to the selection language associated with (u,v). In the papers [1], [3], [4], and [6], some hierarchies are presented if selection languages are taken from subregular language families, defined by automata-theoretic and combinatorial properties, codes, and ideals. In this paper we merge and complete the hierarchies.

Formal Grammar Theory in Recognition Methods of Unknown Objects

Questions on the formation of contextual grammars that describe both the structural information of an image and the interaction of images in a complex scenario have been considered. The use of a multilevel grammar is proposed, including the task of parsing a sequence of images, as well as the task of parsing objects for various purposes, when the nature of the source is not clear. It is shown that the formation of a grammar that describes both the structural information of an image and the interaction of images is associated with the need to develop an algorithm for recovering the grammar from a given set of dynamic images that represent a training sample. Some basic provisions inherent in structural methods for describing and recognizing a scene are presented.

AMALAN PEMILIHAN TATABAHASA PEDAGOGI BERKONTEKS OLEH GURU BAHASA MELAYU SEKOLAH RENDAH

This study focuses on the practice of selecting pedagogical grammar in primary school. In terms of objective, the study examines the selection of pedagogical grammar practices via contextual grammar by Malay Language teachers in primary schools. The objective of this study was to identify the selection of pedagogical grammar practices via contextual in teaching and learning (PDP) by the Malay Language in primary school. The research question is: What is the score of a selection of pedagogical grammar practices via contextual in teaching and learning (PDP) by the Malay Language in primary school? This study uses quantitative design through the survey method. The instrument was a set of a questionnaire containing 10 items using the Five Points Likert Scale. This study used quota sampling that consisted of 149 teachers who teach the Malay Language in primary schools. A total of 26 schools in the National School (SK), eight schools in the Chinese National Primary School (SJKC) and seven Tamil National Primary Schools (SJKT) in the Gombak district have been identified as the study locations. Data were analyzed descriptively presented in the form of mean and standard deviation. The result shows that the score of a selection of pedagogical grammar practices via contextual in teaching and learning (PDP) by Malay Language teacher in primary school is high; mean values ranged from 3.73 to 4.03, and standard deviations ranged from 0.57 to 0.75. The implications of this study highlighted that teacher can improve those practices in teaching and learning (PDP) in primary schools through a planned curriculum involved.

A Pumping Lemma for Permitting Semi-Conditional Languages

Permitting semi-conditional grammars (pSCGs) are extensions of context-free grammars where each rule is associated with a word [Formula: see text] and such a rule can be applied to a sentential form [Formula: see text] only if [Formula: see text] is a subword of [Formula: see text]. We consider permitting generalized SCGs (pgSCGs) where each rule [Formula: see text] is associated with a set of words [Formula: see text] and [Formula: see text] is applicable only if every word in [Formula: see text] occurs in [Formula: see text]. We investigate the generative power of pgSCGs with no erasing rules and prove a pumping lemma for their languages. Using this lemma we show that pgSCGs are strictly weaker than context-sensitive grammars. This solves a long-lasting open problem concerning the generative power of pSCGs. Moreover, we give a comparison of the generating power of pgSCGs and that of forbidding random context grammars with no erasing rules.

Developing Writing Materials Based on Eclectic Approach for Indonesian EFL Learners

<p>This study aims at developing writing materials based on Eclectic Approach for Indonesian EFL learners. The material is mainly developed and used for teaching essay writing for the third-semester students in the English Department, University of Islam Malang. It is also expected that the materials lower their anxiety as the findings of the preliminary study. This R and D research adapted development model proposed by Borg and Gall with the following procedures: need analysis, developing writing materials, expert validation, revision I, try out, revision II, and final product. The final product of this research is an instructional material for Writing III course which was developed by considering students' needs, levels, suggestions, and feedback from experts. It also made used of the principles of Eclectic approach to lower their anxiety in writing essay, such as providing much exposure toward the target language with less pressure, integrating the good sides of various teaching techniques, using real-life situation to make learning more comprehensible, considering the students' needs, teaching and introducing contextual grammar and vocabulary, and integrating all language skills.</p>

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors

CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages

The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it characterizes the family of context sensitive languages by two-component CD grammar systems with propagating scattered context rules.

An Online Induction Algorithm for Internal Contextual Grammars Using Restarting Automata

In this paper, we propose a new algorithm to induce an internal contextual grammar from positive examples using restarting automata. Motivation comes from, real-time systems which induce the target grammar within a deadline. In our algorithm, we deal with real time inputs which are generated by internal contextual grammar. Principally grammatical inference and grammar induction are considered equivalent but there is a slight difference, in this paper we concentrate on that difference. Here initially our algorithm will concentrate on grammatical Inference but at last it will be ended up with the concept of grammar induction. In order to induce the grammar, we first obtain insertion rules by scanning an input at a particular time unit. The insertion rules are converted into contextual rules. This set of contextual rules will be a guess about the grammar without taking care of over generalization. Further we will check the correctness of the contextual rules using restarting automata for the next input string and we update the rules based on need, that is called correction phase. After getting the final time-unit/deadline as an input, the algorithm executes some steps on the induced grammar to prune the over generalization of strings. It produces the final grammar for the strings which are given within the final time-unit.

Contextual hyperedge replacement

Contextual hyperedge-replacement grammars (contextual grammars, for short) are an extension of hyperedge replacement grammars. They have recently been proposed as a grammatical method for capturing the structure of object-oriented programs, thus serving as an alternative to the use of meta-models like uml class diagrams in model-driven software design. In this paper, we study the properties of contextual grammars. Even though these grammars are not context-free, one can show that they inherit several of the nice properties of hyperedge replacement grammars. In particular, they possess useful normal forms and their membership problem is in NP.

On Grammatical Quotatives - A Study on the Variance in Which Communicative Modal Context Dictates Grammatical Expressives in the Korean Language

This paper reveals a new understanding of the function that Korean quotative expressions perform in a spoken communicative context in contrast to what will described as the functions employed in a purely grammatical or written form. It will be seen if the Korean language allows for quotative expressions to be utilized dependent upon contextual situations.The need for a contextual grammar is raised through an examination of the semi-spoken language corpus. Upon this foundation, the author presents a framework for analysis of a corpus-based approach. This corpus here utilized is a sample, a dataset compromising approximately one million lines of script, of grammatical quotative expressions compiled from a number of Korean television miniseries (Korean ‘drama’) programs. It is hoped that the analysis of the data allows for in depth analysis and conclusive definition of the influence the contextual elements of purpose, register, and speaker-listener relationships have on the merits or shortcomings of ‘grammar in context’.

Syllabic Languages and Go-through Automata

In this paper we define a new class of contextual grammars and study how the languages generated by such grammars can be accepted by go-through automata. The newly introduced class of grammars is a generalization of the formalism previously used to describe the linguistic process of syllabification. Go-through automata which are used here to recognize, and also parse, the languages generated by this new class of grammars are generalizations of push-down automata in the area of context-sensitivity; they have been proved to be an efficient tool for the recognition of languages generated by contextual grammars. The main results of the paper show how the newly introduced generative model is related with other classes of Marcus contextual languages, and how syllabic languages are recognized and parsed using go-through automata.

Natural Language Understanding and Prediction: from Formal Grammars to Large Scale Machine Learning

Scientists have long dreamed of creating machines humans could interact with by voice. Although one no longer believes Turing's prophecy that machines will be able to converse like humans in the near future, real progress has been made in the voice and text-based human-machine interaction. This paper is a light introduction and survey of some deployed natural language systems and technologies and their historical evolution. We review two fundamental problems involving natural language: the language prediction problem and the language understanding problem. While describing in detail all these technologies is beyond our scope, we do comment on some aspects less discussed in the literature such as language prediction using huge models and semantic labeling using Marcus contextual grammars.

One-sided random context grammars with a limited number of right random context rules

This paper deals with regulated grammars. Specifically, it studies one-sided random context grammars. It demonstrates that any recursively enumerable language can be generated by these grammars with no more than two right random context rules.