Preface -- Acknowledgments -- Finite-State Machines -- The Pynini Library -- Basic Algorithms -- Advanced Algorithms -- Rewrite Rules -- Morphological Analysis and Generation -- The Future -- Bibliography -- Authors' Biographies -- Index.

Weighted finite-state transducers (WFSTs) are commonly used by engineers and computational linguists for processing and generating speech and text. This book first provides a detailed introduction to this formalism. It then introduces Pynini, a Python library for compiling finite-state grammars and for combining, optimizing, applying, and searching finite-state transducers. This book illustrates this library's conventions and use with a series of case studies. These include the compilation and application of context-dependent rewrite rules, the construction of morphological analyzers and generators, and text generation and processing applications.