179 search results - page 3 / 36 » Lambek Grammars Are Context Free |
ECML
2000
Springer
13 years 12 months ago
2000
Springer
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Wol 's SNPR { the Gridssys...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
NAACL
2010
13 years 5 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...
EACL
2009
ACL Anthology
14 years 8 months ago
2009
ACL Anthology
ACL
2010
13 years 5 months ago
2010
In this paper, we present a novel approach for authorship attribution, the task of identifying the author of a document, using probabilistic context-free grammars. Our approach in...