Search Results for author:
Found 2 papers, 0 papers with code
Online Infix Probability Computation for Probabilistic Finite Automata
Probabilistic finite automata (PFAs) are com- mon statistical language model in natural lan- guage and speech processing.
Incremental Computation of Infix Probabilities for Probabilistic Finite Automata
The problem of computing infix probabilities of strings when the pattern distribution is given by a probabilistic context-free grammar or by a probabilistic finite automaton is already solved, yet it was open to compute the infix probabilities in an incremental manner.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
