Sciweavers

367 search results - page 23 / 74
» Lexicalized Context-Free Grammars
Sort
View
EJC
2007
13 years 10 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 8 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 12 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
ACL
2003
13 years 9 months ago
Generating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoini...
Lionel Clément, Alexandra Kinyon
NIPS
2008
13 years 10 months ago
Logistic Normal Priors for Unsupervised Probabilistic Grammar Induction
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...
Shay B. Cohen, Kevin Gimpel, Noah A. Smith