2026-09-20T09:36:34Zhttps://digital.lib.washington.edu/server/oai/request

oai:digital.lib.washington.edu:1773/331942026-02-15T22:31:35Zcom_1773_4888col_1773_4936

Bender, Emily M Packard, Woodley 2015-05-11T20:58:06Z 2015-05-11T20:58:06Z 2015-05-11 2015 Packard_washington_0250O_14216.pdf http://hdl.handle.net/1773/33194 Thesis (Master's)--University of Washington, 2015 In 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. application/pdf en_US Copyright is held by the individual authors. annotation; grammar; HPSG; treebank Linguistics Computer science linguistics Full Forest Treebanking Thesis Open Access open.access