We study the problem of event coreference resolution (ECR) that seeks to group coreferent event mentions into the same clusters. Deep learning methods have recently been applied for this task to deliver state-of-the-art performance. However, existing deep learning models for ECR are limited in that they cannot exploit important interactions between relevant objects for ECR, e.g., context words and entity mentions, to support the encoding of document-level context. In addition, consistency constraints between golden and predicted clusters of event mentions have not been considered to improve representation learning in prior deep learning models for ECR. This work addresses such limitations by introducing a novel deep learning model for ECR. At the core of our model are document structures to explicitly capture relevant objects for ECR. Our document structures introduce diverse knowledge sources (discourse, syntax, semantics) to compute edges/interactions between structure nodes for document-level representation learning. We also present novel regularization techniques based on consistencies of golden and predicted clusters for event mentions in documents. Extensive experiments show that our model achieve state-of-the-art performance on two benchmark datasets. Event coreference resolution (ECR) is the task of clustering event mentions (i.e., trigger words that evoke an event) in a document such that each cluster represents a unique real world event. For example, the three event mentions in Figure 1, i.e.,  refuse to sign ,  raised objections , and  doesn't sign , should be grouped into the same cluster to indicate their coreference to the same event. A common component in prior ECR models involves a binary classifier that receives a pair of event mentions and predict their coreference (Chen et al., 2009; Lu et al., 2016; Lu and Ng, 2017). To this end, an important step in ECR models is to transform event mention pairs into representation vectors to encode discriminative features for coreference prediction. Early work on ECR has achieved feature representation via feature engineering where multiple features are hand-designed for input event mention pairs (Lu and Ng, 2017). A major problem with feature engineering is the sparsity of the features that limits the generalization to unseen data. Representation learning in deep learning models has recently been introduced to address this issue, leading to more robust methods with better performance for ECR (Nguyen et al., 2016; Choubey and Huang, 2018; Huang et al., 2019; Barhom et al., 2019). As such, there are at least two limitations in existing deep learning models for ECR that will be addressed in this work to improve the performance. First, as event mentions pairs for coreference prediction might belong to long-distance sentences in documents, capturing document-level context between the event mentions (i.e., beyond the two sentences that host the event mentions) might present useful information for ECR. As their first limitation, prior deep learning models for ECR has only attempted to encode document-level context via hand-designed features (Kenyon-Dean et al., 2018; Barhom et al., 2019) that still suffer from the feature sparsity issue. In addition, such prior work is unable to exploit ECR-related objects in documents (e.g., entity mentions, context words) and their connections/interactions (possibly beyond sentence boundary) to aid representation learning. An example for the importance of context words, entity mentions, and their interactions for ECR can be seen in Figure 1. Here, to decisively determine the coreference of  raised objections  and  doesn't sign , ECR systems should recognize  Trump  and  the Donald Trump continued to refuse to sign a relief package agreed in Congress and headed instead to the golf course. Trump, who is spending the Christmas and New Year holiday at his Mar-a-Lago resort in Florida, raised objections to the $900bn relief bill only after it was passed by Congress last week, having been negotiated by his own treasury secretary Steven Mnuchin All these folks and their families will suffer if Trump doesn't sign the damn bill. Coreferential event mentions Coreferential entity mentions Figure 1: An example for event coreference resolution. $900bn relief bill  as the arguments of  raised objections , and  Trump  and  the damn bill  as the arguments of  doesn't sign . The systems should also be able to realize the coreference relation between the two entity mentions  Trump , and between  the $900bn relief bill  and  the damn bill  to conclude the same identity for the event mentions (i.e., as they involve the same arguments). As such, it is helpful to identify relevant entity mentions, context words and leverage their rela-tions/interactions to improve representation vectors for event mentions in ECR. Motivated by this issue, we propose to form graphs for documents (called document structures) to explicitly capture relevant objects and interactions for ECR that will be consumed to learn representation vectors for event mentions. In particular, context words, entity mentions, and event mentions will serve as the nodes in our document structures due to their intuitive relevance to ECR. Different types of knowledge sources will then be exploited to connect the nodes for the document structures, featuring discourse information (e.g., to connect coreferring entity men-tions), syntactic information (e.g., to directly link event mentions and their arguments), and semantic similarity (e.g., to connect words/event mentions with similar meanings). Such rich document structures allows us to model the interactions of relevant objects for ECR beyond sentence level for document-level context. Using graph convolutional neural networks (GCN) (Kipf and Welling, 2017; Nguyen and Grishman, 2018) for representation learning, we expect enriched representation vectors from the document structures can further improve the performance of ECR systems. To our knowledge, this is the first time that rich document structures are employed for ECR. Second, prior deep learning models for ECR fails to leverage consistencies between golden clusters (provided by human) and predicted clusters (generated by models) to promote representation learning. In particular, it is intuitive that ECR models can achieve better performance if their predicted event clusters are more similar to the golden event clusters in the data. To this end, we propose to obtain different inconsistency measures between golden and predicted clusters that will be incorporated into the overall loss function for minimization. As such, we expect that the consistency/similarity regularization between two types of clusters can provide useful training signals to improve representation vectors for event mentions in ECR. To our knowledge, this is also the first work to exploit cluster consistency-based regularization for representation learning in ECR. Finally, we conduct extensive experiments for ECR on the KBP benchmark datasets. The experiments demonstrate the benefits of the proposed methods and lead to state-of-the-art performance for ECR. Event coreference resolution is broadly related to works on entity coreference resolution that aim to resolve nouns phrases/mentions for entities (Raghu-nathan et al., 2010; Ng, 2010; Durrett and Klein, 2013; Lee et al., 2017a; Joshi et al., 2019b,a). However, resolving event mentions has been considered as a more challenging task than entity coreference resolution due to the more complex structures of event mentions (Yang et al., 2015). Our work focuses on the within-document setting for ECR where input event mentions are expected to appear in the same input documents; however, we also note prior works on cross-document ECR (Lee et al., 2012a; Adrian Bejan and Harabagiu, 2014; Choubey and Huang, 2017; Kenyon-Dean et al., 2018; Barhom et al., 2019; Cattan et al., 2020). As such, for within-document ECR, previous methods have applied feature-based models for pairwise classifiers (Ahn, 2006; Chen et al., 2009; Cybulska and Vossen, 2015; Peng et al., 2016), spectral graph clustering (Chen and Ji, 2009), information propagation (Liu et al., 2014), markov logic networks (Lu et al., 2016), joint modeling of ECR with event detection (Araki and Mi-tamura, 2015; Lu et al., 2016; Chen and Ng, 2016; Lu and Ng, 2017), and recent deep learning models (Nguyen et al., 2016; Choubey and Huang, 2018; Huang et al., 2019; Lu et al., 2020; Choubey et al., 2020). Compared to previous deep learning works for ECR, our model presents a novel representation learning framework based on document structures to explicitly encode important interactions between relevant objects, and representation regularization to exploit the cluster consistency between golden and predicted clusters for event mentions. Formally, in ECR, given an input document D = w 1 , w 2 , . . . , w N (of N words/tokens) with a set of event mentions E = { e 1 , e 2 , . . . , e | E | } , the goal is to group the event mentions in E into clusters to capture the coreference relation between mentions. Our ECR model consists of four major components: (i) Document Encoder to words into representation vectors, (ii) Document Structure to create graphs for documents and learn rich representation vectors for event mentions, (iii) End-to-end Resolution to simultaneously resolve the coreference for the entity mentions in D , and (iv) Cluster Consistency Regularization to regularize representation vectors based on consistency constraints between golden and predict event mention clusters. Figure 2 presents an overview of our model for ECR. In the first step, we transform each word w i  D into a representation vector x i by feeding D into the pre-trained language model BERT (Devlin et al., 2019). In particular, as BERT might split w i into several word-pieces, we average the hidden vectors of the word-pieces of w i in the last layer of BERT to obtain the representation vector x i for w i . To handle long documents with BERT, we divide D into segments of 512 consecutive word-pieces that will be encoded separately. The resulting sequence X = x 1 , x 2 , . . . , x n for D is then sent to the next steps for further computation. This component aims to learn representation vectors for the event mentions in E using an interaction graph G = {N , E} for D that facilitates the enrichment of representation vectors for event mentions with relevant objects and interactions at document level. As such, the nodes and edges in G for our ECR problem are constructed as follows: Nodes : The node set N for our interaction graph G should capture relevant objects for the coreference between event mentions in D . Toward this goal, we consider all the context words (i.e., w i ), event mentions, and entity mentions in D as relevant objects for our ECR problem. For convenience, let M = { m 1 , m 2 , . . . , m | M | } be the set of entity mentions in D . The node set N for G is thus created by the union of D , E , and M : N = D  E  M = { n 1 , n 2 , . . . , n |N| } . To achieve a fair comparison, we use the predicted event mentions that are provided by (Choubey and Huang, 2018) in the datasets for E . The Stanford CoreNLP toolkit is employed to obtain the entity mentions M . Edges : The edges between the nodes in N for G will be represented by an adjacency matrix A = { a ij } i,j = |N| ( a ij  R ) in this work. As A will be consumed by Graph Convolutional Networks (GCN) to learn representation vectors for ECR, the value/score a ij between two nodes n i and n j in N is expected to estimate the importance (or the level of interaction) of n j for the representation computation of n i . This structure allows n i and n j of N to directly interact and influence the representation computation of each other even if they are sequentially far away from each other in D . As presented in the introduction, we explore three types of information to design the edges E (or compute the interaction scores a ij ) for G in our model, including discourse-based, syntax-based and semantic-based information. Discourse-based Edges : Due to multiple sentences and event/entity mentions involved in the input document D , we need to understand where such objects span and how they relate to each other to effectively encode document context for ECR. To this end, we propose to exploit three types of discourse information to obtain the interaction graph G , i.e., sentence boundary, coreference structure, and mention span for event/entity mentions in D . Sentence Boundary : Our motivation for this information is that event/entity mentions appearing Donald Trump continue refuse to sign . in the same sentences tend to be more contextually related to each other than those in different sentences. As such, event/entity mentions in the same sentences might involve more helpful information for the representation computation of each other in our problem. To capture this intuition, we compute the sentence boundary-based interaction score a sentij for the nodes n i and n j in N where a sentij = 1 if n i and n j are the event/entity mentions of the same sentences in D (i.e., n i , n j  E  M ); and 0 otherwise. We will use a sentij as an input to compute the overall interaction score a ij for G later. Entity Coreference Structure : Instead of considering within-sentence information as in a sentij , coreference structure focuses on the connection of entity mentions across sentences to enrich their representations with the contextual information of the coreferring ones. As such, to enable the interaction of representations for coreferring enity mentions, we compute the conference-based score a coref ij for each pair of nodes n i and n j to contribute to the overall score a ij for representation learning. Here, a corefij is set to 1 if n i and n j are coreferring entity mentions in D , and 0 otherwise. Note that we also use the Stanford CoreNLP toolkit to determine the coreference of entity mentions in this work. Mention Span : The sentence boundary and coreference structure scores model interactions of event and entity mentions in D based on discourse structure. To connect event and entity mentions to context words w i for representation learning, we employ the mention span-based interaction score a spanij as another input for a ij . Here, a spanij is only set to 1 (i.e., 0 otherwise) if n i is a word ( n i  D ) in the span of the entity/event mention n j ( n j  E  M ) or vice verse. a spanij is important as it helps ground representation vectors of event/entity mentions to the contextual information in D . Syntax-based Edges : We expect the dependency trees of the sentences in D to provide beneficial information to connect the nodes in N for effective representation learning in ECR. For example, dependency trees have been used to retrieve important context words between an event mentions and their arguments in prior work (Li et al., 2013; Veyseh et al., 2020a,b). To this end, we propose to employ the dependency relations/connections between the words in D to obtain a syntax-based interaction score a depij for each pair of nodes n i and n j in N , serving as an additional input for a ij . In particular, by inheriting the graph structures of the dependency trees of the sentences in D , we set a dep ij to 1 if n i and n j are two words in the same sentence (i.e., n i , n j  D ) and there is an edge between them in the corresponding dependency tree 1 , and 0 otherwise. Semantic-based Edges : This information leverages the semantic similarity of the nodes in N to enrich the overall interaction scores a ij for G . Our motivation is that a node n i will contribute more to the representation computation of another node n j for ECR if n i is more semantically related to n j . In particular, as the representation vectors for the nodes in N have captured the contextual semantics of the words in D , we propose to explore 1 We use Stanford CoreNLP to parse sentences. a novel source of semantic information that relies on external knowledge for the words to compute interaction scores between the nodes N in our document structures for ECR. We expect the external knowledge for the words to provide complementary information to the contextual information in D , thus further enriching the overall interaction scores a ij for the nodes in N . To this end, we propose to utilize WordNet (Miller, 1995), a rich network of word meanings, to obtain external knowledge for the words in D . The word meanings (i.e., synsets) in WordNet are connected to each other via different semantic relations (e.g., synonyms, hyponyms). In particular, our first step to generate knowledge-based similarity scores involves mapping each word node n i  D  N to a synset node M i in WordNet using a Word Sense Disambiguation (WSD) tool. In particular, we employ WordNet 3.0 and the state-of-the-art BERT-based WSD model in (Blevins and Zettlemoyer, 2020) to perform the word-synset mapping in this work. Afterward, we compute a knowledge-based similarity score a structij for each pair of word nodes n i and n j in D  N using the structure-based similarity of their linked synsets M i and M j in WordNet (i.e., a structij = 0 if either n i or n j is not a word node in D  N ). Accordingly, the Lin similarity measure (Lin et al., 1998) for synset nodes in WordNet is utilized for this purpose: a structij = 2  IC ( LCS ( M i ,M j )) IC ( M i )+ IC ( M j ) . Here, IC and LCS represent the information content of synset nodes and the least common sub-sumer of two synsets in the WordNet hierarchy (the most specific ancestor node) respectively 2 . Structure Combination : Up to now, five scores have been generated to capture the level of interactions in representation learning for each pair of nodes n i and n j in N according to different information sources (i.e., a sentij , a corefij , a spanij , a depij and a struct ij ). For convenience, we group the five scores for each node pair n i and n j into a vector d ij = [ a sentij , a corefij , a spanij , a depij , a structij ] of size 5. To combine the scores in d ij into an overall rich interaction score a ij for n i and n j in G , we use the following normalization: a ij = exp( d ij q T ) / (cid:88) u =1 2 We use the nltk tool to obtain the Lin similarity: https://www.nltk.org/howto/wordnet. html . We tried other WordNet-based similarities available in nltk (e.g., Wu-Palmer similarity), but the Lin similarity produced the best results in our experiments. Representation Learning : Given the combined interaction graph G with the adjacency matrix A = { a ij } i,j = |N| , we use GCNs to induce representation vectors for the nodes in N for ECR. In particular, our GCN model takes the initial representation vectors v i of the nodes n i  N as the input. Here, the initial representation vector v i for a word node n i  D is directly obtained from the BERT-based representation vector x c  X (i.e., v i = x c ) of the corresponding word w c for n i . In contrast, for event and entity mentions, their initial representation vectors are obtained by max-pooling the contextualized embedding vectors in X that correspond to the words in the event/entity men-tions' spans. For convenience, we organize v i into rows of the input matrix H 0 = [ v 1 , . . . , v |N| ] . The GCN model then involves G layers that generate the matrix H l at the l -th layer for the nodes in N ( 1  l  G ) via: H l = ReLU ( AH l  1 W l ) ( W l is the weight matrix for the l -th layer). The output of the GCN model after G layers is HG whose rows are denoted by HG = [ h 1 , . . . , h |N| ] , serving as more abstract representation vectors for the nodes n i in the coreference prediction for event mentions. Also, for convenience, let { r e 1 , . . . , r e | E | }  HG be the set of GCN-induced representation vectors for the event mention nodes in e 1 , . . . , e | E | in E . To facilitate the incorporation of the consistency regularization between golden and predicted clusters into the training process, we perform and end-to-end procedure that seeks to simultaneously resolve the coreference for the event mentions in E in a single process. Motivated by the entity coreference resolution in (Lee et al., 2017b), we implement the end-to-end resolution via a set of antecedent assignments for the event mentions in E . In particular, we assume that the event mentions in E are enumerated in their appearance order in D . As such, our model aims to link each event mention e i  E to one of its prior event mention in the set Y i = { (cid:15), e 1 , . . . , e i  1 } ( (cid:15) is a dumpy antecedent). Here, a link of e i to a non-dumpy antecedent e j in Y i represents a coreference relation between e i and e j . In contrast, a dumpy assignment for e i indicates that e i is not coreferent with any prior event mention. By forming a coreference graph with e i as the nodes, the non-dumpy antecedent assignments for every event mention in E can be utitlized to connect coreference event mentions. Connected components from the coreference graph can then be returned to serve as predicted event mention clusters in D . In order to predict the coreferent antecedent y i  Y for an event mention e i , we compute the distribution over the possible antecedents in Y i for e i via: P ( y i | e i , Y i ) = e s ( ei,yi ) (cid:80) y (cid:48)Y ( i ) e s ( ei,y (cid:48) ) where s ( e i , e j ) is a score function to determine the coreference likelihood between e i and e j in D . To this end, we set s ( e i , (cid:15) ) = 0 for all e i  E . Inspired by (Lee et al., 2017b), we obtain the score function s ( e i , e j ) for e i and e j by leveraging their GCN-induced representation vectors r e i and r e j via: s ( e i , e j ) = s m ( e i ) + s m ( e j ) + s c ( e i , e j ) + s a ( e i , e j ) s m ( e i ) = w (cid:62) m FF m ( r e i ) s c ( e i , e j ) = w (cid:62) a FF c ([ r e i , r e j , r e i (cid:12) r e j ]) s a ( e i , e j ) = r (cid:62) e i W c r e j where F m and FF c are two-layer feed-forward networks, w (cid:62) m and w (cid:62) a are learnable vectors, W c is a weight matrix, and (cid:12) is the element-wise multiplication. At the inference time, we employ the greedy decoding to predict the antecedent  y i for e i :  y i = argmax P ( y i | e i , Y i ) . For training, we use the negative log-likelihood as the loss function in our end-to-end framework: L pred =  (cid:80) | E | i =0 log P ( y  i | e i , Y i ) ( y  i  Y i is the golden antecedent for e i ). To further improve representation learning for ECR, we propose to regularize the induced representation vectors of the event mentions in E to explicitly enforce the consistency/similarity between golden and predicted event mention clusters in D . This is based on our motivation that ECR models will perform better if they can produce more similar event mention clusters to the golden ones. As such, for convenience, let T = { T 1 , T 2 , . . . , T |T | } and P = { P 1 , P 2 , . . . , P |P| } be the golden and predicted sets of event mentions in E respectively, i.e., T i , P j  E , and T 1  T 2  . . .  T |T | = P 1  P 2  . . .  P |P| = E . Also, for each cluster C in T or P , we compute a centroid vector r C for it by averaging the representation vectors of the event mention members: r C = average e  C ( r e ) . This leads to the centroid vectors { r T 1 , r T 2 , . . . , r T |T | } and { r P 1 , r P 2 , . . . , r P |P| } for T and P respectively. We propose the following regularization terms for cluster consistency: Intra-cluster Consistency : This constraint concerns the inner information of each cluster, characterizing the structure of each individual event mention in its golden and predicted clusters in T and P . In particular, for each event mention e i  E , we expect its distances to the centroid vectors of the corresponding golden and predicted clusters T (cid:48) i and P (cid:48) i in T and P (respectively) to be similar, i.e., T (cid:48) i  T , P (cid:48) i  P , e i  T (cid:48) i , e i  P (cid:48) i . As such, we compute the distances between the representation vector r e i of e i to the centroid vectors r T (cid:48) i and r P (cid:48) i via the Euclidean distances (cid:107) r e i  r T (cid:48) i (cid:107) 22 and (cid:107) r e i  r P (cid:48) i (cid:107) 22 . Afterward, the differences L inner between the two distances for golden and predicted clusters are aggregated over all event mentions and added into the overall loss function for minimization: L inner = (cid:80) | E | i =1 |(cid:107) r e i  r T (cid:48) i (cid:107) 22 (cid:107) r e i  r P (cid:48) i (cid:107) 22 | . Inter-cluster Consistency : In this constraint, we expect that the structure among the clusters T i in the golden set T is consistent with those for the predicted event cluster set P (i.e., inter-cluster regulation). To implement this idea, we encode the structure of the clusters in a set via the average of the pairwise distances between the centroid vectors of the clusters. In particular, the inter-cluster structure scores for the golden and predicted clusters in T and P are computed via: s T = 2 |T | ( |T | 1) (cid:80) |T | i =1 (cid:80) |T | j = i +1 (cid:107) r T i  r T j (cid:107) 22 , and s P = 2 |P| ( |P| 1) (cid:80) |P| i =1 (cid:80) |P| j = i +1 (cid:107) r P i  r P j (cid:107) 22 . The difference between the structure scores for golden and predicted clusters T and P is then included into the overall loss function for minimization: L inter = | s T  s P | . Inter-set Similarity : This constraint aims to directly promote the similarity between the golden clusters in T and the predicted clusters in P . As such, for the golden and predicted cluster sets T and P , we first obtain the overall centroid vectors u T and u P (respectively) by averaging the centroid vectors of their member clusters: u T = average T T ( r T ) and u P = average P P ( r P ) . The Euclidean distance L sim is then integrated into the overall loss for minimization: L sim = (cid:107) u T  u P (cid:107) 22 . Note that L inner , L inter , and L sim will be zero if the predicted clusters in P are the same as those in the golden clusters in T . To summarize, the overall loss function L to train our ECR model in this work is: L = L pred +  inner L inner +  inter L inter +  sim L sim with  inner ,  inter , and  sim as the trade-off parameters. Following prior work (Choubey and Huang, 2018), we train our ECR models on the KBP 2015 dataset (Mitamura et al., 2015) and evaluate the models on the KBP 2016 and KBP 2017 datasets for ECR (Mitamura et al., 2016, 2017). In particular, the KBP 2015 dataset includes 360 annotated documents for ECR (181 documents from discussion forum and 179 documents from news articles). We use the same 310 documents from KBP 2015 as in (Choubey and Huang, 2018) for the training data and the remaining 50 documents for the development data. Also, similar to (Choubey and Huang, 2018), the news articles in KBP 2016 (85 documents) and KBP 2017 (83 documents) are leveraged for test datasets. To ensure a fair comparison, we use the predicted event mentions provided by (Choubey and Huang, 2018) in all the datasets. Finally, we report the ECR performance based on the official KBP 2017 scorer (version 1.8) 3 . The scorer employs four coreference scoring measures, including MUC (Vilain et al., 1995), B 3 (Bagga and Baldwin, 1998), CEAF-e (Luo, 2005), BLANC (Lee et al., 2012b), and the unweighted average of their F1 scores (AVGF 1 ). Hyper-parameters for the models are fine-tuned by the AVGF 1 scores over development data. The selected values from the tuning process include: 1 e 5 for the learning rate of the Adam optimizer (se-lected from [ 1 e -5, 2 e -5, 3 e -5, 4 e -5, 5 e -5]); 8 for the mini-batch size (selected from [8 , 16 , 32 , 64] ); 128 hidden units for all the feed-forward network and GCN layers (selected from [64 , 128 , 256 , 512] ); 2 layers for the GCN model, G = 2 (selected from [1 , 2 , 3 , 4] ), and  inner = 0 . 1 ,  inter = 0 . 1 , and  sim = 0 . 1 for the trade-off parameters in the overall loss function L (selected from [0 . 1 , 0 , 2 , . . . , 0 . 9] ). Finally, we use the BERT base model (of 768 dimensions) for the pre-trained word embeddings (updated during the training). We compare the proposed model for ECR with document structures and cluster consistency regularization (called StructECR) with prior work ECR models in the same evaluation setting, including the joint model between ECR and event detection (Lu and Ng, 2017), the integer linear programming approach in (Choubey and Huang, 2018), and the discourse structure profiling model in (Choubey et al., 2020) (also the model with the best reported performance in KBP datasets). In addition, we examine the following baselines of StructECR to highlight the benefits of the proposed components: E2E-Only : This variant implements the end-to-end resolution model described in Section 3.3 where all event mentions in a document are resolved simultaneously in a single process. However, different from our full model StructECR, E2E-Only does not include the document structure component with GCN for representation learning, i.e., it directly uses the initial representation vectors v i (induced from BERT) for the event mentions in the computation of the distribution P ( y i | e i , Y i ) . Also, the cluster consistency regularization in Section 3.4 is also not included in this model. Pairwise : This model is similar to E2E-Only in that it does not applies the document structures and regularization terms in StructECR. In addition, instead of simultaneously resolving event mentions in documents, Pairwise predicts the coreference for every pair of event mentions separately. In particular, the representation vectors v e i and v e j for two event mentions e i and e j (included from BERT) are combined via [ v e i , v e j , v e i (cid:12) v e j ] . This vector is then sent into a feed-forward network to produce a distribution over possible coreference labels between e i and e j (i.e., two labels for being coreferent or not). The coreference labels for every pair of event mentions are then gathered in a coreference graphs among event mentions; the connected components will be returned for the event clusters. Table 1 reports the performance of the ECR models on the KBP 2016 and KBP 2017 datasets. As can be seen from the table, E2E-Only performs comparably or better than prior state-of-the-art models for ECR, e.g., (Choubey and Huang, 2018) and (Choubey et al., 2020), that employ extensive feature engineering. In addition, the better performance of E2E-Only over Pairwise (for both KBP 2016 and KBP 2017) illustrates the benefits of end-to-end coreference resolution for event mentions in documents. Most importantly, the proposed model StructECR significantly outperforms all the baseline models for which the performance improvement over E2E-Only is 1.94% and 1.26% (i.e., AVGF 1 scores) over the KBP 2016 and KBP 2017 datasets respectively. This clearly demonstrates the benefits of the proposed ECR model with rich KBP 2016 KBP 2017 Model B 3 CEAF e MUC BLANC AVGF 1 B 3 CEAF e MUC BLANC AVGF 1 (Lu and Ng, 2017) 50.16 48.59 32.41 32.72 40.97 ---(Choubey and Huang, 2018) 51.67 49.10 34.08 34.08 42.23 50.35 48.61 37.24 31.94 42.04 (Choubey et al., 2020) 52.78 49.70 34.62 34.49 42.90 51.68 50.57 37.8 33.39 43.36 Pairwise 52.16 49.84 30.79 32.21 41.25 50.97 48.80 36.92 31.86 42.14 E2E-Only 50.89 50.43 36.05 33.93 42.83 51.60 52.03 38.53 33.02 43.80 StructECR 52.77 52.29 38.37 35.66 44.77 51.93 52.82 40.73 34.75 45.06 Table 1: Models' performance on the KBP 2016 and KBP 2017 datasets. Two major components in the proposed model StructECR involve the document structures and the cluster consistency regularization. This section performs an ablation study to reveal the contribution of such components for the full model. First, for the document structures, we examine the following ablated models: (i)  StructECR x : where x is one of the five interaction scores used to compute the unified score a ij for G (i.e., a sentij , a corefij , a spanij , a depij , and a structij ). For example,  StructECR a spanij  implies a variant of StructECR where the span-based interaction score a spanij is not included in the compuation of the overall score a ij ; (ii)  StructECR Entity Nodes : this model excludes the entity mention nodes from the interaction graph G in StructECR (i.e., N = D  E only); (iii)  StructECR GraphCombine : instead of unifying the five interaction scores in d ij into an overall score a ij in Equation 1, this model considers each of the five generated interaction scores as forming a separate interaction graph, thus producing six different graphs. The GCN model is then applied over those five graphs (using the same initial representation vectors v i for the nodes n i in N ). The outputs of the GCN model for the same node n i (with different graphs) are then concatenated to compute the final representation vector h i for n i ; and (iv) StructECR Doc Structures : this model removes the GCN model from StructECR. As such, the interaction graph G is not used and the GCN-induced representation vectors h i are replaced by the initial BERT-induced representation vectors v i in the computation for end-to-end resolution and consistency regularization. Second, for the cluster consistency regularization, we evaluate the following ablated models for StructECR: (v) StructECR y ( y  Model B 3 CEAF e MUC BLANC AVGF 1 StructECR (full) 76.86 69.99 66.40 69.02 70.57 StructECR a sentij 75.37 69.73 62.42 69.49 69.25 StructECR a corefij 75.07 69.74 62.97 69.67 69.36 StructECR a spanij 75.32 70.32 63.44 66.97 69.01 StructECR a depij 74.66 69.76 62.72 69.14 69.07 StructECR a structij 75.44 69.53 61.82 71.48 69.57 StructECR Entity Nodes 74.67 69.71 63.01 67.35 68.69 StructECR GraphCombine 75.41 69.74 62.38 68.90 69.11 StructECR Doc Structures 74.15 66.78 60.24 66.32 66.87 StructECR L inner 75.09 68.44 62.25 68.01 68.45 StructECR L inter 74.80 67.98 61.92 67.71 68.10 StructECR L sim 75.13 68.12 62.03 68.95 68.56 StructECR Regularization 74.46 67.55 60.74 68.28 67.76 Table 2: Performance on the KBP 2015 dev set. (vi) StructECR Regularization : this model completely ignores the consistency regularization component from StructECR. Table 2 shows the performance of the models on the development data of the KBP 2015 dataset. As can be seen, the elimination of any component from StructECR would significantly hurt the performance, thus clearly demonstrating the benefits of the designed document structures and cluster consistency regularization in StructECR. To further demonstrate the benefits for the proposed model StructECR, we evaluate StructECR and the baseline models Pairwise and E2E-Only in the cross-domain setting. In this setting, we aim to train the models on one domain (the source domain) and evaluate them on another domain (the target domain). We leverage the KBP 2016 and KBP 2017 datasets for this experiment. In particular, KBP 2016 annotates ECR data for 85 newswire and 84 discussion forum documents (i.e., two do-mains/genres) while KBP 2017 provides annotated data for ECR on 83 news articles and 84 discussion forum documents. As such, for each dataset, we consider two setups where documents in one domain (i.e., newswire or discussion forum) are used for the source domain, leaving documents in the other domain for the target domain data. We use the same hyper-parameters that are tuned on the development set of KBP 2015 for the models in this experiment. Table 3 presents the performance of the models. It is clear from the table that StructECR are significantly and substantially better than the baseline models ( p < 0 . 01 ) over different datasets and settings for the source and target domains, thereby confirming the domain generalization advantages of StructECR for ECR. We present a novel end-to-end coreference resolution framework for event mentions based on deep learning. The novelty in our model is twofold. First, document structures are introduced to explicitly capture relevant objects and their interactions in documents to aid representation learning. Second, several regularization techniques are proposed to exploit the consistencies between human-provided and machine-generated clusters of event mentions in documents. We perform extensive experiments on two benchmark datasets for ECR to demonstrate the advantages of the proposed model. In the future, we plan to extend our models to related problems in information extraction, e.g., event extraction. This research has been supported by the Army Research Office (ARO) grant W911NF-21-1-0112. This research is also based upon work supported by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via IARPA Contract No. 2019-19051600006 under the Better Extraction from Text Towards Enhanced Retrieval (BETTER) Program. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of ARO, ODNI, IARPA, the Department of Defense, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright annotation therein. This document does not contain technology or technical data controlled under either the U.S. International Traffic in Arms Regulations or the U.S. Export Administration Regulations.
method abstain abstain abstain objective abstain method objective result abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain other abstain abstain objective abstain abstain abstain result objective abstain abstain objective result objective method abstain other other method other objective abstain abstain abstain abstain abstain abstain method abstain abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain method abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain method method abstain abstain abstain abstain method other abstain abstain method method abstain abstain abstain abstain abstain abstain method abstain method abstain abstain abstain abstain abstain method abstain other method method abstain abstain other method abstain abstain method method abstain method method other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain abstain abstain objective objective other other other other other