pith. sign in

arxiv: cs/0009026 · v1 · submitted 2000-09-27 · 💻 cs.CL

An improved parser for data-oriented lexical-functional analysis

classification 💻 cs.CL
keywords lfg-dopaccuracyestimatorfrequencyparseparserperformssearch
0
0 comments X
read the original abstract

We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi n best search performs about 100 times faster than Monte Carlo search while both achieve the same accuracy; (2) the DOP hypothesis which states that parse accuracy increases with increasing fragment size is confirmed for LFG-DOP; (3) LFG-DOP's relative frequency estimator performs worse than a discounted frequency estimator; and (4) LFG-DOP significantly outperforms Tree-DOP is evaluated on tree structures only.

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.