Search results for "Speech processing"
showing 10 items of 210 documents
"Table 8" of "Measurement of charged-particle event shape variables in sqrt(s) = 7 TeV proton-proton interactions with the ATLAS detector"
2014
Mean Values of Thrust, Thrust Minor and Sphericity verses charged particle PT scalar sum.
"Table 4" of "Measurement of the differential cross sections for isolated direct photon pair production in $p \bar p$ collisions at $\sqrt{s} = 1.96$…
2013
The measured differential distribution in the polar scattering angle in the Collins-Soper frame;.
Vertical Representation of C∞-words
2015
International audience; We present a new framework for dealing with C∞-words, based on their left and right frontiers. Thisallows us to give a compact representation of them, and to describe the set of C∞-words throughan infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers ofC∞-words. We show that this map can be defined recursively and with no explicit reference toC∞-words. We then show that some important conjectures on C∞-words follow from analogousstatements on the structure of the graph G.
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Vertical representation of C∞-words
2015
We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.
Cognitive factors in the evaluation of synthetic speech
1998
Abstract This paper illustrates the importance of various cognitive factors involved in perceiving and comprehending synthetic speech. It includes findings drawn from the relative psychological and psycholinguistic literature together with experimental results obtained at the Fondazione Ugo Bordoni laboratory. Overall, it is shown that listening to and comprehending synthetic voices is more difficult than with a natural voice. However, and more importantly, this difficulty can and does decrease with the subjects' exposure to said synthetic voices. Furthermore, greater workload demands are associated with synthetic speech and subjects listening to synthetic passages are required to pay more …
Zur Bewertung zentraler Sprachstörungen mittels objektiver Kriterien: Ein psychophysiologischer Beitrag zur Diskussion der Neuroplastizitätshypothese
1992
Examinations of aphasic patients by using cognitive tasks were based on the hypothesis that semantically evoked potentials correlate to the processing of information in the different speech processing of information in the different speech processing areas. It was found that patients with Broca aphasia generated synchronization potentials in the Wernicke area in contrast to Wernicke patients. We suppose a correlation between the timing in sensorial speech processing areas and the generation of synchronization potentials.
Particle Swarm Optimization as a New Measure of Machine Translation Efficiency
2018
The present work proposes a new approach to measuring efficiency of evolutionary algorithm-based Machine Translation. We implement some attributes of evolutionary algorithms performing cosine similarity objective function of a Particle Swarm Optimization (PSO) algorithm then, we evaluate an English text set for translation precision into the Spanish text as a simulated benchmark, and explore the backward process. Our results show that PSO algorithm can be used for translation of multiple language sentences with one identifier only, in other words the technology presented is language-pair independent. Specifically, we indicate that our cosine similarity objective function improves the veloci…
Data Augmentation for Pipeline-Based Speech Translation
2020
International audience; Pipeline-based speech translation methods may suffer from errors found in speech recognition system output. Therefore, it is crucial that machine translation systems are trained to be robust against such noise. In this paper, we propose two methods for parallel data augmentation for pipeline-based speech translation system development. The first method utilises a speech processing workflow to introduce errors and the second method generates commonly found suffix errors using a rule-based method. We show that the methods in combination allow significantly improving speech translation quality by 1.87 BLEU points over a baseline system.
Infant Event-Related Potentials to Speech are Associated with Prelinguistic Development
2020
Highlights • Speech processing and prelinguistic skills studied in a large longitudinal sample. • Auditory ERPs predicted prelinguistic development in infancy in LCS models. • P1 amplitude at 6 months predicted prelinguistic development between 6 and 12 months. • MMR to a frequency change was associated with prelinguistic skills at 6 months. • Infants’ neural speech processing can help to predict early language development.