CKY ALGORITHM: Related Papers in ACL Anthology
Back to Document Index
Back to Term Index
-
Concordance view (Keyword-In-Context) for the term cky algorithm in the ACL ARC 2.0;
- Concordance view in the ACL ARC 1.0 (Sketch Engine Service).
CKY ALGORITHM can be found in the following ACL ARC 1.0 documents (click to explore):
- (ACL ID: C04-1024) efficient parsing of highly ambiguous context-free grammars with bit vectors
- (ACL ID: E95-1011) a tractable extension of linear indexed grammars
- (ACL ID: H05-1036) compiling comp ling
- (ACL ID: H89-1012) the bbn spoken language system
- (ACL ID: J00-1004) learning dependency translation models as collections of finite-state head transducers
- (ACL ID: J02-2002) the combinatory morphemic lexicon
- (ACL ID: J03-4003) head-driven statistical models for natural language parsing
- (ACL ID: J84-3001) on the mathematical properties of linguistic theories
- (ACL ID: J88-4001) lfp
- (ACL ID: J93-4002) parsing some constrained grammar formalisms
- (ACL ID: J98-4004) pcfg models of linguistic tree representations
- (ACL ID: J99-4004) semiring parsing
- (ACL ID: N03-1016) a* parsing
- (ACL ID: N06-1019) partial training for a lexicalized-grammar parser
- (ACL ID: N06-1045) a better n-best list
- (ACL ID: N06-3004) efficient algorithms for richer formalisms
- (ACL ID: P00-1002) invited talk
- (ACL ID: P01-1010) what is the minimal set of fragments that achieves maximal parse accuracy?
- (ACL ID: P02-1015) parsing non-recursive cfgs
- (ACL ID: P04-1030) head-driven parsing for word lattices
- (ACL ID: P05-1010) probabilistic cfg with latent annotations
- (ACL ID: P05-1038) lexicalization in crosslinguistic probabilistic parsing
- (ACL ID: P06-2047) graph branch algorithm
- (ACL ID: P06-2098) exact decoding for jointly labeling and chunking sequences
- (ACL ID: P88-1032) an earley-type parsing algorithm for tree adjoining grammars
- (ACL ID: P90-1001) polynomial time parsing of combinatory categorial grammars
- (ACL ID: P90-1036) an efficient parsing algorithm for tree adjoining grammars
- (ACL ID: P91-1015) head corner parsing for discontinuous constituency
- (ACL ID: P92-1006) efficiency, robustness and accuracy in picky chart parsing
- (ACL ID: P92-1024) development and evaluation of a broad-coverage probabilistic grammar of english-language computer manuals
- (ACL ID: P98-2159) an efficient parallel substrate for typed feature structures on shared memory parallel machines
- (ACL ID: P99-1059) efficient parsing for bilexical context-free grammars and head automaton grammars
- (ACL ID: W01-0720) a psychologically plausible and computationally effective approach to learning syntax
- (ACL ID: W04-1503) a simple string-rewriting formalism for dependency grammar
- (ACL ID: W05-1502) parsing linear context-free rewriting systems
- (ACL ID: W05-1505) corrective modeling for non-projective dependency parsing
- (ACL ID: W05-1506) better k-best parsing
- (ACL ID: W06-1635) protein folding and chart parsing
- (ACL ID: W06-3119) syntax augmented machine translation via chart parsing
- (ACL ID: W98-1105) semantic tagging using a probabilistic context free grammar
- (ACL ID: W98-1115) edge-based best-first chart parsing
* See also a list of some of the related terms to cky algorithm.
Back to Description Index