1. A computer implemented method of converting a text form into a phoneme tree, comprising: parsing 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; compiling 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; combining the plurality of 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 computer implemented method of converting a text form into a phoneme tree, comprising: parsing 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; compiling 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; combining the plurality of 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. 8. The method according to claim 1 , further comprising: when combining the plurality of phoneme graphs to form the phoneme tree, optimizing the phoneme tree by eliminating from the second phoneme graph a list of phonemes appearing in the first phoneme graph; and creating, at either the first or last phoneme in the list, a common intermediate node between the first phoneme graph and the second phoneme graph in the phoneme tree.