Approximating Probabilistic Models as Weighted Finite Automata
Sign Up to like & getrecommendations! Published in 2021 at "Computational Linguistics"
DOI: 10.1162/coli_a_00401
Abstract: Abstract Weighted finite automata (WFAs) are often used to represent probabilistic models, such as n-gram language models, because among other things, they are efficient for recognition tasks in time and space. The probabilistic source to… read more here.
Keywords: finite automata; source; probabilistic models; models weighted ... See more keywords