Sciweavers

268 search results - page 28 / 54
» Linear Context Free Languages
Sort
View
FINTAL
2006
13 years 11 months ago
Incorporating External Information in Bayesian Classifiers Via Linear Feature Transformations
Naive Bayes classifier is a frequently used method in various natural language processing tasks. Inspired by a modified version of the method called the flexible Bayes classifier, ...
Tapio Pahikkala, Jorma Boberg, Aleksandr Myllä...
ICML
2005
IEEE
14 years 8 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
ACL
2012
11 years 9 months ago
Large-Scale Syntactic Language Modeling with Treelets
We propose a simple generative, syntactic language model that conditions on overlapping windows of tree context (or treelets) in the same way that n-gram language models condition...
Adam Pauls, Dan Klein
AINA
2007
IEEE
13 years 11 months ago
Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame
In 1957 Crick hypothesized that the genetic code was a comma free code. This property would imply the existence of a universal coding frame and make the set of coding sequences a ...
Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal
IPL
2006
120views more  IPL 2006»
13 years 7 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla