Sciweavers

182 search results - page 22 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
NIPS
2008
13 years 9 months ago
Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...
Phil Blunsom, Trevor Cohn, Miles Osborne
INFOCOM
2009
IEEE
14 years 2 months ago
Event Recognition in Sensor Networks by Means of Grammatical Inference
Abstract—Modern military and civilian surveillance applications should provide end users with the high level representation of events observed by sensors rather than with the raw...
Sahin Cem Geyik, Boleslaw K. Szymanski
EJC
2007
13 years 9 months ago
Comparing the Use of Feature Structures in Nativism and in Database Semantics
Linguistics has always been a field with a great diversity of schools and sub-schools. This has naturally led to the question of whether different grammatical analyses of the sam...
Roland Hausser
PAMI
2006
109views more  PAMI 2006»
13 years 7 months ago
Offline Grammar-Based Recognition of Handwritten Sentences
This paper proposes a sequential coupling of a Hidden Markov Model (HMM) recognizer for offline handwritten English sentences with a probabilistic bottom-up chart parser using Sto...
Matthias Zimmermann, Jean-Cédric Chappelier...
IPL
2011
94views more  IPL 2011»
12 years 11 months ago
Lower bounds for context-free grammars
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
Yuval Filmus