2111 search results - page 196 / 423 » Understanding the Yarowsky Algorithm |
159
click to vote
NETWORKING
2000
15 years 3 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
156
click to vote
AAAI
1996
15 years 3 months ago
1996
First-order probabilistic logic is a powerful knowledge representation language. Unfortunately, deductive reasoning based on the standard semantics for this logic does not support...
138
click to vote
CASCON
1993
15 years 3 months ago
1993
There is a signi cant di erence between documentinglarge programs and documenting small ones. By large programs we mean on the order of 1,000,000 lines, usually written by many di...
124
Voted
COLING
1996
15 years 3 months ago
1996
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
103
click to vote
COLING
1992
15 years 3 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...