stanojevic / Fast-MST-AlgorithmLinks
Implementation of fast algorithms for Maximum Spanning Tree (MST) parsing that includes fast ArcMax+Reweighting+Tarjan algorithm for single-root dependency parsing.
☆16Updated 2 years ago
Alternatives and similar repositories for Fast-MST-Algorithm
Users that are interested in Fast-MST-Algorithm are comparing it to the libraries listed below
Sorting:
- lanmt ebm☆12Updated 5 years ago
- Variable-order CRFs with structure learning☆16Updated last year
- Learning to Model Editing Processes☆26Updated 2 months ago
- Dependency Parsing as Sequence Labeling with Python3+ and PyTorch1+ and MTL☆10Updated 5 years ago
- Source Code for paper "Learning from Explanations with Neural Execution Tree", ICLR 2020☆18Updated 4 years ago
- Fine-Tuning Pre-trained Transformers into Decaying Fast Weights☆19Updated 3 years ago
- Code for "Discovering Non-monotonic Autoregressive Orderings with Variational Inference" (paper and code updated from ICLR 2021)☆12Updated last year
- PyTorch implementation for PaLM: A Hybrid Parser and Language Model.☆10Updated 5 years ago
- Pytorch implementation of “Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement”☆62Updated 4 years ago
- Repo for ICML23 "Why do Nearest Neighbor Language Models Work?"☆59Updated 2 years ago
- Code for the paper "Understanding the Mechanics of SPIGOT: Surrogate Gradients for Latent Structure Learning"☆11Updated 4 years ago
- Implementation of ICML 22 Paper: Scaling Structured Inference with Randomization☆14Updated 3 years ago
- Recursive Bayesian Networks☆11Updated 5 months ago
- ☆44Updated 5 years ago
- A method for evaluating the high-level coherence of machine-generated texts. Identifies high-level coherence issues in transformer-based …☆11Updated 2 years ago
- Pretraining summarization models using a corpus of nonsense☆13Updated 4 years ago
- ☆29Updated 3 years ago
- Implementation for "Rational Recurrences", Peng et al., EMNLP 2018.☆28Updated 3 years ago
- source code of NAACL2021 "PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols“ and ACL2021 main conferenc…☆51Updated 6 months ago
- Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference☆15Updated 5 years ago
- ☆12Updated 3 years ago
- Humans understand novel sentences by composing meanings and roles of core language components. In contrast, neural network models for nat…☆27Updated 5 years ago
- Code Repository for "Please Mind the Root: Decoding Arborescences for Dependency Parsing" and "On Finding the K-best Non-projective Depen…☆20Updated 2 years ago
- ☆29Updated 3 years ago
- Official code for the ICLR 2020 paper 'ARE PPE-TRAINED LANGUAGE MODELS AWARE OF PHRASES? SIMPLE BUT STRONG BASELINES FOR GRAMMAR INDCUTIO…☆30Updated 2 years ago
- Implementation of Cascaded Head-colliding Attention (ACL'2021)☆11Updated 4 years ago
- ☆14Updated last year
- ☆41Updated 4 years ago
- Codebase implementing LMs for learning the Dyck-(k,m) bounded hierarchical language☆15Updated 5 years ago
- Chu-Lui-Edmonds decoding extracted from TurboParser☆14Updated 8 years ago