Results for 'Phonologically minimal pairs'

1000+ found
Order:
  1.  6
    Asymmetries in Accessing Vowel Representations Are Driven by Phonological and Acoustic Properties: Neural and Behavioral Evidence From Natural German Minimal Pairs.Miriam Riedinger, Arne Nagels, Alexander Werth & Mathias Scharinger - 2021 - Frontiers in Human Neuroscience 15.
    In vowel discrimination, commonly found discrimination patterns are directional asymmetries where discrimination is faster if differing vowels are presented in a certain sequence compared to the reversed sequence. Different models of speech sound processing try to account for these asymmetries based on either phonetic or phonological properties. In this study, we tested and compared two of those often-discussed models, namely the Featurally Underspecified Lexicon model and the Natural Referent Vowel framework. While most studies presented isolated vowels, we investigated a large (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  34
    Cross‐Situational Learning of Minimal Word Pairs.Paola Escudero, Karen E. Mulak & Haley A. Vlach - 2016 - Cognitive Science 40 (2):455-465.
    Cross-situational statistical learning of words involves tracking co-occurrences of auditory words and objects across time to infer word-referent mappings. Previous research has demonstrated that learners can infer referents across sets of very phonologically distinct words, but it remains unknown whether learners can encode fine phonological differences during cross-situational statistical learning. This study examined learners’ cross-situational statistical learning of minimal pairs that differed on one consonant segment, minimal pairs that differed on one vowel segment, and non- (...) pairs that differed on two or three segments. Learners performed above chance for all pairs, but performed worse on vowel minimal pairs than on consonant minimal pairs or non-minimal pairs. These findings demonstrate that learners can encode fine phonetic detail while tracking word-referent co-occurrence probabilities, but they suggest that phonological encoding may be weaker for vowels than for consonants. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  22
    Phonological status of interdental phones / in the Mapudungun spoken in the coastal area, Budi, Araucanía Region, Chile.Juan Héctor Painequeo Paillán, Gastón F. Salamanca Gutiérrez & Manuel Jesús Jiménez Mardones - 2018 - Alpha (Osorno) 46:111-128.
    Resumen Este artículo se ocupa del estatus fonético-fonológico de las consonantes interdentales, en el Mapudungun hablado en el sector costa de isla Huapi, IX Región de La Araucanía. Después del análisis de pares mínimos, cuantificación de los segmentos interdentales versus alveolares, y la consciencia fonológica de los hablantes encuestados, se pudo concluir la vigencia de estos segmentos en tanto fonos y en tanto fonemas. Es decir, en esta zona son fonemas.This article deals with the phonetic-phonological status of the interdental consonants (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  50
    A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
  5.  20
    A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
    A computably enumerable degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree x below a is cuppable. Let NB and PC be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both NB and PC are well understood, but it has not been possible so far to distinguish between the two classes. In the present paper, we investigate the relationship between the classes NB and PC, and show (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  19
    Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
  7.  35
    Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
  8. On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
  9.  20
    Minimal paired-associate learning.Lloyd R. Peterson & Margaret Jean Peterson - 1962 - Journal of Experimental Psychology 63 (6):521.
  10.  21
    A minimal pair in the generic degrees.Denis R. Hirschfeldt - 2020 - Journal of Symbolic Logic 85 (1):531-537.
    We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  10
    Minimal paired-associate learning.Lloyd R. Peterson & Kenneth P. Hillner - 1964 - Journal of Experimental Psychology 67 (3):300.
  12.  41
    A Minimal Pair of Π0 1 Classes.Carl G. Jockusch Jr & Robert I. Soare - 1971 - Journal of Symbolic Logic 36 (1):66 - 78.
  13.  17
    A minimal pair of Π1 0 classes.Carl G. Jockusch & Robert I. Soare - 1971 - Journal of Symbolic Logic 36 (1):66-78.
  14.  60
    Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
  15.  13
    Nonexistence of minimal pairs for generic computability.Gregory Igusa - 2013 - Journal of Symbolic Logic 78 (2):511-522.
    A generic computation of a subset $A$ of $\mathbb{N}$ consists of a computation that correctly computes most of the bits of $A$, and never incorrectly computes any bits of $A$, but which does not necessarily give an answer for every input. The motivation for this concept comes from group theory and complexity theory, but the purely recursion theoretic analysis proves to be interesting, and often counterintuitive. The primary result of this paper is that there are no minimal pairs (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  16.  53
    Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
    We show that every nonzero $\Delta _{2}^{0}$ e-degree bounds a minimal pair. On the other hand, there exist $\Sigma _{2}^{0}$ e-degrees which bound no minimal pair.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  17.  14
    Bounding and nonbounding minimal pairs in the enumeration degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741-766.
    We show that every nonzero Δ20, e-degree bounds a minimal pair. On the other hand, there exist Σ20, e-degrees which bound no minimal pair.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  7
    Some More Minimal Pairs of α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
  19.  31
    Some More Minimal Pairs of α-Recursively Enumerable Degrees.Richard A. Shore - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):409-418.
  20.  52
    Least upper bounds for minimal pairs of α-R.E. α-degrees.Manuel Lerman - 1974 - Journal of Symbolic Logic 39 (1):49-56.
  21.  70
    On the existence of a strong minimal pair.George Barmpalias, Mingzhong Cai, Steffen Lempp & Theodore A. Slaman - 2015 - Journal of Mathematical Logic 15 (1):1550003.
    We show that there is a strong minimal pair in the computably enumerable Turing degrees, i.e. a pair of nonzero c.e. degrees a and b such that a∩b = 0 and for any nonzero c.e. degree x ≤ a, b ∪ x ≥ a.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  31
    C. E. M. Yates. A minimal pair of recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 159–168.Robert W. Robinson - 1972 - Journal of Symbolic Logic 37 (3):611.
  23.  13
    On Splitting of a Recursive Set with Polynomial Time Minimal Pairs.Chen Zhixiang - 1989 - Mathematical Logic Quarterly 35 (5):423-432.
  24.  26
    On Splitting of a Recursive Set with Polynomial Time Minimal Pairs.Chen Zhixiang - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (5):423-432.
  25.  7
    Music Perception Abilities and Ambiguous Word Learning: Is There Cross-Domain Transfer in Nonmusicians?Eline A. Smit, Andrew J. Milne & Paola Escudero - 2022 - Frontiers in Psychology 13:801263.
    Perception of music and speech is based on similar auditory skills, and it is often suggested that those with enhanced music perception skills may perceive and learn novel words more easily. The current study tested whether music perception abilities are associated with novel word learning in an ambiguous learning scenario. Using a cross-situational word learning (CSWL) task, nonmusician adults were exposed to word-object pairings between eight novel words and visual referents. Novel words were either non-minimal pairs differing in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  50
    Minimal indirect reference: a theory of the syntax-phonology interface.Amanda Seidl - 2001 - New York: Routledge.
    This book investigates the nature of the relationship between phonology and syntax and proposes a theory of Minimal Indirect Reference that solves many classic problems relating to the topic. Seidl shows that all variation across languages in phonological domain size is due to syntactic differences and a single domain parameter specific to phonology.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  27
    Learning to perceive and recognize a second language: the L2LP model revised.Jan-Willem Van Leussen & Paola Escudero - 2015 - Frontiers in Psychology 6:103694.
    We present a test of a revised version of the Second Language Linguistic Perception (L2LP) model, a computational model of the acquisition of second language (L2) speech perception and recognition. The model draws on phonetic, phonological and psycholinguistic constructs to explain a number of L2 learning scenarios. However, a recent computational implementation failed to validate a theoretical proposal for a learning scenario where the L2 has less phonemic categories than the native language (L1) along a given acoustic continuum. According to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28.  10
    Review: C. E. M. Yates, A Minimal Pair of Recursively Enumerable Degrees. [REVIEW]Robert W. Robinson - 1972 - Journal of Symbolic Logic 37 (3):611-611.
  29.  50
    The minimal unit of phonological encoding: prosodic or lexical word.Linda R. Wheeldon & Aditi Lahiri - 2002 - Cognition 85 (2):B31-B41.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  8
    The own-voice benefit for word recognition in early bilinguals.Sarah Cheung & Molly Babel - 2022 - Frontiers in Psychology 13.
    The current study examines the self-voice benefit in an early bilingual population. Female Cantonese–English bilinguals produced words containing Cantonese contrasts. A subset of these minimal pairs was selected as stimuli for a perception task. Speakers’ productions were grouped according to how acoustically contrastive their pronunciation of each minimal pair was and these groupings were used to design personalized experiments for each participant, featuring their own voice and the voices of others’ similarly-contrastive tokens. The perception task was a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  14
    Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.
  32.  27
    Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):331-342.
    Direct download  
     
    Export citation  
     
    Bookmark  
  33. Pairs of O-minimal structures.Y. Baisalov & B. Poizat - 1998 - Journal of Symbolic Logic 63 (2):570-578.
  34.  62
    Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
    Let T be a complete O-minimal theory in a language L. We first give an elementary proof of the result (due to Marker and Steinhorn) that all types over Dedekind complete models of T are definable. Let L * be L together with a unary predicate P. Let T * be the L * -theory of all pairs (N, M), where M is a Dedekind complete model of T and N is an |M| + -saturated elementary extension of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35.  16
    Exact Pairs for Abstract Bounded Reducibilities.Wolfgang Merkle - 1999 - Mathematical Logic Quarterly 45 (3):343-360.
    In an attempt to give a unified account of common properties of various resource bounded reducibilities, we introduce conditions on a binary relation ≤r between subsets of the natural numbers, where ≤r is meant as a resource bounded reducibility. The conditions are a formalization of basic features shared by most resource bounded reducibilities which can be found in the literature. As our main technical result, we show that these conditions imply a result about exact pairs which has been previously (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  36.  29
    Retroactive facilitation in short-term retention of minimally learned paired associates.Darryl Bruce & George E. Weaver - 1973 - Journal of Experimental Psychology 100 (1):9.
  37. Minimal Cooperation and Group Roles.Katherine Ritchie - 2020 - In Anika Fiebich (ed.), Minimal Cooperation and Shared Agency.
    Cooperation has been analyzed primarily in the context of theories of collective intentionality. These discussions have primarily focused on interactions between pairs or small groups of agents who know one another personally. Cooperative game theory has also been used to argue for a form of cooperation in large unorganized groups. Here I consider a form of minimal cooperation that can arise among members of potentially large organized groups (e.g., corporate teams, committees, governmental bodies). I argue that members of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Pair-splitting, pair-reaping and cardinal invariants of F σ -ideals.Michael Hrušák, David Meza-Alcántara & Hiroaki Minami - 2010 - Journal of Symbolic Logic 75 (2):661-677.
    We investigate the pair-splitting number $\germ{s}_{pair}$ which is a variation of splitting number, pair-reaping number $\germ{r}_{pair}$ which is a variation of reaping number and cardinal invariants of ideals on ω. We also study cardinal invariants of F σ ideals and their upper bounds and lower bounds. As an application, we answer a question of S. Solecki by showing that the ideal of finitely chromatic graphs is not locally Katětov-minimal among ideals not satisfying Fatou's lemma.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  39. Phonology.Lorenzo Peña - unknown
    Phonemes are minimal segments within the spoken message whose presence is relevant for distinguishing one message from a different one with another meaning. Each phoneme underlies different phonetic realizations. What sets a phoneme from another is fuzzy cluster of the fuzzy features. Thus the study of phonemic structures is likely to have much to gain from a gradualistic approach. Through a gradualistic treatment synchronic phonology could tally with the diachronic study in a simpler way than is customary. In this (...)
     
    Export citation  
     
    Bookmark  
  40.  26
    Phonological distinctive features as cues in learning.James J. Jenkins, Donald J. Foss & Joseph H. Greenberg - 1968 - Journal of Experimental Psychology 77 (2):200.
  41. Cross‐Situational Learning of Phonologically Overlapping Words Across Degrees of Ambiguity.Karen E. Mulak, Haley A. Vlach & Paola Escudero - 2019 - Cognitive Science 43 (5):e12731.
    Cross‐situational word learning (XSWL) tasks present multiple words and candidate referents within a learning trial such that word–referent pairings can be inferred only across trials. Adults encode fine phonological detail when two words and candidate referents are presented in each learning trial (2 × 2 scenario; Escudero, Mulak, & Vlach, ). To test the relationship between XSWL task difficulty and phonological encoding, we examined XSWL of words differing by one vowel or consonant across degrees of within‐learning trial ambiguity (1 × (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  42.  18
    Pairing and sharing: The birth of the sense of us.Stefano Vincini - 2021 - Phenomenology and the Cognitive Sciences:1-24.
    The goal of this paper is to show that a particular view of emotion sharing and a specific hypothesis on infant social perception strengthen each other. The view of emotion sharing is called “the straightforward view.” The hypothesis on infant social perception is called “the pairing account.” The straightforward view suggests that participants in emotion sharing undergo one and the same overarching emotion. The pairing account posits that infants perceive others’ embodied experiences as belonging to someone other than the self (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  43.  24
    Dependent pairs.Ayhan Günaydin & Philipp Hieronymi - 2011 - Journal of Symbolic Logic 76 (2):377 - 390.
    We prove that certain pairs of ordered structures are dependent. Among these structures are dense and tame pairs of o-minimal structures and further the real field with a multiplicative subgroup with the Mann property, regardless of whether it is dense or discrete.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  44.  24
    Generic pairs of SU-rank 1 structures.Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 120 (1-3):103-149.
    For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  45.  38
    Grouplike minimal sets in ACFA and in T A.Alice Medvedev - 2010 - Journal of Symbolic Logic 75 (4):1462-1488.
    This paper began as a generalization of a part of the author's PhD thesis about ACFA and ended up with a characterization of groups definable in T A . The thesis concerns minimal formulae of the form x ∈ A ∧ σ(x) = f(x) for an algebraic curve A and a dominant rational function f: A → σ(A). These are shown to be uniform in the Zilber trichotomy, and the pairs (A, f) that fall into each of the (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark  
  46.  52
    On lovely pairs of geometric structures.Alexander Berenstein & Evgueni Vassiliev - 2010 - Annals of Pure and Applied Logic 161 (7):866-878.
    We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We use the pairs to isolate a class of geometric structures called weakly locally modular which generalizes the class of linear structures in the settings of SU-rank one theories and o-minimal theories. For o-minimal theories, we use the Peterzil–Starchenko trichotomy theorem to characterize for a sufficiently general point, the local geometry around it in terms of the thorn U-rank of its type (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  47.  18
    Dimensions, matroids, and dense pairs of first-order structures.Antongiulio Fornasiero - 2011 - Annals of Pure and Applied Logic 162 (7):514-543.
    A structure M is pregeometric if the algebraic closure is a pregeometry in all structures elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of Lascar U-rank a power of ω and d-minimal expansion of fields. Ultraproducts of pregeometric structures expanding an integral domain, while not pregeometric in general, do have a unique existential matroid. Generalising previous results by van den Dries, we define dense elementary pairs of structures (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  48.  19
    The Emergence of Discrete Perceptual-Motor Units in a Production Model That Assumes Holistic Phonological Representations.Maya Davis & Melissa A. Redford - 2019 - Frontiers in Psychology 10:468824.
    Intelligible speakers achieve specific vocal tract constrictions in rapid sequence. These constrictions are associated in theory with speech motor goals. Adult-focused models of speech production assume that discrete phonological representations, sequenced into word-length plans for output, define these goals. This assumption introduces a serial order problem for speech. It is also at odds with children's speech. In particular, child phonology and timing control suggest holistic speech plans, and so the hypothesis of whole word production. This hypothesis solves the serial order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  27
    A theory of pairs for non-valuational structures.Elitzur Bar-Yehuda, Assaf Hasson & Ya’Acov Peterzil - 2019 - Journal of Symbolic Logic 84 (2):664-683.
    Given a weakly o-minimal structure${\cal M}$and its o-minimal completion$\bar{{\cal M}}$, we first associate to$\bar{{\cal M}}$a canonical language and then prove thatTh$\left$determines$Th\left$. We then investigate the theory of the pair$\left$in the spirit of the theory of dense pairs of o-minimal structures, and prove, among other results, that it is near model complete, and every definable open subset of${\bar{M}^n}$is already definable in$\bar{{\cal M}}$.We give an example of a weakly o-minimal structure interpreting$\bar{{\cal M}}$and show that it is not (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  16
    On pseudolinearity and generic pairs.Evgueni Vassiliev - 2010 - Mathematical Logic Quarterly 56 (1):35-41.
    We continue the study of the connection between the “geometric” properties of SU -rank 1 structures and the properties of “generic” pairs of such structures, started in [8]. In particular, we show that the SU-rank of the theory of generic pairs of models of an SU -rank 1 theory T can only take values 1 , 2 or ω, generalizing the corresponding results for a strongly minimal T in [3]. We also use pairs to derive the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000