Sciweavers

1655 search results - page 112 / 331
» Stemming in the language modeling framework
Sort
View
TCS
2011
14 years 7 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
CAISE
2006
Springer
15 years 4 months ago
Workflow Exception Patterns
This paper presents a classification framework for workflow exception handling in the form of patterns. This framework is independent of specific modelling approaches or technologi...
Nick Russell, Wil M. P. van der Aalst, Arthur H. M...
PLSA
1994
15 years 4 months ago
Language and Architecture Paradigms as Object Classes
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
Diomidis Spinellis, Sophia Drossopoulou, Susan Eis...
117
Voted
LOGCOM
2007
126views more  LOGCOM 2007»
15 years 17 days ago
Causality and Counterfactuals in the Situation Calculus
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
Mark Hopkins, Judea Pearl
SIGIR
2003
ACM
15 years 6 months ago
On an equivalence between PLSI and LDA
Latent Dirichlet Allocation (LDA) is a fully generative approach to language modelling which overcomes the inconsistent generative semantics of Probabilistic Latent Semantic Index...
Mark Girolami, Ata Kabán