Grapheme/phoneme transcription rules compiling automaton constructing method for e.g. server, involves constructing and storing automaton with states and state transitions got from rules listed from grapheme/phoneme correspondences, in base

摘要

The method involves listing and storing grapheme/phoneme transcription rules, in a base, from left and right correspondence analyses of grapheme/phoneme correspondences, of a database (BD), in pairs of graphic and phonetic chains of an initial transcription corpus. An automaton including states and state transitions deduced from the listed transcription rules is constructed and stored in the form of a file in a base. Each state is a link between two consecutive grapheme/phoneme correspondences in a pair of graphic and phonetic chains, and each transition chains two states having a common correspondence. Independent claims are also included for the following: (A) a computer system for construction of an automaton compiling grapheme/phoneme transcription rules (B) computer program implemented in a computer system for constructing an automaton compiling grapheme/phoneme transcription rules.