47 search results - page 5 / 10 » Partially-Commutative Context-Free Processes |
117
click to vote
ICDT
2010
ACM
15 years 25 days 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...
LATA
2010
Springer
15 years 4 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
IJCNLP
2004
Springer
15 years 2 months ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
ACL
1997
14 years 11 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
102
click to vote
CVPR
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to ...