Show simple item record

dc.contributor.advisorBender, Emily Men_US
dc.contributor.authorPackard, Woodleyen_US
dc.date.accessioned2015-05-11T20:58:06Z
dc.date.available2015-05-11T20:58:06Z
dc.date.submitted2015en_US
dc.identifier.otherPackard_washington_0250O_14216.pdfen_US
dc.identifier.urihttp://hdl.handle.net/1773/33194
dc.descriptionThesis (Master's)--University of Washington, 2015en_US
dc.description.abstractIn this thesis, I present a new method of producing treebanks using constraint-based grammars. Rather than requiring an explicitly enumerated set of candidate analyses per utterance, my method works from an implicit representation, allowing the annotator to efficiently select the correct analysis from trillions of possibilities, without requiring the user or the computer to store or iterate over all of them. I explain the advantages and disadvantages of this method, and show the details and motivation for the algorithms that make it possible. Relative to comparable prior art (i.e. top-N treebanking), my solution enables higher coverage treebanks without a significant reduction in annotation speed, and reduces storage and computational resource consumption.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoen_USen_US
dc.rightsCopyright is held by the individual authors.en_US
dc.subjectannotation; grammar; HPSG; treebanken_US
dc.subject.otherLinguisticsen_US
dc.subject.otherComputer scienceen_US
dc.subject.otherlinguisticsen_US
dc.titleFull Forest Treebankingen_US
dc.typeThesisen_US
dc.embargo.termsOpen Accessen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record