[PDF] Top 20 Syntactic Parsing for Ranking Based Coreference Resolution

... mention- ranking model, which imposes a ranking on the candidate antecedents and therefore cap- tures the competition among them ...supervised coreference model that can address all of the ... See full document

... The first step for coreference resolution is to identify mentions from a sequence of words. We have tried the machine-learning method detecting the bound- ary of a mention. But the recall cannot reach a ... See full document

... For preparation, all the documents in the corpus are preprocessed automatically using a pipeline of NLP components, including tokenization and sentence segmentation, named entity recognition, part-of- speech tagging and ... See full document

... performance based on this information, as well as that of Denis et ...and coreference predic- tions using ...decode based on independently trained classifiers (as in Denis et ...downstream ... See full document

... Deficiencies in markables’ extraction and spurious values for syntactic features decrease the system’s precision in the similar way as they affect its recall (see Section 2.1. above). Finally, around 5% of the ... See full document

... the coreference classifiers and the ranking ...Our ranking model, when trained to opti- mize for F-measure using both partition-based fea- tures and method-based features, consistently ... See full document

... in parsing, such as incorrectly tagged noun phrases, zero anaphors ...pronoun resolution precision to ...to parsing accuracy in the ...of coreference chains in order to label the first mention ... See full document

... Modern NLP research, including research fo- cused on Chinese, often relies on automatically pro- duced analytics, or annotations, from multiple stages of linguistic analysis. Downstream systems, such as sentiment ... See full document

... of coreference res- olution. However, current neural coreference models are typically trained with heuristic loss functions that are computed over a sequence of local ...learning based ... See full document

... Using machine-generated parse trees eliminates the need of hand-labeled trees in a coreference system. How- ever, it is a major challenge to extract useful informa- tion from these noisy parse trees. Our approach ... See full document

... According to previous work (Haghighi and Klein, 2009; Ratinov and Roth, 2012; Lee et al., 2013), antecedents are resolved by different categories of information for different mentions. For example, the Stanford system ... See full document

... dled through the “others” model) are much more challenging: they rely on lexical semantic and world knowledge, which is only partially encoded via our WordNet-based features. Finally, note that the reso- lution of ... See full document

... Given the heuristic nature of canonical mappings, we studied their properties by experimenting with them within support vector machines and with the data set provided by CoNLL shared tasks (Carreras and M ` arquez 2005). ... See full document

... Context-free grammars (CFGs) are widely used to describe the grammar structures in natural language processing. And probabilistic context-free grammars (PCFGs) directly add the probabilities to the rules. But it is ... See full document

... same entity simply from the properties of the pair alone. As an example, consider the pair of a non-pronoun and its pronominal antecedent can- didate. The pronoun itself gives few clues for the reference determination. ... See full document

... In this study, we have examined different error types that are characteristic for Russian anaphora resolvers. Russian, as a relatively underresourced language with rich morphology, poses challenging issues, such as a ... See full document

... made based on the preceding part of the ...anaphora resolution. Anaphora resolution in dis- course is the task or process of identifying the referents of expressions which we use to denote discourse ... See full document

... Mutant match (domain specific). Knowing whether a protein or gene is mutated (i.e. altered by substituting, deleting, adding, etc., a section of the amino acids that make up a protein) is crucial to understanding ... See full document

... For the open challenge, because we did not mod- ify the syntactic training data, its results are the same as the closed ones. We can, therefore, examine the effect of the additional training data on SRL. We can ... See full document

... for coreference resolution: one link component computes how likely a mention is coreferential with a candidate entity; the other compo- nent, called creation model, computes the probability that a mention ... See full document