Show simple item record

dc.contributor.advisorBender, Emily M.en_US
dc.contributor.authorSlayden, Glenn C.en_US
dc.date.accessioned2012-09-13T17:34:27Z
dc.date.available2012-09-13T17:34:27Z
dc.date.issued2012-09-13
dc.date.submitted2012en_US
dc.identifier.otherSlayden_washington_0250O_10255.pdfen_US
dc.identifier.urihttp://hdl.handle.net/1773/20770
dc.descriptionThesis (Master's)--University of Washington, 2012en_US
dc.description.abstractConstraint-based grammar formalisms such as Head-Driven Phrase Structure Grammar (HPSG) model linguistic entities as sets of attribute-value tuples headed by types drawn from a connected multiple-inheritance hierarchy. These <italic>typed feature structures</italic> (TFSes) describe directed graphs, allowing for the application of graph-theoretic analyses. In particular, graph <italic>unification</italic>--the computation of the most general structure that is consistent with a set of argument graphs (if such a structure exists)--can be interpreted as expressing the satisfiability and combination functions for the represented linguistic entities, thus providing a principled method for describing syntactic elaboration. In competent natural language grammars, however, the graphs are typically large and numerous, and computational efficiency is a key engineering concern. This thesis describes a method for the storage of typed feature structures where each TFS comprises a self-contained, contiguous memory allocation with a tabular internal structure. Also detailed is an efficient unification algorithm for this storage mode. The techniques are evaluated in <italic>agree</italic>, a new managed-execution concurrent unification chart parser which supports both syntactic analysis (parsing) and surface realization (generation) within the framework of the DELPH-IN (Deep Linguistic Processing with HPSG Initiative) joint reference formalism.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoen_USen_US
dc.rightsCopyright is held by the individual authors.en_US
dc.subjecttyped feature structure; unification grammaren_US
dc.subject.otherLinguisticsen_US
dc.subject.otherComputer scienceen_US
dc.subject.otherLinguisticsen_US
dc.titleArray TFS storage for unification grammarsen_US
dc.typeThesisen_US
dc.embargo.termsNo embargoen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record