367 search results - page 7 / 74 » Lexicalized Context-Free Grammars |
LICS
1993
IEEE
13 years 11 months ago
1993
IEEE
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
JOLLI
2006
13 years 7 months ago
2006
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
ECML
2003
Springer
14 years 17 days ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
ICDT
2010
ACM
13 years 10 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
IJCAI
2001
13 years 8 months ago
2001
We present a machine learning algorithm for refining the structure of a stochastic context