dc.contributor.advisor | Bender, Emily M. | en_US |
dc.contributor.author | Slayden, Glenn C. | en_US |
dc.date.accessioned | 2012-09-13T17:34:27Z | |
dc.date.available | 2012-09-13T17:34:27Z | |
dc.date.issued | 2012-09-13 | |
dc.date.submitted | 2012 | en_US |
dc.identifier.other | Slayden_washington_0250O_10255.pdf | en_US |
dc.identifier.uri | http://hdl.handle.net/1773/20770 | |
dc.description | Thesis (Master's)--University of Washington, 2012 | en_US |
dc.description.abstract | Constraint-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.mimetype | application/pdf | en_US |
dc.language.iso | en_US | en_US |
dc.rights | Copyright is held by the individual authors. | en_US |
dc.subject | typed feature structure; unification grammar | en_US |
dc.subject.other | Linguistics | en_US |
dc.subject.other | Computer science | en_US |
dc.subject.other | Linguistics | en_US |
dc.title | Array TFS storage for unification grammars | en_US |
dc.type | Thesis | en_US |
dc.embargo.terms | No embargo | en_US |