179 search results - page 9 / 36 » Lambek Grammars 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 23 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...
ACL
1993
13 years 8 months ago
1993
This paper introduces a tree generating system called Lexicalized Context-Free Grammar (LCFG) and describes a cubic-time parser for it. LCFG embeds the elegance of the analyses fo...
IJCAI
2001
13 years 9 months ago
2001
We present a machine learning algorithm for refining the structure of a stochastic context
ICDT
2010
ACM
13 years 11 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...