Building a Large Annotated Corpus of English: The Penn Treebank
Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics)
Subscriber deck — free during early access
29 cards
1 Introduction
- What is the Penn Treebank, as described in 1993?A corpus of over 4.5 million words of American English annotated for part of speech, with over half also annotated for skeletal syntactic structure, built 1989–1992 and distributed through the Linguistic Data Consortium.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §1
- What uses did the authors foresee for large annotated corpora?Automatically building statistical models of grammar for written and spoken language, formal theories of the grammars of writing and speech, studying prosody, and evaluating and comparing parsing models.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §1
- What is the general annotation method used for both tagging and bracketing in the Penn Treebank?Hand correction of the output of an errorful automatic process: a stochastic tagger, then a parser, produce a first pass that annotators correct.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §1
2.1 A simplified POS tagset for English
- How did the Penn Treebank tagset differ in size from earlier tagsets, and why?It is much smaller: 36 POS tags plus 12 for punctuation and symbols, versus 87 simple tags in the Brown Corpus (and about 135–197 in LOB, UCREL, London-Lund). The project’s stochastic orientation made sparse data a concern.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
- What is lexical recoverability, and how did it shrink the tagset?Distinctions recoverable from the word itself needn’t be tags. Brown tagged forms of have, be and do with their own tags (HV, BEM, BER, BEDZ, DOD…); the Penn Treebank tags them like other verbs (VB, VBD, VBZ…), and collapses pre-qualifiers, pre-quantifiers and both into PDT.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
- What is syntactic recoverability? Give two examples.Distinctions recoverable from the parse tree aren’t tagged. Subject and object pronouns are both PRP; subordinating conjunctions and prepositions are both IN, since the former precede clauses and the latter noun phrases.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
- Why does a smaller tagset improve consistency?Fewer distinctions mean fewer chances of inconsistent tagging. Brown always tagged there and now as RB but tagged here and then inconsistently as RB or RN even in identical contexts.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
- How does the Penn Treebank tag by syntactic function where Brown didn’t?It encodes a word’s function in its tag when possible: one heading a noun phrase is NN (not CD); both is PDT in “both the boys”, RB in “the boys both”, NNS in “both of the boys”, CC in “both boys and girls”.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
- In which case did the Penn Treebank split a Brown category instead of merging?The bare form of verbs: VB (infinitive or imperative) is distinguished from VBP (non-third-person singular present), since tensed and untensed clauses differ.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
- How does the Penn Treebank handle words whose tag can’t be decided?To avoid arbitrary decisions, a word may get multiple tags, e.g. JJ|NN (adjective or noun as prenominal modifier), JJ|VBG, JJ|VBN, NN|VBG, RB|RP, signalling true indeterminacy or annotator uncertainty.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.1
2.2 The POS tagset
- Give the Penn Treebank verb tags.
VB base form (infinitive, imperative) VBD past tense VBG gerund or present participle VBN past participle VBP non-3rd person singular present VBZ 3rd person singular present MD modal - Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.2
- Give the Penn Treebank noun and pronoun tags.
NNP, NNPS and PRP replaced earlier NP, NPS and PP to avoid confusion with the phrase labels NP and PP.NN singular or mass noun NNS plural noun NNP singular proper noun NNPS plural proper noun PRP personal pronoun PRP$ possessive pronoun WP wh-pronoun - Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.2
- How are contractions and the possessive ’s tokenized in the Penn Treebank?Split into morphemes, each tagged separately (no compound tags as in Brown’s PPSS+BEM): children’s → children/NNS ’s/POS; won’t → wo/MD n’t/RB.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.2
2.3 The POS tagging process
- How was the tagged corpus produced?Automatic tagging (initially Church’s stochastic PARTS tagger, mapped to the Penn tagset; later a cascade of stochastic and rule-based taggers), then manual correction by annotators in a GNU Emacs interface.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.3
- Why did annotators append corrected tags (word/OLD*/NEW) rather than replace them?To make recurring errors of the automatic stage easy to identify, giving confusion matrices useful for designing better taggers.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.3
- Why did mapping PARTS output to the Penn tagset introduce errors?PARTS didn’t make some Penn distinctions: infinitives vs non-third-person present verbs (VB vs VBP), and prepositions vs particles (run up a hill vs run up a bill).
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §2.3
3 Two modes of annotation: an experiment
- What did the experiment comparing manual tagging with correcting automatic output find?Correcting was better on all counts: about twice as fast as tagging from scratch, with roughly half the inter-annotator disagreement, and higher accuracy against a benchmark.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §3
- How did the experiment measure consistency versus accuracy?Consistency: inter-annotator disagreement rate (pairwise disagreements over words). Accuracy: disagreement with a carefully hand-corrected benchmark version of the texts, since consistency says nothing about validity.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §3
4.1 Bracketing: basic methodology
- Why was Hindle’s Fidditch parser well suited as a preprocessor for hand bracketing?It always gives exactly one analysis; it never attaches a constituent whose role it can’t determine with certainty, leaving a string of tree fragments; and its chunks are usually accurate. Annotators mainly “glue” fragments together.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.1
- Which attachments does Fidditch leave undone, and why?Prepositional phrases, relative clauses and adverbial modifiers (they need extra-syntactic information), arguments vs adjuncts like infinitives (no large verb lexicon), and conjunction scope; every comma breaks the input into chunks since decisions are local. It does attach of-PPs right after a noun.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.1
4.2 The syntactic tagset
- Give some Penn Treebank phrase labels.
S simple declarative clause SBAR clause introduced by a subordinating conjunction or 0 SBARQ direct wh-question SINV declarative with subject–aux inversion NP, VP, PP, ADJP, ADVP noun, verb, prepositional, adjective, adverb phrase X constituent of unknown or uncertain category - Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.2
- What null elements does the Penn Treebank include, and why keep them?E.g. * (“understood” subject of infinitives or imperatives), 0 (zero that), T (trace of a moved wh-constituent). Fidditch supplies them cheaply, and they help recover predicate–argument structure (e.g. verb transitivity) from a flat context-free notation.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.2
- How can fine distinctions be recovered from skeletal bracketing?By searching combinations of structures: an SBAR with to right before the VP is infinitival; one with a tensed verb or auxiliary is tensed; that-clauses are SBARs starting with that or 0.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.2
4.3 Sample bracketing output
- What did the early bracketing experiment find about annotation detail?Annotators were much faster correcting a simplified, skeletal structure; argument vs adjunct distinctions were hard and couldn’t be made consistently. So a skeletal representation without a forced argument/adjunct distinction was adopted.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.3
- How is Fidditch’s output simplified before correction?POS tags, non-branching lexical nodes and some phrasal nodes (notably NBAR) are removed, flattening the structure; NP-internal structure up through the head is left unannotated. Illustration (not from the paper):
( (S (NP The annotators) (VP glued (NP the fragments) (PP into (NP one tree))) .))- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.3
- What are the X label and pseudo-attachment for?Letting annotators mark only structure they are sure of: X brackets a constituent of uncertain category; pseudo-attachment marks a constituent’s alternative attachment site, for “permanent predictable ambiguities” (where both attachments mean the same thing) and for the underlying position of extraposed elements.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.3
- Why were ADJP brackets inside NPs left in the simplified structure for annotators to delete?Coordinated adjective phrases inside NPs must be bracketed, and deleting brackets with the mouse is much faster than creating them, so it was more efficient to leave ADJPs in and remove the unneeded ones.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §4.3
5.2 Future directions
- Name early uses of the Penn Treebank.Training stochastic parsers and POS taggers, inside–outside re-estimation from partially bracketed text, using prosody to disambiguate parses, bootstrapping lexicons, and finding examples for linguistic theory with tgrep, a fast tree-pattern search tool.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §5.2
- What limitations of the 1993 annotation scheme did the authors acknowledge?Its essentially context-free representation leaves many argument/adjunct relations unmarked (e.g. complements after a sentential adverb get “trapped”), and some category schemes are inconsistent. Users wanted richer, less skeletal annotation and explicit predicate–argument structure (logical subject and object), planned for the next phase.
- Marcus et al., 1993, Building a Large Annotated Corpus of English (Computational Linguistics), §5.2
Source
- Mitchell P. Marcus, Beatrice Santorini and Mary Ann Marcinkiewicz. 1993. Building a Large Annotated Corpus of English: The Penn Treebank. In Computational Linguistics, pp. 313–330. https://aclanthology.org/J93-2004/