Sciweavers

ENTCS
2007
159views more  ENTCS 2007»
13 years 4 months ago
Almost Every Domain is Universal
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show
Manfred Droste, Dietrich Kuske
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 8 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld