no code implementations • WS 2019 • An Suresh, a Theertha, Brian Roark, Michael Riley, Vlad Schogol
Weighted finite automata (WFA) are often used to represent probabilistic models, such as n-gram language models, since they are efficient for recognition tasks in time and space.
