| A92-1027 | probably the nested loops of the | CKY algorithm | ( see , e.g. , Aho & Ullman |
| D10-1054 | 2003 ) . We utilize a standard | CKY algorithm | for decod - ing . Given a source |
| C04-1024 | bit-vector based implementation of the | CKY algorithm | for large highly ambiguous grammars |
| D14-1107 | sentence length . Unlike the cubic | CKY algorithm | typically used by chart parsers |
| D13-1022 | which is simply a version of the | CKY algorithm | . Next consider a variant of |
| D11-1081 | method instead of traditional | CKY algorithm | . Not surprisingly , the improvements |
| D11-1018 | can also be performed using the | CKY algorithm | . Section 3 describes the feature |
| C04-1024 | uses a modi ed version of the | CKY algorithm | allowing also chain rules ( rules |
| D11-1018 | computed efficiently using the | CKY algorithm | . 2.3 Monolingual Parsing Model |
| C04-1024 | . 2 Grammar Transformation The | CKY algorithm | requires a grammar in Chomsky |
| D11-1108 | most probable derivation via the | CKY algorithm | . In principle the best translation |
| D08-1018 | adopt an extended version of the | CKY algorithm | which can handle the unary productions |
| E95-1011 | for PLPATR that generalizes the | CKY algorithm | ( Kasami , 1965 ; Younger , 1967 |
| D08-1018 | analysis of the running time of the | CKY algorithm | and simplify the problem by introducing |
| D12-1105 | be easily integrated into the | CKY algorithm | for a single annotated grammar |
| D15-1122 | most probable derivation via the | CKY algorithm | with a Viterbi approximation |
| D10-1054 | contain variables . Because the | CKY algorithm | guarantees that the sub spans |
| D08-1018 | known that the complexity of the | CKY algorithm | is O ( n3L ) . The constant L |
| E09-1037 | For example , the probabilistic | CKY algorithm | ( run on sentence w1w2 ... wn |
| E12-1044 | ( n3 ) time since it uses the | CKY algorithm | , and each cell in the CKY parse |
