Papers by Limin Sun
Discontinuous Named Entity Recognition as Maximal Clique Discovery (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for named entity recognition break the recognition process into several sequential steps. |
| Approach: | They propose a method that breaks the recognition process into several sequential steps . they construct a segment graph for each sentence and a grid tagging scheme to learn it . |
| Outcome: | Experiments show that the proposed method outperforms the state-of-the-art model and achieves 5x speedup over the SOTA model. |
Maximal Clique Based Non-Autoregressive Open Information Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Open Information Extraction (OpenIE) aims to discover textual facts from a given sentence. |
| Approach: | They propose a non-autoregressive framework that generates a fact graph and a graph with an edge linking two nodes that belong to the same fact. |
| Outcome: | The proposed framework outperforms current state-of-the-art methods on two benchmark datasets and significantly outperformed the existing ones. |
TPLinker: Single-stage Joint Extraction of Entities and Relations Through Token Pair Linking (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to extract entities and relations from unstructured text are susceptible to cascading errors due to the separation of entity detection and relation classification. |
| Approach: | They propose a one-stage joint extraction model that detects overlapping relations while being immune from exposure bias. |
| Outcome: | The proposed model can identify overlapping relations while being immune from exposure bias. |