This paper considers the second order properties of empirical likelihood for a parameter defined by moment restrictions, which is the framework operated upon by the Generalized Method of Moments. It is shown that the empirical likelihood defined for this general framework still admits the delicate second order property of Bartlett correction, which represents a substantial extension of all the ...

This paper explores the generation of artificial errors for correcting grammatical mistakes made by learners of English as a second language. Artificial errors are injected into a set of error-free sentences in a probabilistic manner using statistics from a corpus. Unlike previous approaches, we use linguistic information to derive error generation probabilities and build corpora to correct sev...

Data at different levels of aggregation are often used in two-stage estimation, with estimates obtained at the higher level of aggregation entering the estimation at the lower level of aggregation. An example is customers within markets: first-stage estimates on market data provide variables that enter the second-stage model on customers. We derive the asymptotic covariance matrix of the second...

The expression for ω 2,2,r (2t) in Theorem 9 is misprinted in the original publication of this article. It should have been the same as for ω 2,1,r (2t) in Theorem 11. The correct expression in Theorem 9 will be Theorem 9 For q = 2t where t is odd, we have ω 2,2,r (2t) = 1 2 (2 r − 1)(t r + 1) .

The paper introduces a new method for detecting and correcting errors in large dependency treebanks with rich morphosyntactic annotation. The technique uses error correction rules automatically extracted from the treebank. The procedure of rule extraction is based on a comparison of similar – but not identical – subgraphs of dependency structures. The outcome of applying the method to a 3-milli...

In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...

The MBONE provides an infrastructure for multicast communication on the internet based on IP. Several proposals have been made to create reliable multicast transport on top of the MBONE structure. Nearly all research on reliable multicast protocols for the MBONE focuses on ARQ error recovery. The counterpart of ARQ, FEC, does not guarantee 100% reliability but increases the reliability. The aim...

I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each N state quantum particle is encoded as five N state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is show...

The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be understood as a combination of Pauli operators acting on the system. Each quantum error correcting code allows a subset of these errors to be corrected. In m...

After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about the position of errors. This error model—the quantum erasure channel—is discussed. Finally, parameters of quantum BCH codes are provided.