pith. sign in

arxiv: cs/9906005 · v1 · submitted 1999-06-02 · 💻 cs.CL · cs.LG

Memory-Based Shallow Parsing

classification 💻 cs.CL cs.LG
keywords chunkingmemory-baseddetectionparsingshallowapproachcompetitiveexperiments
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.