Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Utilising the LDOCE grammar codes
Computational lexicography for natural language processing
The logic of typed feature structures
The logic of typed feature structures
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Feature structures and nonmonotonicity
Computational Linguistics - Special issue on inheritance: I
Inheritance in natural language processing
Computational Linguistics - Special issue on inheritance: I
Skeptical and credulous default unification with applications to templates and inheritance
Inheritance, defaults and the lexicon
A practical approach to multiple default inheritance for unification-based lexicons
Inheritance, defaults and the lexicon
LKB encoding of lexical knowledge
Inheritance, defaults and the lexicon
Defaults in lexical representation
Inheritance, defaults and the lexicon
Estimating lexical priors for low-frequency morphologically ambiguous forms
Computational Linguistics
DATR: a language for lexical knowledge representation
Computational Linguistics
Lexical Operations in a Unification-Based Framework
Proceedings of the First SIGLEX Workshop on Lexical Semantics and Knowledge Representation
A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
Computational Linguistics
Introduction to the special issue on computational linguistics using large corpora
Computational Linguistics - Special issue on using large corpora: I
A computational treatment of lexical rules in HPSG as covariation in lexical entries
Computational Linguistics
Default representation in constraint-based frameworks
Computational Linguistics
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Integrating symbolic and statistical representations: the lexicon pragmatics interface
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Discourse relations and defeasible knowledge
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Memoization of coroutined constraints
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Constraint-based Categorial Grammar
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Enjoy the paper: lexical semantics via lexicology
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Understanding metonymies in discourse
Artificial Intelligence
Verb class disambiguation using informative priors
Computational Linguistics
Using an ontology to determine English countability
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Syntactic features and word similarity for supervised metonymy resolution
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Transformational priors over grammars
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Metonymy resolution as a classification task
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Hi-index | 0.00 |
Lexical rules have been used to cover a very diverse range of phenomena in constraint-based grammars. Examination of the full range of rules proposed shows that Carpenter's (1991) postulated upper bound on the length of list-valued attributes such as SUBCAT in the lexicon cannot be maintained, leading to unrestricted generative capacity in constraint-based formalisms utilizing HPSG-style lexical rules. We argue that it is preferable to subdivide such rules into a class of semiproductive lexically governed genuinely lexical rules, and a class of fully productive unary syntactic rules.We develop a restricted approach to lexical rules in a typed default feature structure (TDFS) framework (Lascarides et al. 1995; Lascarides and Copestake 1999), which has enough expressivity to state, for example, rules of verb diathesis alternation, but which does not allow arbitrary manipulation of list-valued features. An interpretation of such lexical rules within a probabilistic version of a TDFS-based linguistic (lexical and grammatical) theory allows us to capture the semiproductive nature of genuinely lexical rules, steering an intermediate course between fully generative or purely abbreviatory rules.We illustrate the utility of this approach with a treatment of dative constructions within a linguistic framework that borrows insights from the constraint-based theories: HPSG, UCG, (Zeevat, Klein, and Calder 1987) and construction grammar (Goldberg 1995). We end by outlining how our approach to lexical rules allows for a treatment of passive and recursive affixation, which are generally assumed to require unrestricted list manipulation operations.