Search results for "Speech processing"
showing 10 items of 210 documents
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…
The Shuffle Product: New Research Directions
2015
In this paper we survey some recent researches concerning the shuffle operation that arise both in Formal Languages and in Combinatorics on Words.
Neutral baryonic systems with strangeness
2020
We review the status as regards the existence of three- and four-body bound states made of neutrons and $\Lambda$ hyperons. For interesting cases, the coupling to neutral baryonic systems made of charged particles of different strangeness has been addressed. There are strong arguments showing that the $\Lambda nn$ system has no bound states. $\Lambda\Lambda nn$ strong stable states are not favored by our current knowledge of the strangeness $-1$ and $-2$ baryon-baryon interactions. However, a possible $\Xi^- t$ quasibound state decaying to $\Lambda\Lambda nn$ might exist in nature. Similarly, there is a broad agreement about the nonexistence of $\Lambda\Lambda n$ bound states. However, the …
Transverse nonlinear optics in heavy-metal-oxide glass
2008
6 pags. ; 9 figs.
Bottom-quark mass from finite energy QCD sum rules
2011
Finite energy QCD sum rules involving both inverse and positive moment integration kernels are employed to determine the bottom quark mass. The result obtained in the $\bar{\text {MS}}$ scheme at a reference scale of $10\, {GeV}$ is $\bar{m}_b(10\,\text{GeV})= 3623(9)\,\text{MeV}$. This value translates into a scale invariant mass $\bar{m}_b(\bar{m}_b) = 4171 (9)\, {MeV}$. This result has the lowest total uncertainty of any method, and is less sensitive to a number of systematic uncertainties that affect other QCD sum rule determinations.
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
Polarization Modulation Instability in All-Normal Dispersion Microstructured Optical Fibers with Quasi-Continuous 1064 nm Pump
2019
Polarization modulation instability (PMI) is a form of modulation instability that can exist in weakly birefringent optical fibers [1]. Sidebands can be generated by this effect when a polarization mode of the birefringent fiber is excited with an intense optical pump. The polarization state of the sidebands is orthogonal to the polarization of the pump signal. PMI has been observed in microstructured optical fibers (MOFs). PMI was reported in a large-air-filling fraction MOF that was pumped in the normal dispersion regime with visible light [2]. The coherent degradation of femtosecond supercontinuum light generated in all-normal dispersion (ANDi) MOFs due to PMI was recently investigated […
Early signs of dyslexia from the speech and language processing of children
2009
The Jyvaskyla Longitudinal Study of Dyslexia project (JLD) has followed the development of 200 children from birth until 10 years of age. Half the children are from families in which at least one of the parents has dyslexia, thus the child has a high risk of becoming dyslexic, and half have no such risk. Here the main findings of four studies in linguistics from the JLD project are reviewed. The speech processing skills were studied in 6, 18, 24 and 30-month-old children. The findings show that early signs of dyslexia can be detected in speech processing both phonologically and morphosyntactically. These precursors can be seen in perception or production of duration, in the prosody and phon…
Linguistic Bias Modulates Interpretation of Speech via Neural Delta-Band Oscillations.
2017
Language comprehension requires that single words be grouped into syntactic phrases, as words in sentences are too many to memorize individually. In speech, acoustic and syntactic grouping patterns mostly align. However, when ambiguous sentences allow for alternative grouping patterns, comprehenders may form phrases that contradict speech prosody. While delta-band oscillations are known to track prosody, we hypothesized that linguistic grouping bias can modulate the interpretational impact of speech prosody in ambiguous situations, which should surface in delta-band oscillations when grouping patterns chosen by comprehenders differ from those indicated by prosody. In our auditory electroenc…
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.