Sciweavers

8008 search results - page 151 / 1602
» Computer-Aided Language Processing
Sort
View
ICASSP
2009
IEEE
15 years 10 months ago
Neural network based language models for highly inflective languages
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
Tomas Mikolov, Jirí Kopecký, Lukas B...
ICGI
2010
Springer
15 years 7 months ago
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
Herman Stehouwer, Menno van Zaanen
POPL
2012
ACM
14 years 2 months ago
A compiler and run-time system for network programming languages
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
Christopher Monsanto, Nate Foster, Rob Harrison, D...
APLAS
2004
ACM
16 years 7 days ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
JMLR
2012
13 years 9 months ago
Stick-Breaking Beta Processes and the Poisson Process
We show that the stick-breaking construction of the beta process due to Paisley et al. (2010) can be obtained from the characterization of the beta process as a Poisson process. S...
John William Paisley, David M. Blei, Michael I. Jo...