Add to ORKGWeighted pushdown automata (WPDAs) have recently been adopted in some applications such as machine translation [Iglesias et al., 2011] as a more compact alternative to weighted finite-state automata (WFSAs) for representing a weighted set of strings. Allauzen and Riley [2012] introduce a set of basic algorithms for construction and inference of WPDAs, and the corresponding implementation as an extension of the ope
Abstract. We present a disambiguation algorithm for weighted au-tomata. The algorithm admits two mai...
SIGLEAvailable from TIB Hannover: RR 7739(02,02) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
Weighted finite automata (WFA) are finite automata whose transitions and states are augmented with s...
Abstract Weighted finite-state transducers are used in many applications such as text, speech and im...
A weight normalization procedure, commonly called pushing, is introduced forweighted tree automata (...
We study properties and relationship between three classes of quantitative language models computing...
International audienceWe study several classes of symbolic weighted formalisms: automata (swA), tran...
AbstractThis paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda)...
We give a #NC (1) upper bound for the problem of counting accepting paths in any fixed visibly pushd...
Weighted finite-state automata (WSFAs) arecommonly used in NLP. Failure transitions area useful exte...
This paper describes the use of pushdown automata (PDA) in the context of statistical machine transl...
This article describes the use of pushdown automata (PDA) in the context of statistical machine tra...
An algorithm is presented which will determine whether any string w in Σ*, of length n, is contained...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
Abstract. We present a disambiguation algorithm for weighted au-tomata. The algorithm admits two mai...
SIGLEAvailable from TIB Hannover: RR 7739(02,02) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
Weighted finite automata (WFA) are finite automata whose transitions and states are augmented with s...
Abstract Weighted finite-state transducers are used in many applications such as text, speech and im...
A weight normalization procedure, commonly called pushing, is introduced forweighted tree automata (...
We study properties and relationship between three classes of quantitative language models computing...
International audienceWe study several classes of symbolic weighted formalisms: automata (swA), tran...
AbstractThis paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda)...
We give a #NC (1) upper bound for the problem of counting accepting paths in any fixed visibly pushd...
Weighted finite-state automata (WSFAs) arecommonly used in NLP. Failure transitions area useful exte...
This paper describes the use of pushdown automata (PDA) in the context of statistical machine transl...
This article describes the use of pushdown automata (PDA) in the context of statistical machine tra...
An algorithm is presented which will determine whether any string w in Σ*, of length n, is contained...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...
Abstract. We present a disambiguation algorithm for weighted au-tomata. The algorithm admits two mai...
SIGLEAvailable from TIB Hannover: RR 7739(02,02) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
We consider the optimal-reachability problem for a timed automaton with respect to a linear cost fun...