Search results for "Anagram"
showing 7 items of 7 documents
El papel de la sílaba en la codificación posicional de las representaciones ortográficas
2012
El objetivo de este trabajo consiste en estudiar si la posición de las letras se codifica de una forma absoluta o relativa, y en particular, conocer el papel que la sílaba juega en la codificación de la información posicional dentro de las representaciones ortográficas. Para ello, empleamos dos experimentos con una tarea de solución de anagramas. En dicha tarea, se presenta un anagrama (CSIAGTO) y el participante tiene que descubrir la palabra que se forma ordenando las letras internas del anagrama (CASTIGO). Los resultados del Experimento 1 muestran un efecto de la presencia de bigramas adyacentes: los anagramas que mantienen un bigrama en una posición adyacente (CTGASIO) son resueltos con…
Verbal-autonomic response dissociations as traits?
2005
Dissociations between subjective and physiological responses to stress are of central interest in coping research. However, little is known about their stability across situations and time. Two experimental sessions - separated by 1 year - were conducted to examine cross-situational consistency and longterm-stability of HR-derived and SCL-derived dissociation scores. In year 1, a speech stressor, the cold pressor and a video stressor (viewing of the speech video) were applied. In year 2, mental arithmetics, anagrams and a torture video were presented. Thirty-five students participated and HR, SCL and negative affect were recorded. For each stressor, standardized changes in negative affect w…
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
2010
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the text s requires to find a substring t of s with p(t) = q. The corresponding decision problem is to verify whether at least one such match exists. So, for example for the alphabet Σ = {a, b, c}, the string s = abaccbabaaa has Parikh vector p(s) = (6,3,2), and the Parikh vector q = (2,1,1) appears once in s in position (1,4). Like its more precise counterpart, the renown Exact String Matching, Jumbled Pattern Matching has ubiquitous applications, e.g., string matching with a dyslectic word processor, table rearrangements, …
A New Reliable and Valid Tool for Measuring Implicit Self-Esteem
2012
We investigated the reliability and predictive validity of a new response-window affective priming task (RW-APT) for the measurement of implicit self-esteem. Participants (N = 96) were administered the self-esteem RW-APT and filled out two measures of explicit self-esteem. To investigate the effect of explicit and implicit self-esteem on reactions to failure, we applied an anagram task in which participants received anagrams that were more difficult than expected. Three self-esteem criteria were obtained: pretask expectancy bias, perceived performance bias, and posttask expectancy bias. As hypothesized, explicit self-esteem and implicit self-esteem measures independently predicted all vali…
Vakavan sanaleikin mahdollisuudet kotimaisen nykyrunouden anagrammeissa ja spoonerismeissa
2022
Artikkeli pyrkii tunnistamaan ja analysoimaan sanaleikkejä sellaisena kuin ne näyttäytyvät kotimaisessa nykyrunoudessa, sekä etsimään kirjallisia syitä niiden käyttöön. Fokuksessa ovat kirjain- ja äänneperustaiset sanaleikit. Artikkelissa keskitytään anagrammiin (kirjainten järjestyksen vaihdokset), paragrammiin (kirjainmuunnokset, -virheet) ja spoonerismiin (sananmuunnokset) ja rinnastetaan niitä sellaisiin sukulaisilmiöihin kuin palindromi (kirjaimistoltaan symmetriset tekstit), paronomasia (monimerkityksinen sanaleikki), tai neologismit (uudissanat). Siinä missä arkipuheessa sanaleikit pyrkivät kuulijan (yleensä alatyyliseen) huvittamiseen, mainonnassa tiiviiseen itseironiaan, artikkelin…
Words with the Maximum Number of Abelian Squares
2015
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.
Apmācību rīks bērniem
2017
Apmācību rīks bērniem ir paredzēt ar mērķi attīstīt bērnu domāšanu un reakcijas ātrumu. Rīks piemērots, lai bērns patstāvīgi spētu uzlabot skolā iegūtās zināšanas un attīstīt izzinātos skaitļus un burtus. Moderno tehnoloģiju laikā ir būtiski atvieglots bērnu pašizzināšanās un pašizglītošanās process, līdz ar to, šis rīks var kalpot par lielisku veidu, kā uzlabot savas zināšanas arī ārpus skolas laika, atvieglojot turpmāko mācību procesu.