Search results for " Speech"

showing 10 items of 519 documents

Automata and differentiable words

2011

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this construction to the case of C\infinity-words, i.e., words differentiable arbitrary many times. We thus obtain an infinite automaton for representing the set of C\infinity-words. We derive a classification of C\infinity-words induced by the structure of the automaton. Then, we introduce a new framework for dealing with \infinity-words, based on a three letter alphabet. This allows us to define a compacted version of the automaton, that we use to prove that ev…

Discrete mathematicsKolakoski wordGeneral Computer ScienceC∞-wordsPowerset constructionTimed automatonPushdown automatonBüchi automatonComputer Science - Formal Languages and Automata TheoryComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)68R15AutomataTheoretical Computer ScienceCombinatoricsForbidden wordsDeterministic automatonProbabilistic automatonTwo-way deterministic finite automatonNondeterministic finite automatonC∞ -wordForbidden wordComputer Science::Formal Languages and Automata TheoryComputer Science(all)Computer Science - Discrete MathematicsMathematicsTheoretical Computer Science
researchProduct

Quantum Finite Automata and Logics

2006

The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.

Discrete mathematicsLindström quantifierNested wordAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Computational ComplexityComputer Science::Digital LibrariesAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESMonoidal t-norm logicComputer Science::Programming LanguagesQuantum finite automataEquivalence (formal languages)T-norm fuzzy logicsComputer Science::Formal Languages and Automata TheoryAND gateMathematics
researchProduct

The Phagocyte Lattice of Dyck Words

2006

We introduce a new lattice structure on Dyck words. We exhibit efficient algorithms to compute meets and joins of Dyck words.

Discrete mathematicsMathematics::CombinatoricsAlgebra and Number TheoryNoncrossing partitionEfficient algorithm010102 general mathematicsJoinsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences01 natural sciences[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]CombinatoricsComputational Theory and Mathematics010201 computation theory & mathematicsLattice (order)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Geometry and Topology0101 mathematicsComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUSMathematics
researchProduct

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

2007

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.

Discrete mathematicsNested wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technologyComputer Science::Computational Complexityω-automaton01 natural sciencesDeterministic pushdown automatonDeterministic finite automatonRegular language010201 computation theory & mathematicsProbabilistic automaton0202 electrical engineering electronic engineering information engineeringComputer Science::Programming LanguagesQuantum finite automata020201 artificial intelligence & image processingNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Probabilities to Accept Languages by Quantum Finite Automata

1999

We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.

Discrete mathematicsTheoretical computer scienceNested wordFinite-state machineHierarchy (mathematics)Computer scienceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Turing machinesymbols.namesakeNonlinear Sciences::Exactly Solvable and Integrable SystemsRegular languageProbabilistic automatonAnalytical hierarchysymbolsComputer Science::Programming LanguagesQuantum finite automataQuantum algorithmNondeterministic finite automaton
researchProduct

Finite State Transducers with Intuition

2010

Finite automata that take advice have been studied from the point of view of what is the amount of advice needed to recognize nonregular languages. It turns out that there can be at least two different types of advice. In this paper we concentrate on cases when the given advice contains zero information about the input word and the language to be recognized. Nonetheless some nonregular languages can be recognized in this way. The help-word is merely a sufficiently long word with nearly maximum Kolmogorov complexity. Moreover, any sufficiently long word with nearly maximum Kolmogorov complexity can serve as a help-word. Finite automata with such help can recognize languages not recognizable …

Discrete mathematicsTheoretical computer scienceNested wordKolmogorov complexityComputer scienceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonKolmogorov structure functionProbabilistic automatonQuantum finite automataNondeterministic finite automatonComputer Science::Formal Languages and Automata Theory
researchProduct

Size of Quantum Finite State Transducers

2007

Sizes of quantum and deterministic finite state transducers are compared in the case when both quantum and deterministic finite state transducers exist. The difference in size may be exponential.

Discrete mathematicsTransducerComputer Science::SoundMathematical analysisComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Finite stateQuantumComputer Science::Formal Languages and Automata TheoryMathematicsExponential function
researchProduct

A Metric for Automatic Word categorization

2008

This paper presents a metric to be used by the working prototype WIH (Web Intelligent Handler). This metric (referred here as po) is designed to reflect main topic words and discriminate certain text profiles through word weightings. The actual version is designed only for Spanish web texts. Statistical analyses show that it is possible to differentiate text profiles upon po behavior. A poll is presented also, showing that it is a good main words discriminator. This paper is posted here as a new algorithm useful for Spanish text processing.

DiscriminatorComputer sciencebusiness.industryPart of speechcomputer.software_genreText processingCategorizationStatistical analysesMetric (mathematics)Artificial intelligenceComputational linguisticsbusinesscomputerWord (computer architecture)Natural language processing
researchProduct

Medical Academic Speech. A Corpus-based Investigation of Same-Speaker Most Frequent Content Key Word Repetition in Non-Native English Discourse

2016

Studies on repetition in ELF interactions have been carried out in several domains, but medical academic discourse still remains under-researched. This paper explores same-speaker repetition in a 31,153-word corpus of lectures included in the 100,135-word medical section of the 1 million-word ELFA (English as a Lingua Franca in Academic Settings) corpus. More specifi cally, the corpus was searched for the most frequent same-speaker content key word repetition and corresponding functions, with both immediate and delayed repetition being scrutinized. The results confi rmed the initial hypothesis according to which same-speaker repetition was expected to be pervasive in the data, not only as a…

ELFA corpus.same-speaker repetitionEnglish as a lingua francaMedical academic speechMedical academic speech; same-speaker repetition; English as a lingua franca; ELFA corpus.Settore L-LIN/12 - Lingua E Traduzione - Lingua Inglese
researchProduct

Integrating Computational Linguistic Analysis of Multilingual Learning Data and Educational Measurement Approaches to Explore Learning in Higher Educ…

2017

This chapter develops a computational linguistic model for analyzing and comparing multilingual data as well as its application to a large body of standardized assessment data from higher education. The approach employs both an automatic and a manual annotation of the data on several linguistic layers (including parts of speech, text structure and content). Quantitative features of the textual data are explored that are related to both the students’ (domain-specific knowledge) test results and their level of academic experience. The respective analysis involves statistics of distance correlation, text categorization with respect to text types (questions and response options) as well as lang…

Educational measurementHigher educationbusiness.industryComputer scienceStandardized testPart of speechcomputer.software_genrelanguage.human_languageTest (assessment)GermanDistance correlationlanguageText typesArtificial intelligencebusinesscomputerNatural language processing
researchProduct