Computer Science – Computation and Language
Scientific paper
1994-11-14
Computer Science
Computation and Language
Extension of KONVENS94 publication, 10 pages, PostScript
Scientific paper
Unbounded dependencies are often modelled by ``traces'' (and ``gap threading'') in unification-based grammars. Pollard and Sag, however, suggest an analysis of extraction based on lexical rules, which excludes the notion of traces (P&S 1994, Chapter 9). In parsing, it suggests a trade of indeterminism for lexical ambiguity. This paper provides a short introduction to this approach to extraction with lexical rules, and illustrates the linguistic power of the approach by applying it to particularly idiosyncratic Dutch extraction data.
No associations
LandOfFree
Extraction in Dutch with Lexical Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Extraction in Dutch with Lexical Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extraction in Dutch with Lexical Rules will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-194650