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.

Similar Papers

Constructing a Dependency Treebank for Second Language Learners of Korean (2024.lrec-main)

Copied to clipboard

Challenge: a manually annotated syntactic treebank is available for second language learners . the dataset includes 7,530 sentences (66,982 words; 129,333 morphemes)
Approach: They propose to manually annotate syntactic treebanks based on Universal Dependencies from Korean written data.
Outcome: The proposed dataset includes 7,530 sentences and 129,333 morphemes from Korean learners.
Some Languages Seem Easier to Parse Because Their Treebanks Leak (2020.emnlp-main)

Copied to clipboard

Challenge: Cross-language differences in (universal) dependency parsing performance are mostly attributed to treebank size, average sentence length, average dependency length, morphological complexity, and domain differences.
Approach: They compute graph isomorphisms and find that treebank size is a factor that influences parsing performance.
Outcome: The results show that the overlap between training and test graphs explain more of the observed variation than standard explanations such as the above.
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.
Parser Training with Heterogeneous Treebanks (P18-2)

Copied to clipboard

Challenge: In the 2017 CoNLL Shared Task on Universal Dependency Parsing, 25 languages have more than one treebank . many teams did not take advantage of the multiple treebanks, however, and trained one model per treebank instead of one model for each language.
Approach: They propose a method to make the most of heterogeneous treebanks when training a monolingual parser.
Outcome: The proposed method improves on training with multiple treebanks for a single language.
The Tembusu Treebank: An English Learner Treebank (2022.lrec-1)

Copied to clipboard

Challenge: a new treebank is created to help diagnose ungrammatical sentences using mal-rules . the Tembusu Learner Treebank is an open treebank created from the corpus of Learner English .
Approach: They propose to use the Tembusu Learner Treebank to train a new parse-ranking model for the English Resource Grammar . the model incorporates mal-rules in the annotation of ungrammatical sentences .
Outcome: The Tembusu Learner Treebank is an open treebank created from the NTU Corpus of Learner English . the treebank is unique for incorporating mal-rules in the annotation of ungrammatical sentences .
Development of a Multilingual CCG Treebank via Universal Dependencies Conversion (2022.lrec-1)

Copied to clipboard

Challenge: Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism that can capture both syntactic and semantic information.
Approach: They propose an algorithm to convert UD treebanks to CCG treebank and propose future extensions.
Outcome: The proposed algorithm performs lexical, sentential, and syntactic rule coverage analysis, as well as CCG parsing experiments.
Building an Ellipsis-aware Chinese Dependency Treebank for Web Text (L18-1)

Copied to clipboard

Challenge: ellipsis is a common linguistic phenomenon that some words are left out as they are understood from the context, especially in oral utterance.
Approach: They propose to use a Chinese dependency treebank to facilitate the parsing of web text . they propose to restore omissions and reserve contexts in the web text to improve dependency parsers .
Outcome: The proposed framework enables the parsing of web text from online microblogs.
An In-depth Study on Internal Structure of Chinese Words (2021.acl-long)

Copied to clipboard

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.
The Persian Dependency Treebank Made Universal (2022.lrec-1)

Copied to clipboard

Challenge: Existing universal dependency treebanks are lacking sufficient annotated data.
Approach: They propose a method for converting Persian Dependency Treebank to Universal Dependencies using an automatic method.
Outcome: The proposed method is more compatible with Universal Dependencies than the Uppsala Persian Universal Dependency Treebank.
Treebank Embedding Vectors for Out-of-Domain Dependency Parsing (2020.acl-main)

Copied to clipboard

Challenge: a recent advance in monolingual dependency parsing is the idea of a treebank embedding vector . this allows the model to prefer training data from one treebank over another at test time .
Approach: They propose a method to predict a treebank vector for sentences that do not come from a particular treebank . they also explore what happens when they move away from predefined treebank embedding vectors .
Outcome: The proposed method can predict treebank vectors for sentences that do not come from a treebank used in training with sufficient accuracy for nine out of ten languages.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations