| 摘要 |
<p>The method involves constructing a processing automaton and storing the automaton in a database (BD), where the automaton compiles transcription rules resulting from an analysis of grapheme/phenome correspondence. Probabilities of transitions in node output of the automaton are determined and stored in the database. The determined probabilities of transitions and the automaton are combined for constructing a phonetizer. Independent claims are also included for the following: (A) a computing system for constructing a phonetizer (B) a computer program implemented on a computing system for constructing a phonetizer (C) a computing method for verifying the exactitude of a required graphic string (D) a computing system for verifying the exactitude of a required graphic string (E) a computer program implemented on a computing system for verifying the exactitude of a required graphic string (F) a phonetizer for transcribing a required graphic string into phonetic signature.</p> |
