Sciweavers

CSL
2004
Springer
13 years 4 months ago
Contemporaneous text as side-information in statistical language modeling
We propose new methods to exploit contemporaneous text, such as on-line news articles, to improve language models for automatic speech recognition and other natural language proce...
Sanjeev Khudanpur, Woosung Kim
CSL
2004
Springer
13 years 4 months ago
Factor analysed hidden Markov models for speech recognition
Recently various techniques to improve the correlation model of feature vector elements in speech recognition systems have been proposed. Such techniques include semi-tied covaria...
Antti-Veikko I. Rosti, M. J. F. Gales
CSL
2004
Springer
13 years 4 months ago
Word sense disambiguation of WordNet glosses
This paper presents a suite of methods and results for the semantic disambiguation of WordNet glosses. WordNet is a resource widely used in natural language processing and artific...
Dan I. Moldovan, Adrian Novischi
CSL
2004
Springer
13 years 4 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
CSL
2004
Springer
13 years 8 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
CSL
2004
Springer
13 years 8 months ago
Pfaffian Hybrid Systems
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
Margarita V. Korovina, Nicolai Vorobjov
CSL
2004
Springer
13 years 8 months ago
A Functional Scenario for Bytecode Verification of Resource Bounds
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
Roberto M. Amadio, Solange Coupet-Grimal, Silvano ...
CSL
2004
Springer
13 years 10 months ago
Subtyping Union Types
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
Jerome Vouillon
CSL
2004
Springer
13 years 10 months ago
On Proof Nets for Multiplicative Linear Logic with Units
Lutz Straßburger, François Lamarche
CSL
2004
Springer
13 years 10 months ago
A Third-Order Bounded Arithmetic Theory for PSPACE
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
Alan Skelley