Backoff DOP: Parameter Estimation by Backoff
نویسندگان
چکیده
The Data Oriented Parsing (DOP) model currently achieves state-ofthe-art parsing on benchmark corpora. However, existing DOP parameter estimation methods are known to be biased, and ad hoc adjustments are needed in order to reduce the effects of these biases on performance. This paper presents a novel estimation procedure that exploits a unique property of DOP: different derivations can generate the same parse-tree. We show that the different derivations represent different “Markov orders” that the DOP model interpolates together. The idea behind the present method is to combine the different derivation orders by backoff instead of interpolation. This allows for a novel estimation procedure that employs Katz backoff for estimation. We report on experiments showing error reduction of up to 15% with respect to earlier methods.
منابع مشابه
Structured Parameter Estimation for LFG-DOP using Backoff
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the result of ad hoc adjustments than correct probabilistic generalization over the data. In recent work, we developed a new estimation procedure, called Backoff Estimation, for DOP models that are based on Phrase-Structur...
متن کاملOn the Statistical Consistency of DOP Estimators
A statistical estimator attempts to guess an unknown probability distribution by analyzing a sample from this distribution. One desirable property of an estimator is that its guess is increasingly likely to get arbitrarily close to the actual distribution as the sample size increases. This property is called consistency. Data Oriented Parsing (DOP) employs all fragments of the trees in a traini...
متن کاملAn Efficient Backoff Algorithm Based on the Theory of Confidence Interval Estimation
Channel state estimation-based backoff algorithms for channel access are being widely studied to solve wireless channel accessing and sharing problem especially in super dense wireless networks. In such algorithms, the precision of the channel state estimation determines the performance. How to make the estimation accurate in an efficient way to meet the system requirements is essential in desi...
متن کاملDynamic P-Persistent Backoff for Higher Efficiency and Implicit Prioritization
This article studies the efficiency of backoff algorithms. The fraction of channel time devoted to successful transmissions is maximized when the stations choose the optimal transmission probability. The binary exponential backoff algorithm does not come close to optimal channel efficiency, thus a new backoff mechanism that attains near-optimal efficiency is proposed. This algorithm is called D...
متن کاملA New Distributed Contention Control Protocol for the IEEE 802.11 MAC Layer - Project of ATCRC Application Programms
The famous binary backoff algorithm in IEEE 802.11 MAC layer can forget the contention level between each successfully transmitted data frame and hence suffers significant performance degradation when the contention level is high. In IEEE 802.11 standard, a distributed contention control (DCC) algorithm is proposed to address this problem by observing how many of slots in the last backoff perio...
متن کامل