We study automata for capturing transformations employed by practical natural language processing systems, such as those that translate between human languages. For several variations of finite-state string and tree transducers, we ask formal questions about expressiveness, modularity, teachability, and generalization.