Crafting a compiler
Bayesian learning of probabilistic language models
Bayesian learning of probabilistic language models
Logic-based genetic programming with definite clause translation grammars
New Generation Computing
Grammatical Inference: An Introduction Survey
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Inducing Probabilistic Grammars by Bayesian Model Merging
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
A minimum description length approach to grammar inference
Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing
Stochastic attribute-value grammars
Computational Linguistics
Grammatical inference by Hill Climbing
Information Sciences: an International Journal
Inferring Attribute Grammars with Structured Data for Natural Language Processing
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
LyrebirdTM: Developing Spoken Dialog Systems Using Examples
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
| Hi-index | 0.00 |
Over-the-telephone Large Vocabulary Spoken Dialog Systems have now become a commercial reality. A major obstacle to the uptake of the technology is the effort required to construct spoken dialog applications, in particular the grammars. To overcome this obstacle, a spoken dialogue toolkit has been developed that uses grammatical inference in combination with a templating technique to build transaction based services. As part of this development a new grammatical inference technique know as the "Lyrebird" algorithm has been developed. Experimental results contained show that the Lyrebird algorithm outperforms the only other known algorithm for inferring context free attribute grammars. We also present the results of a comparison between the performance of the Lyrebird algorithm and an experienced speech application developer, showing that the algorithm creates grammars of a similar quality in a significantly reduced time.