Search results for "speech"

showing 10 items of 1281 documents

Minimal Absent Words in Rooted and Unrooted Trees

2019

We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.

Polynomial (hyperelastic model)050101 languages & linguistics05 social sciencesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)02 engineering and technologyCombinatoricsTree (descriptive set theory)CardinalityInteger0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0501 psychology and cognitive sciencesAlphabetMinimal Absent Words Rooted trees Unrooted Trees AlgorithmsNonlinear Sciences::Pattern Formation and SolitonsComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

On the Size Complexity of Deterministic Frequency Automata

2013

Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…

Powerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesCombinatoricsDeterministic pushdown automatonDeterministic finite automatonDeterministic automatonComputer Science::Programming LanguagesQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

The implicit in "In search of lost ime"‎ : study on an aspect of proustien speech

2013

The implicit is defined as content present in speech without being formally expressed. Presupposition and implied content are the two fundamental elements of this concept. They act as information implied in speech whose essence the speaker can grasp or decrypt using the theories of pragmatics and enunciative linguistics. Proustian speech constitutes a remarkable example of the use of the implicit and its concepts. The present work is entirely devoted to the search for the implicit in Proust’s In Search of Lost Time. In our work, the development of this concept emerges especially in the verbal interaction between Proust's characters, also, through the speech of the narrator who opts for a ne…

PragmaticVerbal interaction[SHS.LITT]Humanities and Social Sciences/LiteratureFaits prosodiquesImpliciteÉnonciationImpliedPrésupposé[SHS.LITT] Humanities and Social Sciences/LiteratureGestureSpeechImplicit illocutionary forceForce illocutoire implicite[SHS.LANGUE]Humanities and Social Sciences/Linguistics[ SHS.LITT ] Humanities and Social Sciences/LiteraturePragmatique[SHS.LANGUE] Humanities and Social Sciences/LinguisticsSous-entenduEnunciationDiscours[ SHS.LANGUE ] Humanities and Social Sciences/LinguisticsInteraction verbaleGestePresuppositionImplicitProsodic facts
researchProduct

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Prefix codeDiscrete mathematicsClass (set theory)Group (mathematics)010102 general mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciencesPermutation group16. Peace & justice01 natural sciencesTransformation (music)Theoretical Computer SciencePrefixTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsArithmeticComputer Science::Formal Languages and Automata Theory[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]MathematicsEuropean Journal of Combinatorics
researchProduct

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

PrefixCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsUnique factorization domainComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Square-free integerComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (computer architecture)Mathematics
researchProduct

Does the mastery of center-embedded linguistic structures distinguish humans from nonhuman primates?

2005

In a recentScience article, Fitch and Hauser (2004; hereafter, F&H) claimed to have demonstrated that cotton-top tamarins fail to learn an artificial language produced by a phrase structure grammar (Chomsky, 1957) generating center-embedded sentences, whereas adult humans easily learn such a language. We report an experiment replicating the results of F&H in humans but also showing that subjects learned the language without exploiting in any way the center-embedded structure. When the procedure was modified to make the processing of this structure mandatory, the subjects no longer showed evidence of learning. We propose a simple interpretation for the difference in performance observed in F…

PrimatesStructure (mathematical logic)HierarchyInterpretation (logic)Grammarmedia_common.quotation_subjectAptitudeLinguisticsRecognition PsychologyExperimental and Cognitive PsychologyLinguisticsTask (project management)Constructed languageCognitionArts and Humanities (miscellaneous)Rule-based machine translationSpeech PerceptionDevelopmental and Educational PsychologyAnimalsHumansLearningPhrase structure grammarPsychologymedia_commonPsychonomic Bulletin & Review
researchProduct

Modeling Marginalization: Emergence, Social Physics, and Social Ethics of Bullying

2020

In this paper, we outline the construction and initial simulation experiment results of the Marginalization model (MARG). We experiment under different group parameters because the theoretical paradigm we follow views bullying as a result of social processes. Our primary research question explores the possibility of bullying emergence as agents select interaction partners in a university setting. Based on the simulated process, our results take indications of the stress of marginalization in a student group as a proxy for emer-gent marginalization. MARG simulates two types of interactions between pairs of students: forced and hang-out interactions. In the latter, students decide whether to …

Process (engineering)05 social sciencesPsychological interventionSocial ethic050301 educationmarginalizationVDP::Technology: 500::Information and communication technology: 550social simulationethics030507 speech-language pathology & audiology03 medical and health sciencesSocial processesCultural diversitybullyingSocial physics0305 other medical sciencePsychology0503 educationSocial psychologyPrimary researchStudent group
researchProduct

Spoken conversational context improves query auto-completion in web search

2021

Web searches often originate from conversations in which people engage before they perform a search. Therefore, conversations can be a valuable source of context with which to support the search process. We investigate whether spoken input from conversations can be used as a context to improve query auto-completion. We model the temporal dynamics of the spoken conversational context preceding queries and use these models to re-rank the query auto-completion suggestions. Data were collected from a controlled experiment and comprised conversations among 12 participant pairs conversing about movies or traveling. Search query logs during the conversations were recorded and temporally associated…

Process (engineering)Computer scienceContext (language use)02 engineering and technologycomputer.software_genreSpeech input020204 information systems0202 electrical engineering electronic engineering information engineeringQuery auto-completionControlled experimentControl (linguistics)Background speechContextualizationWeb search querySettore INF/01 - Informaticabusiness.industrySpeech inputGeneral Business Management and AccountingQACComputer Science ApplicationsDynamics (music)Voice020201 artificial intelligence & image processingArtificial intelligencebusinesscomputerNatural language processingInformation Systems
researchProduct

Do Transposed-Letter Similarity Effects Occur at a Syllable Level?

2006

One key issue for any computational model of visual word recognition is the choice of an input coding scheme for assigning letter position. Recent research has shown that transposed-letter similarity effects occur even when the transposed letters are not adjacent (caniso- casino; Perea & Lupker, 2004 , JML). In the present study we conducted two single-presentation lexical decision experiments to examine whether transposed-letter effects occur at a syllable level. We tested two types of nonwords: (1) nonwords created by transposing two internal CV syllables (PRIVEMARA; the base word is primavera, the Spanish for spring) and (2) nonwords created by transposing two adjacent bigrams that …

PsycholinguisticsBigramSpeech recognitionDecision MakingOrthographic projectionExperimental and Cognitive PsychologyPhoneticsGeneral MedicinePsycholinguisticsLinguisticsSemanticsDiscrimination LearningReadingArts and Humanities (miscellaneous)PhoneticsWord recognitionReaction TimeLexical decision taskHumansAttentionDiscrimination learningComprehensionGeneral PsychologyMathematicsCoding (social sciences)Experimental Psychology
researchProduct

Slipshod utterances : a study of mislanguage

1992

PsycholinguisticsSpeech errorspsykolingvistiikkavirheetkielivirheetlukihäiriötpuhe
researchProduct