This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories during preprocessing of a grammar as proposed elsewhere.As a result, it constructs a minimal size of GOTO/ACTION table and eliminates the necessity of search for GOTO table entries during parsing.

No abstract

This paper analyzes deictic motion verbs in various languages using Talmy's framework, and isolates the Path of motion expressed by these verbs. It is argued that the different interpretations of the Path so discovered are attributable to the lexical meaning of deictic motion verbs as well as locative phrases. Furthermore, deictic motion verbs are claimed to be lexically specified for the entailment of arrival only if they express the Path eventually directed to the deictic center. The arrival-time and departure-time interpretations of cooccurring point-of-time expressions are shown to coincide with the entailment of arrival, or the lack thereof, which is inherent to the semantics of deictic motion verbs.

No abstract

Lexical rules are used in constraintbased grammar formalisms such as llead-Driven l)hrase Structure Grammar (IIPSG) (Pollard and Sag 1994) to express generalizations atnong lexical entries. '['his paper discusses a number of lexical rules from recent I[PSG analyses of German (tlinri<;hs and Nakazawa 1994) and shows that the grammar in some cases vastly overgenerates and in other cases introduces massive spurious structural ambiguity, if lexical rules ap: ply under unification. Such l)rot)lems of overgeneration or spurious ambiguity do not arise, if a lexical rule al)plies to a given lexical ent;ry iff the lexical entry is subsumed by the left:hand side of the lexical rule. I,'inally, the paper discusses computational consequcnce~s of at)plying lexical rules under subsuml)tion.