期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Intelligibility and Segmental Phoneme Repair Strategies in English-as-a-Lingua-Franca Interactions among Chinese and Japanese Speakers of English 被引量:1
1
作者 乔治.欧尼尔 《Chinese Journal of Applied Linguistics》 2016年第4期379-400,498,共23页
This is a qualitative study of the types of segmental repair that maintain mutual intelligibility in English-as-a-Lingua-Franca interactions among Chinese and Japanese speakers of English (Jenkins, 2000; Matsumoto 20... This is a qualitative study of the types of segmental repair that maintain mutual intelligibility in English-as-a-Lingua-Franca interactions among Chinese and Japanese speakers of English (Jenkins, 2000; Matsumoto 2011; O'Neal 2015a, 2015b, 2015c, 2015d, 2016, in press). Repair refers to a set of practices through which conversation participants stop the ongoing action to attend to actual or potential problems 1:o the maintenance of mutual intelligibility (Schegloff, 2007; N^meth, 2012). Although anything can potentially be a problem to the maintenance of mutual intelligibility, this study focuses only on instances of the repair of segmental phonemes so that the pronunciation remains mutually intelligible. Using conversation analytic methodology to examine a corpus of repair sequences concerning pronunciation among Chinese and Japanese students at a Japanese university, this study claims that three segmental repair strategies are used in the interactions to maintain mutually intelligible pronunciation: segmental phoneme modification, segmental phoneme insertion, and segmental phoneme deletion. 展开更多
关键词 segmental repair INTELLIGIBILITY English as a lingua franca (ELF) segmental phoneme insertion segmental phoneme deletion segmental phoneme modification
原文传递
Spanning 3-ended trees in k-connected K_(1,4)-free graphs 被引量:2
2
作者 CHEN Yuan CHEN GuanTao HU ZhiQuan 《Science China Mathematics》 SCIE 2014年第8期1579-1586,共8页
A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs ... A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs with k 2.Let G be a k-connected K1,4-free graph of order n with k 2.Ifσk+3(G)n+2k-2,then G contains a spanning 3-ended tree. 展开更多
关键词 spanning tree degree sum insertible vertex segment insertion
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部