Computing the Most Probable String with a Probabilistic Finite State Machine
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationSpeech RecognitionSimilar Papers 제목 키워드 기반
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. A typical task for PFAs is to compute the probability of all strings that match a query pattern. A…
Language ModelingLanguage ModellingIncremental Computation of Infix Probabilities for Probabilistic Finite Automata
In natural language processing, a common task is to compute the probability of a phrase appearing in a document or to calculate the probability of all phrases matching a given pattern. For instance, one computes affix (p…
Sampling from Stochastic Finite Automata with Applications to CTC Decoding
Stochastic finite automata arise naturally in many language and speech processing tasks. They include stochastic acceptors, which represent certain probability distributions over random strings. We consider the problem o…
Computing LPMLN Using ASP and MLN Solvers
LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is …
Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
It is well known that computing a minimum deterministic finite automaton consistent with a given set of positive and negative examples is NP-hard. Previous work has identified conditions on the input sample under which t…