14 search results - page 1 / 3 » Lower bounds for context-free grammars |
107
click to vote
JALC
2007
15 years 11 days ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
112
click to vote
IPL
2011
14 years 3 months ago
2011
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...
117
Voted
ICGI
2010
Springer
14 years 9 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
101
click to vote
DAGM
2008
Springer
15 years 2 months ago
2008
Springer
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
118
click to vote
NAACL
2010
14 years 10 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...