Theoretical Computer Science
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Simple optimal string matching algorithm
Journal of Algorithms
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Efficient Experimental String Matching by Weak Factor Recognition
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Distribution kernels based on moments of counts
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Generalized algorithms for constructing statistical language models
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Rational Kernels: Theory and Algorithms
The Journal of Machine Learning Research
Moment Kernels for Regular Distributions
Machine Learning
Statistical modeling for unit selection in speech synthesis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Efficient Unit-Selection in Text-to-Speech Synthesis
TSD '08 Proceedings of the 11th international conference on Text, Speech and Dialogue
Statistical lattice-based spoken document retrieval
ACM Transactions on Information Systems (TOIS)
Regular approximation and bounded domains for size-change termination
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Index-based incremental language model for scalable directory assistance
Speech Communication
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and utilities of this library and point out in each case their application to several text and speech processing tasks.