completion

Algorithm 2 describes the prompt completion algorithm introduced in Section 2.2. It implicitly401 considers a single action, which takes the next sequence element.402 Algorithm 2 - Prompt completion Input: Grounded schema {T,C,Erb}with rebound CSCG emission matrix Erb, delimiter token x, prompt x(prompt) = (x1,...,xm) Output: A completed prompt x(prompt completed) = (x1,...,xm,xm+1,...,xm+p = x) 1: Run max-product for MAP inference and return zMAP = (z1,...,zm) = argmaxz p(z|x(prompt)). Algorithm 3 is a variant of the rebinding Algorithm 1 that does not use EM. Instead, it first searches404 for "surprising observations": a surprise has a low probability of being emitted by its decoded clone.405