digraph


Also found in: Thesaurus, Encyclopedia, Wikipedia.

di·graph

 (dī′grăf′)
n.
1. A pair of letters representing a single speech sound, such as the ph in pheasant or the ea in beat.
2. A single character consisting of two letters run together and representing a single sound, such as Old English æ.

di·graph′ic (dī-grăf′ĭk) adj.

digraph

(ˈdaɪɡrɑːf; -ɡræf)
n
(Phonetics & Phonology) phonetics a combination of two letters or characters used to represent a single speech sound such as gh in English tough. Compare ligature5, diphthong
digraphic adj

di•graph

(ˈdaɪ græf, -grɑf)

n.
a pair of letters representing a single speech sound, as ea in meat or th in path.
[1780–90]
di•graph′ic (-ˈgræf ɪk) adj.
di•graph′i•cal•ly, adv.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.digraph - two successive letters (especially two letters used to represent a single sound: `sh' in `shoe')
alphabetic character, letter of the alphabet, letter - the conventional characters of the alphabet used to represent speech; "his grandmother taught him his letters"
References in periodicals archive ?
The consonant digraph, /ck/, never appears at the start of a word.
The digraph then is substitute with the elements used for the study.
In his presentation on the word-final digraph [TEXT NOT
All states of the underlying digraph of the Markov chain are assumed to be accessible from the initial state.
Welsh dictionaries follow this pattern, with digraph letters coming after the single-letter entries.
I barely even knew what phonics were when my son started learning them, and he now bandies around words such as digraph and trigraph as casually as, 'It's not fair.
Digraph D is simple if D has no loops (edges e with [delta](e) = (v, v)) and there is at most one edge from x to y for any x, y [member of] V(D).
The digraph product that refers the title was introduced by Figueroa-Centeno et al.
A digraph D is cycle-complementary if there exist two vertex-disjoint cycles C and C' such that their vertices form a partition of the set of vertices of digraph D.
n+1]) be the complete digraph on n + 1 nodes where we set [V.
a) it is based on directed minors which allows us to avoidthe algorithmic problems faced by existing digraph widthmeasures and has not been studied before in this context and
Singh and Sekhon (1996) have presented a strip-layout selection methodology using digraph and matrix approach.