Incremental Computation of Infix Probabilities for Probabilistic Finite Automata
Marco Cognetta, Yo-Sub Han, Soon Chan Kwon · 2018
In natural language processing, a common task is to compute the probability of a given phrase appearing or to calculate the probability of all phrases matching a given pattern.For instance, one computes affix (prefix, suffix, infix, etc.) probabilities of a string or a set of strings with respect to a probability distribution of patterns.