Search results for "Language and speech"
showing 10 items of 166 documents
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.
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…
The double-incompleteness theorem
1976
Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is T-unrefutable. For English translation and proof, see K. Podnieks What is mathematics: Godel's theorem and around.
Star-free trace languages
1992
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
"Table 14" of "Search for magnetic monopoles and stable high-electric-charge objects in 13 TeV proton-proton collisions with the ATLAS detector"
2019
Selection efficiency as a function of transverse kinetic energy $E^\text{kin}_\text{T}=E_\text{kin}\sin\theta$ and pseudorapidity $|\eta|$ for $g=2g_\textrm{D}$ monopoles of mass 500 GeV.
"Table 19" of "Search for magnetic monopoles and stable high-electric-charge objects in 13 TeV proton-proton collisions with the ATLAS detector"
2019
Selection efficiency as a function of transverse kinetic energy $E^\text{kin}_\text{T}=E_\text{kin}\sin\theta$ and pseudorapidity $|\eta|$ for $g=2g_\textrm{D}$ monopoles of mass 3000 GeV.
"Table 17" of "Search for magnetic monopoles and stable high-electric-charge objects in 13 TeV proton-proton collisions with the ATLAS detector"
2019
Selection efficiency as a function of transverse kinetic energy $E^\text{kin}_\text{T}=E_\text{kin}\sin\theta$ and pseudorapidity $|\eta|$ for $g=2g_\textrm{D}$ monopoles of mass 2000 GeV.
"Table 10" of "Search for magnetic monopoles and stable high-electric-charge objects in 13 TeV proton-proton collisions with the ATLAS detector"
2019
Selection efficiency as a function of transverse kinetic energy $E^\text{kin}_\text{T}=E_\text{kin}\sin\theta$ and pseudorapidity $|\eta|$ for $g=1g_\textrm{D}$ monopoles of mass 2500 GeV.
"Table 16" of "Search for magnetic monopoles and stable high-electric-charge objects in 13 TeV proton-proton collisions with the ATLAS detector"
2019
Selection efficiency as a function of transverse kinetic energy $E^\text{kin}_\text{T}=E_\text{kin}\sin\theta$ and pseudorapidity $|\eta|$ for $g=2g_\textrm{D}$ monopoles of mass 1500 GeV.