1994 AdjunctsAndTheProcessingOfLexicalRules

• (van Noord & Bouma, 1994) ⇒ Gertjan van Noord, Gosse Bouma. (1994). “Adjuncts and the Processing of Lexical Rules.” In: Proceedings of the 15th conference on Computational Linguistics. doi:10.3115/991886.991928

Subject Headings: Lexical Rule, Adjunct.

Quotes

Abstract

• The standard HPSG analysis of Germanic verb clusters can not explain the observed narrow scope readings of adjuncts in such verb clusters. We present an extension of the HPSG analysis that accounts for the systematic ambiguity of the scope of adjuncts in verb cluster constructions, by treating adjuncts as members of the subcat list. The extension uses powerful recursive lexical rules, implemented as complex constraints. We show how 'delayed evaluation' techniques from constraint-logic programming can be used to process such lexical rules.

3.1 Lexical Rules as Constraints on Lexical Categories

• Rather than formalizing the 'add-adjuncts' rule as a lexical rule we propose to use recursive constraints on lexical categories. Such lexical constraints are then processed using delayed ewduation techniques. (Refer to Carpenter (1991) for a proof of Turing equivalence of simple eategorial grammar with recurslve lexical rules.)

References

• (Carpenter, 1991) ⇒ Bob Carpenter. (1991). “The Generative Power of Categorical Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules.” Computational Linguistics, 17(3).
• …,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
1994 AdjunctsAndTheProcessingOfLexicalRules	Gertjan van Noord Gosse Bouma			Adjuncts and the Processing of Lexical Rules		Proceedings of the 15th conference on Computational Linguistics	http://www.aclweb.org/anthology-new/C/C94/C94-1039.pdf	10.3115/991886.991928		1994