This work investigates two related issues in the area of WFSTbased G2P conversion. The first is the impact that the approach utilized to convert a target word to an equivalent finite-state machine has on downstream decoding efficiency. The second issue considered is the impact that the approach utilized to represent the joint n-gram model via the WFST framework has on the speed and accuracy of the system. In the latter case two novel algorithms are proposed, which extend the work from [1 ]t o enable the use of failure-transitions with joint n-gram models. All solutions presented in this work are available as part of the open-source, BSD-licensed Phonetisaurus G2P toolkit [2]. Index Terms: G2P, WFST, model conversion
