We present a library of implemented HPSG analyses for argument optionality based on typological studies of this phenomenon in the world’s languages, developed in the context of a grammar customization system that pairs a crosslinguistic core grammar with extensions for non-universal phenomena on the basis of user input of typological properties. Our analyses are compatible with multiple interse...

The paper presents a computationally tractable application of Bulgarian pronouns representation using Universal Networking Language (UNL) formalism. It analyses grammar features of pronouns and offers a model of their formal representation based on incorporation of grammar, semantic and lexical knowledge by using standard UNL knowledge representation mechanisms. The entire application presents ...

The formation of Universal Social Moral Values (USMV) is considered as one the backbone Malaysian education curriculum to create harmonious individuals living in society regardless religion, race and belief. Nevertheless, inculcation these social moral values not clearly seen Arabic grammar even though main source for comes from al-Quran, which loaded with values. On that account, this research...

In Construction Grammar, grammatical patterns are conventional pairings of form and meaning that are analogous to words. This article contrasts Construction Grammar with competing syntactic theories that are based on universal constraints and the projection properties of words. It reviews arguments for construction-based syntax derived from the following linguistic phenomena: semantic and synta...

The goal of this study is to reintegrate the theory of generative grammar into the cognitive sciences. Generative grammar was right to focus on the child's acquisition of language as its central problem, leading to the hypothesis of an innate Universal Grammar. However, generative grammar was mistaken in assuming that the syntactic component is the sole course of combinatoriality, and that ever...

In this paper, the context dependence multilevel pattern matching(in short CDMPM) grammar transform is proposed; based on this grammar transform, the universal lossless data compression algorithm, CDMPM code is then developed. Moreover, it is proved that this algorithms’ worst case redundancy among all individual sequences of length n from a finite alphabet is upper bounded by ) log / 1 ( n C w...

Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six contextfree components. We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the...

A grammar transform is a transformation that converts any data sequence to be compressed into a grammar from which the original data sequence can be fully reconstructed. In a grammar-based code, a data sequence is first converted into a grammar by a grammar transform and then losslessly encoded. Among several recently proposed grammar transforms is the multilevel pattern matching (MPM) grammar ...