Refine
Document Type
- Conference Proceeding (3)
- Part of a Book (1)
Language
- English (4)
Has Fulltext
- yes (4)
Is part of the Bibliography
- no (4)
Keywords
- Grammatiktheorie (1)
- Implementierung <Informatik> (1)
- Lexical Resource Semantics (1)
- Speicherverwaltung (1)
- Sprachlogik (1)
- Syntaktische Analyse (1)
- Type-Token-Relation (1)
- role labeling (1)
- speech tagging (1)
- time annotation (1)
Institute
- Extern (1)
This report explores the question of compatibility between annotation projects including translating annotation formalisms to each other or to common forms. Compatibility issues are crucial for systems that use the results of multiple annotation projects. We hope that this report will begin a concerted effort in the field to track the compatibility of annotation schemes for part of speech tagging, time annotation, treebanking, role labeling and other phenomena.
This paper summarizes the architecture of Lexical Resource Semantics (LRS). It demonstrates how to encode the language of two-sorted theory (Ty2; Gallin, 1975) in typed feature logic (TFL), and then presents a formal constraint language that can be used to extend conventional description logics for TFL to make direct reference to Ty2 terms. A reduction of this extension to Constraint Handling Rules (CHR; Fruehwirth & Abdennadher, 1997) for the purposes of implementation is also presented.
This paper seeks to improve HPSG engineering through the design of more terse, readable and intuitive type signatures. It argues against the exclusive use of IS-A networks and, with reference to the English Resource Grammar, demonstrates that a collection of higher-order datatypes are already acutely in demand in contemporary HPSG design. Some default specification conventions to assist in maximizing the utility of higher-order type constructors are also discussed.
We consider two alternatives for memory management in typed-feature-structure-based parsers by identifying structural properties of grammar signatures that may be of some predictive value in determining the consequences of those alternatives. We define these properties, summarize the results of a number of experiments on artificially constructed signatures with respect to the relative rank of their asymptotic cost at parse-time, and experimentally consider how they impact memory management.