Improving Phonetic Transcriptions of Children’s Speech by Pronunciation Modelling with Constrained CTC-Decoding

A Study on Network Graph-PW, Network Symmetric Digraph-PW, Change Network Graph-PW and Change Network Symmetric Digraph- PW

“…It is flexibly adaptable to suit the needs of the application, so it can be used in areas such as syntactic analysis, fault delecta tion, and diagnosis in computer, therefore the graphical of this representation of the object and the binary rela tion on them is a convenient form of expression. In this paper, we give some definitions and results of network Graphs-PW ̇ and symmetric Digraphs-PW ̇ and networks changes (Graph-PW and symmetric Digraph-PW) [1,2], we refer to the interested reader to . Proof: Since 𝐺 𝑃𝑊 = (𝑉, 𝐸 * , 𝛷) define on operations, then the operation module has only isolated vertex, and the operation of product has an isolated vertex, if one of vertex is zero, and the other operations 𝐺 ̅ 𝑃𝑊 has an isolated vertex, therefore 𝐺 𝑃𝑊 − 𝑣 or 𝐺 𝑃𝑊 ∪ 𝐺 ̅ 𝑃𝑊 has not an isolated vertex.…”