1. A system for converting a text form into a phoneme tree, comprising: a data parser, configured to parse a data source in the text form to obtain a plurality of partial word lists of the data source, the data source comprising content of a web page; one or more compilers, configured to compile the plurality of partial word lists to create a plurality of phoneme graphs, each phoneme graph corresponding to a respective partial word list, each phoneme graph including a root node, a plurality of phonemes, and an end node; a combiner, configured to combine the created phoneme graphs to form the phoneme tree, wherein the phoneme tree includes at least a first phoneme graph and a second phoneme graph sharing a common root node and a common end node.
1. A system for converting a text form into a phoneme tree, comprising: a data parser, configured to parse a data source in the text form to obtain a plurality of partial word lists of the data source, the data source comprising content of a web page; one or more compilers, configured to compile the plurality of partial word lists to create a plurality of phoneme graphs, each phoneme graph corresponding to a respective partial word list, each phoneme graph including a root node, a plurality of phonemes, and an end node; a combiner, configured to combine the created phoneme graphs to form the phoneme tree, wherein the phoneme tree includes at least a first phoneme graph and a second phoneme graph sharing a common root node and a common end node. 5. The system according to claim 1 , wherein the data parser parses the data source, in series, to obtain the plurality of partial word lists of the data source for use by the one or more compilers.