Encoding lexicalized tree adjoining grammars with a nonmonotonic inheritance hierarchy

14Citations
Citations of this article
76Readers
Mendeley users who have this article in their library.

Abstract

This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an LTAG lexicon as an inheritance hierarchy with internal lexical rules. A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures. Such an approach eliminates the considerable redundancy otherwise associated with an LTAG lexicon.

Cite

CITATION STYLE

APA

Evans, R., Gazdar, G., & Weir, D. (1995). Encoding lexicalized tree adjoining grammars with a nonmonotonic inheritance hierarchy. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1995-June, pp. 77–84). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981658.981669

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free