Results 1  10
of
211
Weighted finitestate transducers in speech recognition
 COMPUTER SPEECH & LANGUAGE
, 2002
"... We survey the use of weighted finitestate transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for hidden Markov models (HMMs), contextdependency, pronunciation dictionaries, grammars, and alternative recognition outputs. Furthermore, general tr ..."
Abstract

Cited by 211 (5 self)
 Add to MetaCart
. As an example, we describe a North American Business News (NAB) recognition system built using these techniques that combines the HMMs, full crossword triphones, a lexicon of 40 000 words, and a large trigram grammar into a single weighted transducer that is only somewhat larger than the trigram word grammar
Efficient Lattice Representation and Generation
 In Proc. of ICSLP
, 1998
"... In largevocabulary, multipass speech recognition systems, it is desirable to generate word lattices incorporating a large number of hypotheses while keeping the lattice sizes small. We describe two new techniques for reducing word lattice sizes without eliminating hypotheses. The first technique i ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
sizes by half on average. It was also found to produce smaller lattices than the standard finite state automaton determinization and minimization algorithms. The second technique is an improved algorithm for expanding lattices with trigram language models. Instead of giving all nodes a unique trigram
Factored language models and generalized parallel backoff
 in Proceedings of HLT/NACCL, 2003
"... We introduce factored language models (FLMs) and generalized parallel backoff (GPB). An FLM represents words as bundles of features (e.g., morphological classes, stems, datadriven clusters, etc.), and induces a probability model covering sequences of bundles rather than just words. GPB extends sta ..."
Abstract

Cited by 114 (13 self)
 Add to MetaCart
We introduce factored language models (FLMs) and generalized parallel backoff (GPB). An FLM represents words as bundles of features (e.g., morphological classes, stems, datadriven clusters, etc.), and induces a probability model covering sequences of bundles rather than just words. GPB extends
Lattice Based Language Models
, 1997
"... This paper introduces lattice based language models, a new language modeling paradigm. These models construct multidimensional hierarchies of partitions and select the most promising partitions to generate the estimated distributions. We discussed a specific two dimensional lattice and propose two ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper introduces lattice based language models, a new language modeling paradigm. These models construct multidimensional hierarchies of partitions and select the most promising partitions to generate the estimated distributions. We discussed a specific two dimensional lattice and propose two
P o S(LATTICE 2007)382 Modified Lattice Landau Gauge
, 2007
"... We propose a modified lattice Landau gauge based on stereographically projecting the link variables on the circle S1 →R for compactU(1) or the 3sphere S3 →R3 for SU(2) before imposing the Landau gauge condition. This can reduce the number of Gribov copies exponentially and solves the Gribov proble ..."
Abstract
 Add to MetaCart
We propose a modified lattice Landau gauge based on stereographically projecting the link variables on the circle S1 →R for compactU(1) or the 3sphere S3 →R3 for SU(2) before imposing the Landau gauge condition. This can reduce the number of Gribov copies exponentially and solves the Gribov
LatticeGas Automata on Parallel Architectures
 In Proceedings of International Symposium on Parallel Computation
, 1993
"... Conserved NavierStokes dynamics can be exactly simulated by lattice gas methods. This work studies several implementation issues of lattice gas automata on stateofart parallel computer systems. We present performance results for the hexagonal LGA lattices on CAM8 mesh, CM5 fattree, and KSR ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Research's KSR1. For a 16bit LGA our main findings are: (1) the CAM8 appears to be much more e#cient than the other two parallel architectures, delivering 25 million sites update per second per module; (2) the CM5 can simulate larger lattices due its much larger memory sizes but can only deliver
Shadows of Odd Unimodular Lattices
"... This is an exposition of our recent joint paper with G. Nebe: G. Nebe and B. Venkov, “Unimodular lattices with long shadow. ” The paper is submitted to Journal of Number Theory. Full text can be found on the web page of G. Nebe. After Elkies and Gaulter, we study odd unimodular lattice $\Lambda $ in ..."
Abstract
 Add to MetaCart
standard generators $\theta_{3} $ and $\triangle_{8} $ , is in fact asum of three monomials $\theta_{\Lambda}=\theta_{3}^{n}+A\theta_{3}^{n8}\triangle_{8}+B\theta_{3}\triangle_{8}^{2}$ with two constants $A $ and $B $. If $\Lambda $ has no elements of norm 1, then $A=2n $. If moreover $\min\Lambda\geq 3
Lattice Kernels for Spoken Dialog Classification
 In Proceedings ICASSP'03, Hong Kong
, 2003
"... Classification is a key task in spokendialog systems. The response of a spokendialog system is often guided by the category assigned to the speaker’s utterance. Unfortunately, classifiers based on the onebest transcription of the speech utterances are not satisfactory because of the high word err ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
algorithms for computing kernels for arbitrary lattices and report experiments using the algorithm in a difficult callclassification task with ¢¤ £ categories. Our experiments with a trigram lattice kernel show a ¥§¦© ¨ reduction in error rate at a ¢©�© ¨ rejection level. 1.
APractical Latticebased Digital Signature Schemes
"... Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring assumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case o ..."
Abstract
 Add to MetaCart
of classical cryptanalytic advances or progress on the development of quantum computers the hardness of these closely related problems might be seriously weakened. A potential alternative approach is the construction of signature schemes based on the hardness of certain lattices problems which are assumed
Results 1  10
of
211