2372 search results - page 58 / 475 » Probabilistic calling context |
121
click to vote
ICGI
2000
Springer
15 years 4 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
99
Voted
ANLP
2000
15 years 2 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
84
Voted
DI
2006
15 years 20 days ago
2006
Fuzzy hashing allows the discovery of potentially incriminating documents that may not be located using traditional hashing methods. The use of the fuzzy hash is much like the fuz...
112
Voted
FLAIRS
2007
15 years 3 months ago
2007
Episodic knowledge is often stored in the form of textual narratives written in natural language. However, a large repository of such narratives will contain both repetitive and n...
135
click to vote
SIGIR
2004
ACM
15 years 6 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...