Replicating and Extending “Because Their Treebanks Leak”: Graph Isomorphism, Covariants, and Parser Performance (2021.acl-short)
Copied to clipboard
| Challenge: | a small sample size and unreliable results suggest a correlation between parser performance and graph isomorphism is not observed in the wild. |
| Approach: | They propose to replicate a study which found graph isomorphism is a non-trivial variable . they also bin sentences by length and find correlation between parser performance and isopathism disappears . |
| Outcome: | The results show that the original analysis was unreliable and had methodological issues . the study also bin sentences by length and shows that the correlation between parser performance and graph isomorphism disappears when controlling for covariants. |
Similar Papers
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. |
Revisiting the Effects of Leakage on Dependency Parsing (2022.findings-acl)
Copied to clipboard
| Challenge: | Recent work shows that treebank size and linguistic variation are important factors that explain the variation in dependency parsing performance. |
| Approach: | They propose a measure of leakage that explains and correlates with observed performance variation. |
| Outcome: | The proposed measure explains and correlates with observed performance variation. |
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. |
Please Mind the Root: Decoding Arborescences for Dependency Parsing (2020.emnlp-main)
Copied to clipboard
| Challenge: | a dependency tree has a root constraint, but only one edge may emanate from the root node. |
| Approach: | They propose an algorithm which enforces a root constraint without compromising the original runtime. |
| Outcome: | The proposed algorithm satisfies the constraint without compromising the original runtime. |
An Empirical Investigation of Structured Output Modeling for Graph-based Neural Dependency Parsing (P19-1)
Copied to clipboard
| Challenge: | In the past few years, graph-based dependency parsers have led to impressive empirical successes on parsing accuracy. |
| Approach: | They propose to use a graph-based dependency parser to model global outputs. |
| Outcome: | The proposed model has been shown to perform better on sentence-level Complete Match metric compared with the previous model. |
Dependency parsing with structure preserving embeddings (2021.eacl-main)
Copied to clipboard
| Challenge: | Modern neural approaches to dependency parsing are trained to predict a tree structure by learning a contextual representation for tokens in a sentence and a head–dependent scoring function. |
| Approach: | They propose to combine a contextual representation for tokens and a head–dependent scoring function to learn interpretable representations by training a parser to explicitly preserve structural properties of a tree. |
| Outcome: | The proposed approach yields strong tree distance preservation and parsing performance on par with a competitive graph-based parser. |
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’s Going On in Neural Constituency Parsers? An Analysis (N18-1)
Copied to clipboard
| Challenge: | a number of differences have emerged between classical and modern constituency parsing approaches . structural components like grammars and feature-rich lexicons are becoming less central . recurrent neural networks have gained traction as a powerful and general purpose tool for representation . |
| Approach: | They propose a model that implicitly learns to encode much of the same information as grammars and lexicons in the past. |
| Outcome: | The proposed model outperforms state-of-the-art models under similar conditions. |
How Bad are PoS Tagger in Cross-Corpora Settings? Evaluating Annotation Divergence in the UD Project. (N19-1)
Copied to clipboard
| Challenge: | Using annotation variation principles, Part-of-Speech tagging performance degrades when applied to test sentences that depart from training data. |
| Approach: | They propose to use the annotation variation principle to identify inconsistencies between annotations . they also evaluate their impact on prediction performance . |
| Outcome: | The proposed method can detect errors in gold standard annotations and improve prediction performance. |
The Secret is in the Spectra: Predicting Cross-lingual Task Performance with Spectral Similarity Measures (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have suggested that bilingual lexicon induction is influenced by the (dis)similarity of the languages at hand. |
| Approach: | They propose to measure the isomorphism of monolingual embedding spaces based on their spectra and introduce isometric measures to measure their similarity. |
| Outcome: | The proposed measures outperform standard isomorphism measures while being more tractable and easier to interpret. |