CYK ALGORITHM: Related Papers in ACL Anthology

CYK ALGORITHM can be found in the following ACL ARC 1.0 documents (click to explore):

• (ACL ID: C04-1002) linear-time dependency analysis for japanese
• (ACL ID: C90-2054) a polynomial - order algorithm for optimal phrase sequence selection from a phrase lattice and its parallel layered implementation
• (ACL ID: C92-1058) the primordial soup algorithm a systematic approach to the specification of parallel parsers
• (ACL ID: H86-1020) some computational properties of tree adjoining grammars
• (ACL ID: H89-1045) chart parsing of stochastic spoken language models
• (ACL ID: H91-1041) session 7
• (ACL ID: I05-2034) probabilistic models for korean morphological analysis
• (ACL ID: J95-2002) an efficient probabilistic context-free parsing algorithm that computes prefix probabilities
• (ACL ID: N03-3006) a low-complexity, broad-coverage probabilistic dependency parser for english
• (ACL ID: N06-1040) probabilistic context-free grammar induction based on structural zeros
• (ACL ID: P06-2038) speeding up full syntactic parsing by leveraging partial parsing decisions
• (ACL ID: P85-1011) some computational properties of tree adjoining grammers
• (ACL ID: P88-1026) lexicon and grammar in probabilistic tagging of written english.
• (ACL ID: P91-1040) constraint projection
• (ACL ID: P92-1012) recognition of linear context-free rewriting systems
• (ACL ID: P96-1032) efficient tabular l r parsing
• (ACL ID: W00-1303) japanese dependency structure analysis based on support vector machines
• (ACL ID: W02-2016) japanese dependency analysis using cascaded chunking
• (ACL ID: W05-1511) efficacy of beam thresholding, unification filtering and hybrid parsing in probabilistic hpsg parsing
• (ACL ID: W06-1508) stochastic multiple context-free grammar for rna pseudoknot modeling
• (ACL ID: W97-1013) explanation-based learning of data-oriented parsing
• (ACL ID: W98-1302) context-free parsing through regular approximation