Computer Science – Computation and Language
Scientific paper
1996-06-17
Computer Science
Computation and Language
16 pages, Postscript; to appear in Proceedings Fourth Workshop on Very Large Corpora (WVLC-4)
Scientific paper
In this paper I present ongoing work on the data-oriented parsing (DOP) model. In previous work, DOP was tested on a cleaned-up set of analyzed part-of-speech strings from the Penn Treebank, achieving excellent test results. This left, however, two important questions unanswered: (1) how does DOP perform if tested on unedited data, and (2) how can DOP be used for parsing word strings that contain unknown words? This paper addresses these questions. We show that parse results on unedited data are worse than on cleaned-up data, although very competitive if compared to other models. As to the parsing of word strings, we show that the hardness of the problem does not so much depend on unknown words, but on previously unseen lexical categories of known words. We give a novel method for parsing these words by estimating the probabilities of unknown subtrees. The method is of general interest since it shows that good performance can be obtained without the use of a part-of-speech tagger. To the best of our knowledge, our method outperforms other statistical parsers tested on Penn Treebank word strings.
No associations
LandOfFree
Two Questions about Data-Oriented Parsing 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 Two Questions about Data-Oriented Parsing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Questions about Data-Oriented Parsing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-586484