Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Communications of the ACM
Finite-State Language Processing
Finite-State Language Processing
Multilingual Text-to-Speech Synthesis
Multilingual Text-to-Speech Synthesis
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Word hy-phen-a-tion by com-put-er (hyphenation, computer)
Word hy-phen-a-tion by com-put-er (hyphenation, computer)
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Experiments with Automata Compression
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Reducing memory requirements in reachability-based finite automata operations
Software—Practice & Experience
Cache-Conscious Automata for XML Filtering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Re-engineering letter-to-sound rules
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Games for complexity of second-order call-by-name programs
Theoretical Computer Science - Game theory meets theoretical computer science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
A Table Compression Method for Extended Aho-Corasick Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Per-node optimization of finite-state mechanisms for natural language processing
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
| Hi-index | 0.01 |
This paper presents an eclectic approach for compressing weighted finite-state automata and transducers, with minimal impact on performance. The approach is eclectic in the sense that various complementary methods have been employed: row-indexed storage of sparse matrices, dictionary compression, bit manipulation, and lossless omission of data. The compression rate is over 83% with respect to the current Bell Labs finite-state library.