Search Results for author:
Found 17 papers, 9 papers with code
Counterfactual Data Augmentation for Mitigating Gender Stereotypes in Languages with Rich Morphology
Gender stereotypes are manifest in most of the world's languages and are consequently propagated or amplified by NLP systems.
Information-Theoretic Probing for Linguistic Structure
The success of neural networks on a diverse set of NLP tasks has led researchers to question how much these networks actually ``know'' about natural language.
SIGMORPHON 2020 Shared Task 0: Typologically Diverse Morphological Inflection
Systems were developed using data from 45 languages and just 5 language families, fine-tuned with data from an additional 45 languages and 10 language families (13 in total), and evaluated on all 90 languages.
Efficient Computation of Expectations under Spanning Tree Distributions
We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models.
Please Mind the Root: Decoding Arborescences for Dependency Parsing
The connection between dependency trees and spanning trees is exploited by the NLP community to train and to decode graph-based dependency parsers.
On Finding the $K$-best Non-projective Dependency Trees
Furthermore, we present a novel extension of the algorithm for decoding the $K$-best dependency trees of a graph which are subject to a root constraint.
Higher-order Derivatives of Weighted Finite-state Machines
In the case of second-order derivatives, our scheme runs in the optimal $\mathcal{O}(A^2 N^4)$ time where $A$ is the alphabet size and $N$ is the number of states.
On Finding the K-best Non-projective Dependency Trees
Furthermore, we present a novel extension of the algorithm for decoding the K-best dependency trees of a graph which are subject to a root constraint.
Efficient Sampling of Dependency Structures
Colbourn (1996)'s sampling algorithm has a running time of $\mathcal{O}(N^3)$, which is often greater than the mean hitting time of a directed graph.
Exact Paired-Permutation Testing for Structured Test Statistics
However, practitioners rely on Monte Carlo approximation to perform this test due to a lack of a suitable exact algorithm.
UniMorph 4.0: Universal Morphology
The project comprises two major thrusts: a language-independent feature schema for rich morphological annotation and a type-level resource of annotated data in diverse languages realizing that schema.
Efficient Semiring-Weighted Earley Parsing
This paper provides a reference description, in the form of a deduction system, of Earley's (1970) context-free parsing algorithm with various speed-ups.
TreeForm: End-to-end Annotation and Evaluation for Form Document Parsing
Visually Rich Form Understanding (VRFU) poses a complex research problem due to the documents' highly structured nature and yet highly variable style and content.
Log Summarisation for Defect Evolution Analysis
Log analysis and monitoring are essential aspects in software maintenance and identifying defects.
Translating between SQL Dialects for Cloud Migration
In this work, we consider the difficulties of this migration for SQL databases.
BuDDIE: A Business Document Dataset for Multi-task Information Extraction
Several datasets exist for research on specific tasks of VRDU such as document classification (DC), key entity extraction (KEE), entity linking, visual question answering (VQA), inter alia.
Efficient Sampling of Dependency Structure
In this paper, we adapt two spanning tree sampling algorithms to faithfully sample dependency trees from a graph subject to the root constraint.
