We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an initial vertex to a final vertex. In 2001, Morvan and Stirling proved that rational graphs accept the context-sensitive languages between rational sets of initia...

This paper presents a probabilistic phone mapping model (PPM) that makes possible automatic speech recognition using a foreign phonetic system. We formulate the training of the phone mapping model in the framework of maximum likelihood estimation. The model can be learned automatically from the reference phonetic transcript and the phonetic transcript resulting from a foreign phonetic recognise...

I t is wel] known tha t context-sensitive languages can be generated by means of monotonic grammars (see Ginsburg, Greibach, 1966) i.e. grammars whose rules have the form f --~ g, where I f ] , the length of f, is not greater than I g I . Such a g rammar generates the language, but almost no grammatical structure of the language is given. When such a structure is also investigated the original ...

As shown by Michaelis (2001a,b), Stablerian Minimalist Grammars (MGs) (Stabler 1997b, 1998, 2008) belong among the class of mildly context-sensitive grammar formalisms as, e.g., characterized in Joshi et al. 1991. Crucially, mild context-sensitivity depends on what may—somewhat loosely—be referred to as resource-sensitivity, i.e., strictly limited combinability of syntactic objects. Within MGs,...

A word-by-word human sentence processing complexity metric is presented. This metric formalizes the intuition that comprehenders have more trouble on words contributing larger amounts of information about the syntactic structure of the sentence as a whole. The formalization is in terms of the conditional entropy of grammatical continuations, given the words that have been heard so far. To calcu...

Conceptualization seeks to map a short text (i.e., a word or a phrase) to a set of concepts as a mechanism of understanding text. Most of prior research in conceptualization uses human-crafted knowledge bases that map instances to concepts. Such approaches to conceptualization have the limitation that the mappings are not context sensitive. To overcome this limitation, we propose a framework in...

2. Introduction. Context-sensitive grammars (csgs) are one of the classical grammar families of formal language theory. They were introduced in [Ch59] and have been studied extensively since then (see []3073, Ha78] for an overview). Context-sensitive grammars are defined as rewriting systems, where the length of the right hand side of every production is at least as large as the length of the l...

existence of heavy minerals in waters in some regions causes serious environmental pollution and affects the soil and water resources quality. soil and waters sensitive to pollutants were investigated in this research, based on the degree of sensitivity of their parameters. the samples obtained from industrial and agricultural areas for identifying water tables at higher risk and display region...

some formulations of drug in adhesive transdermal drug delivery systems ()tddss)( with different functional and non-functional acrylic pressure sensitive adhesives psas)( were prepared. for this purpose fentanyl was used as a drug component. the effects of psas type on skin permeation and in vitro drug release from devices were evaluated using hydrodynamically well-characterized chien permeatio...

This paper explores the effect of improved morphological analysis, particularly context sensitive morphology, on monolingual Arabic Information Retrieval (IR). It also compares the effect of context sensitive morphology to noncontext sensitive morphology. The results show that better coverage and improved correctness have a dramatic effect on IR effectiveness and that context sensitive morpholo...