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 ...

As is known, metalanguage is a language by means of which another language is described. The latter is called object-language. One and the same language may play the role of object-language and metalanguage. For example, the Russian language taken as an object of linguistic description is an object-language, the Russian language used for a linguistic description of Russian is a metalanguage. Th...

This study addresses the acquisition of the morphological markers in Persian learners of English as a foreign language. To this end, the accuracy order of nine morphemes including plural –s, progressive –ing, copula be, auxiliary be, irregular past tense, regular past tense –ed, third person –s, possessive -ʼs and indefinite articles was studied in 6...

Floating quantifiers (FQs) in English exhibit both universal and language-specific properties, and this paper shows that such syntactic and semantic characteristics can be explained in terms of a constraint-based, lexical approach to the construction within the framework of Head-Driven Phrase Structure Grammar (HPSG). Based on the assumption that FQs are base-generated VP modifiers, this paper ...

Sociolinguistics and language contact studies have been since the work of Labov and Bickerton, to name just two major theoretical figures in the two fields, in search for adequate theoretical models. Due to the dominance of Chomskian linguistics in the 70s and 80s both made compromises with the logical machinery underlying Chomsky’s proposals: Labov designed since 1969 grammars with variable ru...

A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vectors, it is called parallelogram free. We show that there exist n-element point sets in the plane in general position, and parallelogram free, that determine only O(n/ √ logn) distinct distances. This answers a question o...

In this paper we look at the interpretation of Quantifier Phrases from the perspective of Symmetric Categorial Grammar. We show how the apparent mismatch between the syntactic and semantic behaviour of these expressions can be resolved in a typelogical system equipped with two Merge relations: one for syntactic units, and one for the evaluation contexts of the semantic values associated with th...

This paper proposes to give an analysis of VP coordination in the LTAG semantics framework of (Kallmeyer and Joshi, 2003). First the syntax of VP coordination is described using an operation called conjoin. Then we discuss interactions of coordination scope and quantifier scope in simple sentences and their analysis in LTAG. Finally we point out coordination scope ambiguities in embedded senten...