A finite-state transducer is a type of finite-state automaton that has two memory tapes, an input and an output tape. It can be used to map between two sets of symbols and generate relations between sets of strings. It is more general than an FSA as it defines relations between strings rather than just accepted strings.
University of Washington
Winter 2022
This course provides a comprehensive overview of Natural Language Processing (NLP), including core components like text classification, machine translation, and syntax analysis. It offers two project types: implementation problem-solving for CSE 447, and reproducing experiments from recent NLP papers for CSE 517.
No concepts data
+ 16 more concepts