• Title/Summary/Keyword: Minimal pair

Search Result 50, Processing Time 0.022 seconds

A quantitative study on the minimal pair of Korean phonemes: Focused on syllable-initial consonants (한국어 음소 최소대립쌍의 계량언어학적 연구: 초성 자음을 중심으로)

  • Jung, Jieun
    • Phonetics and Speech Sciences
    • /
    • v.11 no.1
    • /
    • pp.29-40
    • /
    • 2019
  • The paper investigates the minimal pair of Korean phonemes quantitatively. To achieve this goal, I calculated the number of consonant minimal pairs in the syllable-initial position as both raw counts and relative counts, and analyzed the part of speech relations of the two words in the minimal pair. "Urimalsaem" was chosen as the object of this study because it was judged that the minimal pair analysis should be done through a dictionary and it is the largest among Korean dictionaries. The results of the study are summarized as follows. First, there were 153 types of minimal pairs out of 337,135 examples. The ranking of phoneme pairs from highest to lowest was 'ㅅ-ㅈ, ㄱ-ㅅ, ㄱ-ㅈ, ㄱ-ㅂ, ㄱ-ㅎ, ${\ldots}$, ㅆ-ㅋ, ㄸ-ㅋ, ㅉ-ㅋ, ㄹ-ㅃ, ㅃ-ㅋ'. The phonemes that played a major role in the formation of the minimal pair were /ㄱ, ㅅ, ㅈ, ㅂ, ㅊ/, in that order, which showed a high proportion of palatals. The correlation between the raw count of minimal pairs and the relative count of minimal pairs was found to be quite high r=0.937. Second, 87.91% of the minimal pairs shared the part of speech (same syntactic category). The most frequently observed type has been 'noun-noun' pair (70.25%), and 'vowel-vowel' pair (14.77%) was the next ranking. It can be indicated that the minimal pair could be grouped into similar categories in terms of semantics. The results of this study can be useful for various research in Korean linguistics, speech-language pathology, language education, language acquisition, speech synthesis, and artificial intelligence-machine learning as basic data related to Korean phonemes.

MINIMAL SURFACE SYSTEM IN EUCLIDEAN FOUR-SPACE

  • Hojoo Lee
    • Journal of the Korean Mathematical Society
    • /
    • v.60 no.1
    • /
    • pp.71-90
    • /
    • 2023
  • We construct generalized Cauchy-Riemann equations of the first order for a pair of two ℝ-valued functions to deform a minimal graph in ℝ3 to the one parameter family of the two dimensional minimal graphs in ℝ4. We construct the two parameter family of minimal graphs in ℝ4, which include catenoids, helicoids, planes in ℝ3, and complex logarithmic graphs in ℂ2. We present higher codimensional generalizations of Scherk's periodic minimal surfaces.

A minimal pair searching tool based on dictionary (사전 기반 최소대립쌍 검색 도구)

  • Kim, Tae-Hoon;Lee, Jae-Ho;Chang, Moon-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.2
    • /
    • pp.117-122
    • /
    • 2014
  • The minimal pairs mean the pairs that have same phonotactics except just one sound in the sequences cause different lexical items. This paper proposes the searching tool of minimal pairs for efficiency of phonological researches with minimal pairs. We suggest a guide to develop Korean minimal pair searching programs by comparing to other programs. Proposing tool has user-friendly interface, minimizing key inputs, for linguistics who are not fluent in computer programs. And it serves the function which classifies the words in dictionary for the detailed researches. And for efficiency, it increases speed of dictionary loading by separating syllables through Unicode analysis, and optimizes dictionary structure for searching efficiency. The searching algorithm gains in speed by hashing algorithm using syllable counts. In our tool, the speed is improved more than earlier version about 5 times at converting dictionary and about 3 times at searching.

The Interlanguage Speech Intelligibility Benefit for Listeners (ISIB-L): The Case of English Liquids

  • Lee, Joo-Kyeong;Xue, Xiaojiao
    • Phonetics and Speech Sciences
    • /
    • v.3 no.1
    • /
    • pp.51-65
    • /
    • 2011
  • This study attempts to investigate the interlanguage speech intelligibility benefit for listeners (ISIB-L), examining Chinese talkers' production of English liquids and its perception of native listeners and non-native Chinese and Korean listeners. An Accent Judgment Task was conducted to measure non-native talkers' and listeners' phonological proficiency, and two levels of proficiency groups (high and low) participated in the experiment. The English liquids /l/ and /r/ produced by Chinese talkers were considered in terms of positions (syllable initial and final), contexts (segment, word and sentence) and lexical density (minimal vs. nonminimal pair) to see if these factors play a role in ISIIB-L. Results showed that both matched and mismatched interlanguage speech intelligibility benefit for listeners occurred except for the initial /l/. Non-native Chinese and Korean listeners, though only with high proficiency, were more accurate at identifying initial /r/, final /l/ and final /r/, but initial /l/ was significantly more intelligible to native listeners than non-native listeners. There was evidence of contextual and lexical density effects on ISIB-L. No ISIB-L was demonstrated in sentence context, but both matched and mismatched ISIB-L was observed in word context; this finding held true for only high proficiency listeners. Listeners recognized the targets better in the non-minimal pair (sparse density) environment than the minimal pair (higher density) environment. These findings suggest that ISIB-L for English liquids is influenced by talkers' and listeners' proficiency, syllable position in association with L1 and L2 phonological structure, context, and word neighborhood density.

  • PDF

A Heuristic Algorithm for Minimal Area CMOS Cell Layout (최소 면적의 CMOS 기능셀 설계도면을 찾는 휴리스틱 알고리즘)

  • Kwon, Yong-Joon;Kyung, Chong-Min
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1463-1466
    • /
    • 1987
  • The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

  • PDF

A Study on the Reliability Evaluation of Communication Networks by Matrix Transformation (행열변현에 의한 통신망의 신뢰도 계정에 관한 연구)

  • 김영근;오영환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.13 no.5
    • /
    • pp.379-389
    • /
    • 1988
  • In this paper, an algorithm for obtaining 2-state switching failure function and a terminal pair reliability evaluation method in a communication network are proposed. The communication network is modeled by a graph. By using the sequence of matrix transformations for the graph, minimal cut-set matrix representing all minimal cut-sets which completely interrupt the communication path is determined and 2-state switching failure function is then obtained from the minimal cut-set matrix. The terminal pari reliability of the communication network is evaluated by corresponding the random variables to 2-state switching failure function. Illustrative examples are provided to demonstrate the algorithm. A computer program evaluating the terminal pair reliability in a complex and large network has also been developed.

  • PDF

A Visual Study of the Phonemic Awareness (음소인지에 관한 시각적 연구)

  • Park, Heesuk
    • Journal of Digital Contents Society
    • /
    • v.16 no.2
    • /
    • pp.219-225
    • /
    • 2015
  • This experimental study aims at understanding the Korean subjects' phonemic awareness in the English minimal pairs. For the purpose of the experiment, English listening comprehension tests were designed using minimal pairs and conducted among subjects, and the results of the tests were analyzed with the help of spectrogram. From the results of this study, I could find out three important things: First, subjects have difficulty in understanding and distinguishing English vowel minimal pairs. Second, among the English vowel minimal pairs, they had much difficulty in distinguishing between /ə:/ and /ɔ:/. Third, subjects could recognize the semivowel /w/ in words without any difficulty. In addition to this, I tried to analyze the results using the spectrogram, which helps to educate students effectively.

RESIDUALS IN MINIMAL RESOLUTION IV DESIGNS

  • Liau, Pen-Hwang
    • Journal of the Korean Statistical Society
    • /
    • v.32 no.3
    • /
    • pp.235-244
    • /
    • 2003
  • In unreplicated factorial or fractional factorial experiments, the presence of one or more outliers can seriously affect the analysis of variance. Using the normal plot of t residuals to identify outliers in factorial or fractional factorial is an easy method to find these dubious points. In some cases, the t residuals form the identical pairs. One can not tell from the plot which is doubtful. This phenomenon occurs for all minimal designs of resolution IV, which fits the model containing all main effects and some two-factor interactions, whether it is orthogonal or not. In these kinds of models, when we drop one point or two points (not foldover pair) from the fraction, the phenomenon of identical pairs of t residuals may still occur. In this paper, the theoretical background of the phenomenon and its sequences will be investigated in detail.

Coherence Analysis of Jaw and Neck Muscle Coordination during Chewing in Healthy Adults

  • Ho-Jun Song;Sang-Ho Han;Ji-Yeon Kim;Yeong-Gwan Im
    • Journal of Oral Medicine and Pain
    • /
    • v.48 no.4
    • /
    • pp.159-168
    • /
    • 2023
  • Purpose: Coordinated activity between the jaw and neck muscles is important in oral motor tasks such as chewing. This study examined coherence between the jaw and neck muscles during chewing in healthy adults. Methods: A total of 12 healthy adults underwent electromyography (EMG) of the jaw and neck muscles during right-sided chewing at a frequency of 1 Hz. Surface electrodes were placed over the temporalis (TA), masseter (MS), anterior digastric (DA), and sternocleidomastoid (SM) muscles on the right side. EMG signals were processed for coherence and phase analysis using advanced signal processing techniques. Results: The MS and TA muscle pair exhibited high synchronization when chewing (median coherence=0.992). Contrarily, the coherence values between the MS and DA, as well as the MS and SM muscle pairs, were relatively low (median coherence=0.848 and 0.957, respectively). Phase analysis revealed minimal temporal differences between the MS and TA muscle pair and the MS and SM muscle pair, whereas substantial phase shifts were observed between the MS and DA muscle pair. Conclusions: During chewing in healthy adults, the TA muscle works synergistically whereas the DA muscle antagonistically with the MS muscle, and the SM muscle supports the activity of the MS muscle. The observed synchrony and coordination provide insights into the intricate interplay among these muscles during oral motor tasks.

AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS

  • Ku, Cheng Yeaw;Wong, Kok Bin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.875-894
    • /
    • 2017
  • Let $[n]=\{1,2,{\ldots},n\}$. A set ${\mathbf{A}}=\{A_1,A_2,{\ldots},A_l\}$ is a minimal cover of [n] if ${\cup}_{1{\leq}i{\leq}l}A_i=[n]$ and $$\bigcup_{{1{\leq}i{\leq}l,}\\{i{\neq}j_0}}A_i{\neq}[n]\text{ for all }j_0{\in}[l]$$. Let ${\mathcal{C}}(n)$ denote the collection of all minimal covers of [n], and write $C_n={\mid}{\mathcal{C}}(n){\mid}$. Let ${\mathbf{A}}{\in}{\mathcal{C}}(n)$. An element $u{\in}[n]$ is critical in ${\mathbf{A}}$ if it appears exactly once in ${\mathbf{A}}$. Two minimal covers ${\mathbf{A}},{\mathbf{B}}{\in}{\mathcal{C}}(n)$ are said to be restricted t-intersecting if they share at least t sets each containing an element which is critical in both ${\mathbf{A}}$ and ${\mathbf{B}}$. A family ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is said to be restricted t-intersecting if every pair of distinct elements in ${\mathcal{A}}$ are restricted t-intersecting. In this paper, we prove that there exists a constant $n_0=n_0(t)$ depending on t, such that for all $n{\geq}n_0$, if ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is restricted t-intersecting, then ${\mid}{\mathcal{A}}{\mid}{\leq}{\mathcal{C}}_{n-t}$. Moreover, the bound is attained if and only if ${\mathcal{A}}$ is isomorphic to the family ${\mathcal{D}}_0(t)$ consisting of all minimal covers which contain the singleton parts $\{1\},{\ldots},\{t\}$. A similar result also holds for restricted r-cross intersecting families of minimal covers.