Sciweavers

130 search results - page 18 / 26
» A Stochastic Language Model using Dependency and Its Improve...
Sort
View
ACL
2003
13 years 8 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
JSS
2010
142views more  JSS 2010»
13 years 2 months ago
Analysis of service availability for time-triggered rejuvenation policies
In this paper we investigate the effect of three time-triggered system rejuvenation policies on service availability using a queuing model. The model is formulated as an extended ...
Felix Salfner, Katinka Wolter
CICLING
2005
Springer
14 years 28 days ago
Direct Combination of Spelling and Pronunciation Information for Robust Back-Transliteration
Abstract. Transliterating words and names from one language to another is a frequent and highly productive phenomenon. For example, English word cache is transliterated in Japanese...
Slaven Bilac, Hozumi Tanaka
CIKM
2007
Springer
13 years 11 months ago
A segment-based hidden markov model for real-setting pinyin-to-chinese conversion
Hidden markov model (HMM) is frequently used for Pinyin-toChinese conversion. But it only captures the dependency with the preceding character. Higher order markov models can brin...
Xiaohua Zhou, Xiaohua Hu, Xiaodan Zhang, Xiajiong ...
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman