CKY algorithm

Web: https://www.reddit.com/r/LanguageTechnology/comments/sh0cip/cky_algorithm/

Hey,

Could someone please simply explain the CKY algorithm, how it works?

let the input be a string I consisting of n characters: a1 ... an.

So the input is just characters, not tokenized words?

let the grammar contain r nonterminal symbols R1 ... Rr, with start symbol R1.

What are non terminal symbols?

let P[n,n,r] be an array of booleans.

This is a three dimensional array? Why does n occur twice?

Initialize all elements of P to false.

for …

algorithm languagetechnology