网站首页  词典首页

请输入您要查询的词汇:

 

词汇 digraph
释义 digraph
noun[ C ]
 language specializeduk /ˈdaɪ.ɡrɑːf/ us /ˈdaɪ.ɡræf/
two letters written together that make one sound: 二合字母(两个字母发一个音)
In English, the digraph "ph" is pronounced as /f/.在英语中,二合字母 "ph "的发音为/f/。
See also
trigraph
SMART Vocabulary: related words and phrases

Linguistic terms & linguistic style
accentual
affricate
allophone
allophony
anaphor
contextualize
emphatic
entailment
etymological
etymologically
etymologist
idiomatic
inflected language
philological
philologically
polysemy
portmanteau word
prescriptivism
stylistics
tautology

Examples of digraph


digraph
Then, through the paths of the digraph representing the design problem decomposition, the dependent descriptor will eventually acquire its value.
We point out that our graphs are usually called directed graphs without multiple arcs or digraphs.
The computational burden can, in addition, be further reduced by exploiting the probabilistic relationships among the variables that are represented in the network's digraph.
The figures make it plain that print-users are more committed to the use of classical digraphs than their web-using counterparts.
We give results on the strong connectivity for spaces of sparse random digraphs specified by degree sequence.
They are linked in order to form multiple design relations, formally represented by digraphs.
Never mind these uppity modern digraphs: words like encyclopedia, anaemia etc rejoiced in proper diphthongs during my formative years.
We follow an arc of the digraph whenever the insertion radius of a point x is less than f (x).
A semicomplete digraph without cycles of length two is a tournament.
The control items for the digraphs were words with initial or final consonant clusters.
When we consider the connectivity of digraphs we find that much less has been done.
Any monomorphism of this algebra is a digraph embedding.
One of the two random variables, the number of sources in a random acyclic digraph, has a transition probability which is only time dependent.
The usual recursive definition of the reachability of a vertex in a digraph is tight only when the graph is acyclic.
The reader may replace everywhere the term 'relation' by 'digraph'.
These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors.
随便看

 

反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条,基本涵盖了全部常用英语词汇的中英文双语翻译及用法,是英语学习的有利工具。

 

Copyright © 2005-2024 fscai.com All Rights Reserved 更新时间:2025/1/1 6:54:01