# Memory-Based Shallow Parsing

Source: [Memory-Based Shallow Parsing](<https://www.sota2.com/research/paper/68fa5fa31e209131ce9eb469>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:23:46.321Z

Authors: Walter Daelemans, Sabine Buchholz, Jorn Veenstra

Published: 1999-06-02T13:48:48.000Z

## Abstract

We present a memory-based learning (MBL) approach to shallow parsing in which POS tagging, chunking, and identification of syntactic relations are formulated as memory-based modules. The experiments reported in this paper show competitive results, the F-value for the Wall Street Journal (WSJ) treebank is: 93.8% for NP chunking, 94.7% for VP chunking, 77.1% for subject detection and 79.0% for object detection.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cs/9906005>)

[PDF](<https://arxiv.org/pdf/cs/9906005.pdf>)
