Search results for "Speech processing"
showing 10 items of 210 documents
The Expressibility of Languages and Relations by Word Equations
1997
Classically, several properties and relations of words, such as being a power of a same word, can be expressed by using word equations. This paper is devoted to study in general the expressive power of word equations. As main results we prove theorems which allow us to show that certain properties of words are not expressible as components of solutions of word equations. In particular, the primitiveness and the equal length are such properties, as well as being any word over a proper subalphabet.
Some applications of a theorem of Shirshov to language theory
1983
Some applications of a theorem of Shirshov to language theory are given: characterization of regular languages, characterization of bounded languages, and a sufficient condition for a language to be Parikh-bounded.
A word prediction methodology for automatic sentence completion
2015
Word prediction generally relies on n-grams occurrence statistics, which may have huge data storage requirements and does not take into account the general meaning of the text. We propose an alternative methodology, based on Latent Semantic Analysis, to address these issues. An asymmetric Word-Word frequency matrix is employed to achieve higher scalability with large training datasets than the classic Word-Document approach. We propose a function for scoring candidate terms for the missing word in a sentence. We show how this function approximates the probability of occurrence of a given candidate word. Experimental results show that the proposed approach outperforms non neural network lang…
BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS
2010
We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalized to non periodic infinite words as well.
Spoken-Word Segmentation and Dyslexia
2002
We used magnetoencephalography to elucidate the cortical activation associated with the segmentation of spoken words in nonreading-impaired and dyslexic adults. The subjects listened to binaurally presented sentences where the sentence-ending words were either semantically appropriate or inappropriate to the preceding sentence context. Half of the inappropriate final words shared two or three initial phonemes with the highly expected semantically appropriate words. Two temporally and functionally distinct response patterns were detected in the superior temporal lobe. The first response peaked at approximately 100 msec in the supratemporal plane and showed no sensitivity to the semantic appr…
Detrimental noise effects on brain's speech functions.
2009
Background noise has become part of our everyday life in modern societies. Its presence affects both the ability to concentrate and communicate. Some individuals, like children, the elderly, and non-native speakers have pronounced problems in noisy environments. Here we review evidence suggesting that background noise has both transient and Sustained detrimental effects on central speech processing. Studies on the effects of noise on neural processes have demonstrated hemispheric reorganization in speech processing in adult individuals during background noise. During noise, the well-known left hemisphere dominance in speech discrimination became right hemisphere preponderant. Furthermore, l…
Brain event-related potentials to phoneme contrasts and their correlation to reading skills in school-age children
2017
Development of reading skills has been shown to be tightly linked to phonological processing skills and to some extent to speech perception abilities. Although speech perception is also known to play a role in reading development, it is not clear which processes underlie this connection. Using event-related potentials (ERPs) we investigated the speech processing mechanisms for common and uncommon sound contrasts (/ba/-/da/-/ga/ and /ata/-/at: a/) with respect to the native language of school-age children in Finland and the US. In addition, a comprehensive behavioral test battery of reading and phonological processing was administered. ERPs revealed that the children could discriminate betw…
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Finite groups with all minimal subgroups solitary
2016
We give a complete classification of the finite groups with a unique subgroup of order p for each prime p dividing its order. All the groups considered in this paper will be finite. One of the most fruitful lines in the research in abstract group theory during the last years has been the study of groups in which the members of a certain family of subgroups satisfy a certain subgroup embedding property. The family of the subgroups of prime order (also called minimal subgroups) has attracted the interest of many mathematicians. For example, a well-known result of Itˆo (see [8, Kapitel III, Satz 5.3; 9]) states that a group of odd order with all minimal subgroups in the center is nilpotent. Th…
On Prefix Normal Words
2011
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…