Soon-Chan Kwon

Online Infix Probability Computation for Probabilistic Finite Automata

2019

Probabilistic finite automata (PFAs) are common statistical language model in natural language and speech processing. A typical task for PFAs is to compute the probability of all strings that match a query pattern. An important …