Results 1  10
of
4,800
Incremental Generation Of Word Graphs
"... We present an algorithm for the incremental generation of word graphs. Incremental means that the speech signal is processed lefttorightby a time synchronous Viterbi algorithm and word hypotheses are generated with some delay to Viterbi decoding. The incrementally generated word hypotheses can be ..."
Abstract
 Add to MetaCart
We present an algorithm for the incremental generation of word graphs. Incremental means that the speech signal is processed lefttorightby a time synchronous Viterbi algorithm and word hypotheses are generated with some delay to Viterbi decoding. The incrementally generated word hypotheses can
Word Graphs for Statistical Machine Translation
, 2005
"... Word graphs have various applications in the field of machine translation. Therefore it is important for machine translation systems to produce compact word graphs of high quality. We will describe the generation of word graphs for state of the art phrasebased statistical machine translation. We wi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Word graphs have various applications in the field of machine translation. Therefore it is important for machine translation systems to produce compact word graphs of high quality. We will describe the generation of word graphs for state of the art phrasebased statistical machine translation. We
Semantics and Constraint Parsing of Word Graphs
 IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLUME II
, 1992
"... We have developed a constraintbased parser capable of processing a word graph containing multiple sentence hypotheses. When syntactic constraints are applied to a word graph, our parser is able to prune the graph of many ungrammatical sentence hypotheses and limit the possible parses of the remaini ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
We have developed a constraintbased parser capable of processing a word graph containing multiple sentence hypotheses. When syntactic constraints are applied to a word graph, our parser is able to prune the graph of many ungrammatical sentence hypotheses and limit the possible parses
On Compact Directed Acyclic Word Graphs
 Structures in Logic and Computer Science
, 1997
"... The Directed Acyclic Word Graph (DAWG) is a spaceefficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time lin ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
The Directed Acyclic Word Graph (DAWG) is a spaceefficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time
Acyclic Word Graphs (DAWGs), and Compact Directed Acyclic Word Graphs
"... Abstract. Trie is a tree structure to represent a set of strings. When the strings have many common prefixes, the number of nodes in the trie is much less than the total length of the strings. In this paper, we propose an algorithm for constructing the Compact Directed Acyclic Word Graph for a trie, ..."
Abstract
 Add to MetaCart
Abstract. Trie is a tree structure to represent a set of strings. When the strings have many common prefixes, the number of nodes in the trie is much less than the total length of the strings. In this paper, we propose an algorithm for constructing the Compact Directed Acyclic Word Graph for a trie
Ternary Directed Acyclic Word Graphs
, 2003
"... Given a set S of strings, a DFA accepting S offers a very timeefficient solution to the pattern matching problem over S. Thekey is how to implement such a DFA in the tradeoff between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley ..."
Abstract
 Add to MetaCart
easy. The directed acyclic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). We perform some experiments that show
Generation of Word Graphs in Statistical Machine Translation
, 2002
"... Statistical machine translation systems usually compute the single sentence that has the highest probability according to the models that are trained on data. We describe a method for constructing a word graph to represent alternative hypotheses in an efficient way. The advantage is that these hypot ..."
Abstract

Cited by 43 (14 self)
 Add to MetaCart
Statistical machine translation systems usually compute the single sentence that has the highest probability according to the models that are trained on data. We describe a method for constructing a word graph to represent alternative hypotheses in an efficient way. The advantage
Direct construction of Compact Directed Acyclic Word Graphs
 COMBINATORIAL PATTERN MATCHING (AARHUS, 1997), FRANCE
, 1997
"... The Directed Acyclic Word Graph (DAWG) is an efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in t ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
The Directed Acyclic Word Graph (DAWG) is an efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear
Generation and Minimization of Word Graphs in Continuous
"... in the forward and backward passes, it is guaranteed that the generated graph is the minimal wordlattice, containing exactly the paths that have a higher score than the threshold. This includes all the different alignments of each wordstring. For rescoring using new acoustical models, the wordlat ..."
Abstract
 Add to MetaCart
in the forward and backward passes, it is guaranteed that the generated graph is the minimal wordlattice, containing exactly the paths that have a higher score than the threshold. This includes all the different alignments of each wordstring. For rescoring using new acoustical models, the word
Results 1  10
of
4,800