Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing word-level dependency parsing methods in Chinese lack explicit word boundaries due to the lack of word boundaries. |
| Approach: | They propose to model latent internal structures within Chinese words by constrained Eisner algorithm . they propose to guarantee a single root for intra-word structures and establish inter-word dependencies . |
| Outcome: | The proposed model outperforms existing models on Chinese treebanks and shows that it can predict plausible intra-word structures. |
Similar Papers
An In-depth Study on Internal Structure of Chinese Words (2021.acl-long)
Copied to clipboard
Chen Gong, Saihao Huang, Houquan Zhou, Zhenghua Li, Min Zhang, Zhefeng Wang, Baoxing Huai, Nicholas Jing Yuan
| Challenge: | Unlike English letters, Chinese characters have rich and specific meanings. |
| Approach: | They propose to model Chinese words' internal structures as dependency trees with 11 labels for distinguishing syntactic relationships. |
| Outcome: | The proposed model of Chinese word-internal structures shows it can be used to parse sentences . it shows that the model can be applied to a sentence-level task with a competitive dependency parser. |
Test Sets for Chinese Nonlocal Dependency Parsing (L18-1)
Copied to clipboard
| Challenge: | Chinese is a language rich in nonlocal dependencies. |
| Approach: | They use trace annotations in the Penn Chinese Treebank to generate test sets of Chinese nonlocal dependencies which occur in different grammatical constructions. |
| Outcome: | The proposed test sets can be used to evaluate nonlocal dependency recovery in Chinese. |
From Characters to Words: Hierarchical Pre-trained Language Model for Open-vocabulary Language Understanding (2023.acl-long)
Copied to clipboard
| Challenge: | Current models for natural language understanding require a preprocessing step to convert raw text into discrete tokens. |
| Approach: | They propose a hierarchical open-vocabulary language model that adopts a shallow Transformer architecture to learn word representations from their characters and a deep inter-word Transformer module that contextualizes each word representation by attending to the entire word sequence. |
| Outcome: | The proposed model outperforms baselines on various downstream tasks and is robust to textual corruption and domain shift. |
A Graph-based Model for Joint Chinese Word Segmentation and Dependency Parsing (2020.tacl-1)
Copied to clipboard
| Challenge: | Chinese word segmentation and dependency parsing suffer from error propagation . a graph-based model can integrate both tasks, but it suffers from performance limitations . |
| Approach: | They propose a graph-based model to integrate Chinese word segmentation and dependency parsing . their model achieves better performance than previous joint models . |
| Outcome: | The proposed model achieves better performance than previous joint models and state-of-the-art results in both Chinese word segmentation and dependency parsing. |
Reasoning with Latent Structure Refinement for Document-Level Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction capture non-local interactions but are not able to capture rich non-linguistic interactions. |
| Approach: | They propose a document-level relation extraction model that empowers relational reasoning across sentences by automatically inducing the latent document- level graph. |
| Outcome: | The proposed model achieves an F1 score of 59.05 on a large-scale document-level dataset (DocRED), significantly improving over the previous results. |
Simpler but More Accurate Semantic Dependency Parsing (P18-2)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is the most popular method for automatically extracting low-level relationships between words in a sentence. |
| Approach: | They extend a syntactic dependency parser to train on and generate graph-structured representations that capture between-word relationships that are more closely related to the meaning of a sentence. |
| Outcome: | The proposed system beats the current state-of-the-art system by 0.6% and linguistically richer representations push the margin even higher. |
Dependency-based Hybrid Trees for Semantic Parsing (D18-1)
Copied to clipboard
| Challenge: | Existing models for semantic parsing focus on structure-based models, but none deal with dependency information. |
| Approach: | They propose a dependency-based hybrid tree model which converts natural language utterances into machine interpretable meaning representations. |
| Outcome: | The proposed model achieves state-of-the-art performance across eight languages and is highly tractable inferenceable. |
Latent Structure Models for Natural Language Processing (P19-4)
Copied to clipboard
| Challenge: | Latent structure models are a powerful tool for compositional data modeling and pipelines. |
| Approach: | This tutorial will cover recent advances in discrete latent structure models . it will discuss their motivation, potential, and limitations . |
| Outcome: | This tutorial will cover recent advances in discrete latent structure models . it will discuss their motivation, potential, and limitations . |
AMR Parsing with Latent Structural Information (2020.acl-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representations (AMRs) capture sentence-level semantics structural representations to broad-coverage natural sentences. |
| Approach: | They investigate parsing AMR with explicit dependency structures and interpretable latent structures. |
| Outcome: | The proposed model achieves best results on both AMR 2.0 and AMR 1.0 . the proposed model has been adopted in downstream NLP tasks, including text summarization and question answering. |
L1-L2 Parallel Treebank of Learner Chinese: Overused and Underused Syntactic Structures (L18-1)
Copied to clipboard
| Challenge: | Currently, the treebank consists of 600 L2 sentences and 697 L1 sentences. |
| Approach: | They propose to use "L1-L2 parallel treebanks" to facilitate analyses of learner language. |
| Outcome: | The proposed treebank consists of 600 L2 sentences and 697 L1 sentences. |