Applying co-training to reference resolution

DMCA

Applying co-training to reference resolution (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Christoph Müller , Michael Strube

Venue:	In Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Citations:	30 - 1 self

Citations

1633	Combining labeled and unlabeled data with co-training - Blum, Mitchell - 1998 (Show Context) Citation Context ...s the need for an unknown amount of annotated training data for optimal performance. So, researchers in NLP began to experiment with weakly supervised machine learning algorithms such as Co-Training (=-=Blum and Mitchell, 1998-=-). Among others Co-Training was applied to document classification (Blum and Mitchell, 1998), namedentity recognition (Collins and Singer, 1999), noun phrase bracketing (Pierce and Cardie, 2001), and ...
845	Assessing agreement on classification tasks: the kappa statistic,” - Carletta - 1996 (Show Context) Citation Context ...s with the same value in this attribute are considered coreferring expressions. The annotation was performed by two students. The reliability of the annotations was checked using the kappa statistic (=-=Carletta, 1996-=-). 4.2 Coreference resolution as binary classification The problem of coreference resolution can easily be formulated in such a way as to be amenable to CoTraining. The most straightforward definition...
832	The string-to-string correction problem - Wagner, Fischer - 1974 (Show Context) Citation Context ...ce (MED) computes the similarity of strings by taking into account the minimum number of editing operations (substitutions s, insertions i, deletions d) needed to transform one string into the other (=-=Wagner and Fischer, 1974-=-). The MED is computed from these editing operations and the length of the potential antecedent m or the length of the anaphor n. 3 Co-Training Co-Training (Blum and Mitchell, 1998) is a metalearning ...
215	A model-theoretic coreference scoring scheme. - Vilain, Burger, et al. - 1995
161	A statistical approach to anaphora resolution. - Ge, Hale, et al. - 1998 (Show Context) Citation Context ...g expressions. Among referring expressions, pronouns and definite noun phrases (NPs) are the most prominent. Supervised machine learning algorithms were used for pronoun resolution with good results (=-=Ge et al., 1998-=-), and for definite NPs with fairly good results (Aone and Bennett, 1995; McCarthy and Lehnert, 1995; Soon et al., 2001). However, the deficiency of supervised machine learning approaches is the need ...
153	Using decision trees for coreference resolution. - McCarthy, Lehnert - 2005 (Show Context) Citation Context ...the most prominent. Supervised machine learning algorithms were used for pronoun resolution with good results (Ge et al., 1998), and for definite NPs with fairly good results (Aone and Bennett, 1995; =-=McCarthy and Lehnert, 1995-=-; Soon et al., 2001). However, the deficiency of supervised machine learning approaches is the need for an unknown amount of annotated training data for optimal performance. So, researchers in NLP beg...
120	Evaluating automated and manual acquisition of anaphora resolution strategies. - Aone, Bennett - 1995 (Show Context) Citation Context ... noun phrases (NPs) are the most prominent. Supervised machine learning algorithms were used for pronoun resolution with good results (Ge et al., 1998), and for definite NPs with fairly good results (=-=Aone and Bennett, 1995-=-; McCarthy and Lehnert, 1995; Soon et al., 2001). However, the deficiency of supervised machine learning approaches is the need for an unknown amount of annotated training data for optimal performance...
105	Hwee Tou Ng, and Daniel Chung Yong Lim. 2001. A machine learning approach to coreference resolution of noun phrases - Soon
101	Noun phrase coreference as clustering - Cardie, Wagstaff - 1999 (Show Context) Citation Context ...n et al., 2001). Unsupervised learning might be an alternative, since it does not need any annotation at all. However, the cost is the decrease in performance to about 53% F-measure on the same data (=-=Cardie and Wagstaff, 1999-=-) which may be unsuitable for a lot of tasks. In this paper we tried to pioneer a path between the unsupervised and the supervised paradigm by using the Co-Training meta-learning algorithm. The result...
33	A maximum entropy partial parser for unrestricted text - Skut, Brants - 1998 (Show Context) Citation Context ...lberg. The average length of the texts was 149 tokens. The texts were POS-tagged using TnT (Brants, 2000). A basic identification of markables (i.e. NPs) was obtained by using the NP-Chunker Chunkie (=-=Skut and Brants, 1998-=-). The POS-tagger was also used for assigning attributes to markables (e.g. the NP form). The automatic annotation was followed by a man-# 17. ana med minimum edit distance to 12 3"!$45%'&)(+* ,-*$.0...