| Challenge: | String transduction and sequence labeling are often treated as separate entities and often give treatment to different problems in NLP. |
| Approach: | They propose to reduce string transduction to sequence labeling by using a finite-state technique that uses string transducing and sequence labelling. |
| Outcome: | The proposed method performs better than seq2seq models and yields state-of-the-art results in several cases. |
Similar Papers
A Unifying Theory of Transition-based and Sequence Labeling Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | Existing parsers that read sentences from left to right are not learning to parse them. |
| Approach: | They propose a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. |
| Outcome: | The proposed algorithms are learnable and comparable to existing encodings. |
More Embeddings, Better Sequence Labelers? (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective . |
| Approach: | They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages . |
| Outcome: | The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders. |
Viable Dependency Parsing as Sequence Labeling (N19-1)
Copied to clipboard
| Challenge: | Existing work on dependency parsing by sequence labeling suggested that it was impractical. |
| Approach: | They propose to use dependency trees as sequence labels to obtain fast and accurate parsers using a conventional BILSTM-based model. |
| Outcome: | The proposed models are conceptually simple, not needing traditional parsing algorithms or auxiliary structures, and provide a good speed-accuracy tradeoff, with results competitive with more complex approaches. |
Discontinuous Constituent Parsing as Sequence Labeling (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to discontinuous parsing are complex and low-level. |
| Approach: | They propose to encode discontinuities as nearly ordered permutations of the input sequence. |
| Outcome: | The proposed model is fast and accurate under the right representation. |
Exact Hard Monotonic Attention for Character-Level Transduction (P19-1)
Copied to clipboard
| Challenge: | Neural sequence-to-sequence models with soft attention outperform monotonic models . current dominant method is the neural sequenceto-Sequency model with soft focus . |
| Approach: | They develop a hard attention sequence-to-sequence model that enforces strict monotonicity and learns alignment jointly. |
| Outcome: | The proposed model achieves state-of-the-art on grapheme-to-phoneme conversion and morphological inflection generation. |
On Parsing as Tagging (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to reduce constituency parsing to tagging are based on linearization, learning, and decoding . linearization of the derivation tree is the most critical factor in achieving accurate parsers as taggers . |
| Approach: | They propose a pipeline with three steps for reducing constituency parsing to tagging . they find that linearization and learning are critical factors for accurate parsers . |
| Outcome: | The proposed pipelines are linearized, learning, and decoded, and have three steps to achieve accurate parsing as taggers. |
Constituent Parsing as Sequence Labeling (D18-1)
Copied to clipboard
| Challenge: | Constituent parsing is a core problem in NLP where the goal is to obtain the syntactic structure of sentences expressed as a phrase structure tree. |
| Approach: | They propose a method to reduce constituent parsing to sequence labeling by using a tree with unary branches. |
| Outcome: | The proposed method outperforms the Vinyals et al. (2015) sequence-to-sequence parser by 90% on the PTB and CTB treebanks. |
Parsing linearizations appreciate PoS tags - but some are fussy about errors (2022.aacl-short)
Copied to clipboard
| Challenge: | Recent work on the impact of PoS tags on graph- and transition-based parsers suggests that they are only useful when tagging accuracy is prohibitively high or in low-resource scenarios. |
| Approach: | They examine the impact of PoS tags on graph- and transition-based parsers and propose to use them in a new paradigm for sequence labeling. |
| Outcome: | The proposed model is best when tagging accuracy and resource availability are high. |
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems. |
| Approach: | They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions. |
| Outcome: | The proposed approach significantly reduces label space while preserving structural information. |
Proceedings of the First Workshop on Commonsense Inference in Natural Language Processing (D19-60)
Copied to clipboard
| Challenge: | Workshop on Commonsense Inference in Natural Language Processing focuses on commonsense knowledge representation and application in NLP tasks. |
| Approach: | COIN is a workshop on commonsense inference in natural language processing . workshop included two shared tasks on reading comprehension using commonsensense knowledge . |
| Outcome: | the workshop focused on modeling commonsense knowledge and commonsensing in natural language processing tasks. |