Sciweavers

2372 search results - page 58 / 475
» Probabilistic calling context
Sort
View
ICGI
2000
Springer
14 years 19 days ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
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...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...
ANLP
2000
92views more  ANLP 2000»
13 years 10 months ago
Left-To-Right Parsing and Bilexical Context-Free Grammars
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 ...
Mark-Jan Nederhof, Giorgio Satta
DI
2006
156views more  DI 2006»
13 years 9 months ago
Identifying almost identical files using context triggered piecewise hashing
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...
Jesse D. Kornblum
FLAIRS
2007
13 years 11 months ago
Probabilistic Task Content Modeling for Episodic Textual Narratives
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...
Eni Mustafaraj, Martin Hoof, Bernd Freisleben
SIGIR
2004
ACM
14 years 2 months ago
GaP: a factor model for discrete data
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...
John F. Canny