The generative story of a sentence. Given an unpunctuated tree T at top, at each node w ∈ T, the Attach process stochastically attaches a left puncteme l and a right puncteme r, which may be empty. The resulting tree T′ has underlying punctuation u. Each slot’s punctuation ui ∈ u is rewritten to xi ∈ x by NoisyChannel.
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.