| Challenge: | lexicons or gazettes are used to improve slot tagging in spoken language understanding systems. |
| Approach: | They develop models that encode lexicon information as neural features for use in a long-short term memory neural network. |
| Outcome: | The proposed models improve slot tagging with lexicons and gazettes . the results could be used to improve other natural language applications . |
Similar Papers
Data Augmentation by Data Noising for Open-vocabulary Slots in Spoken Language Understanding (N19-3)
Copied to clipboard
| Challenge: | Neural networks are used to understand spoken language understanding (SLU) but it is difficult to recognize the slots of unknown words or ‘open-vocabulary’ slots because of the high cost of creating a manually tagged SLU dataset. |
| Approach: | They propose to use a recurrent neural network to nois slots for data augmentation by using an attention-based bi-directional recurrence neural network. |
| Outcome: | The proposed method achieves performance improvements of up to 0.57% and 3.25 in intent prediction (accuracy) and slot filling (f1-score) and 0.53% accuracy. |
Lexicosyntactic Inference in Neural Models (D18-1)
Copied to clipboard
| Challenge: | lexicosyntactic inferences are triggered by surprising aspects of the syntactical context that a word occurs in. |
| Approach: | They build a factuality judgment dataset for English clause-embedding verbs in various syntactic contexts and use it to probe the behavior of current state-of-the-art neural systems. |
| Outcome: | The proposed model makes systematic errors that are visible through the lens of factuality prediction. |
How to represent a word and predict it, too: Improving tied architectures for language modelling (D18-1)
Copied to clipboard
| Challenge: | Recent state-of-the-art models use word embeddings as input and output mappings instead of tied models. |
| Approach: | They propose to decouple hidden state from word embedding prediction . they extend their proposed modification to word2vec models . |
| Outcome: | The proposed architectures achieve comparable or better results compared to previous models without tying . the proposed architecture reduces parameters, enabling more compact models and faster learning. |
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. |
The Utility and Interplay of Gazetteers and Entity Segmentation for Named Entity Recognition in English (2021.findings-acl)
Copied to clipboard
| Challenge: | Recent papers introduce methods to incorporate gazetteer features and entity segmentation techniques in neural named entity recognition models. |
| Approach: | They propose to integrate gazetteer features and entity segmentation techniques into neural named entity recognition models. |
| Outcome: | The proposed methods improve entity segmentation and not just entity typing. |
Learning to Tag OOV Tokens by Integrating Contextual Representation and Background Knowledge (2020.acl-main)
Copied to clipboard
| Challenge: | Recent context-aware models for slot tagging have achieved state-of-the-art performance . however, the presence of OOV( out-of vocab) words significantly degrades the performance of these models. |
| Approach: | They propose a knowledge-enhanced slot tagging model to integrate contextual representation of input text and large-scale lexical background knowledge. |
| Outcome: | The proposed model achieves consistent improvements across settings with different sizes of training data on two public benchmark datasets. |
Unleashing the True Potential of Sequence-to-Sequence Models for Sequence Tagging and Structure Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Sequence-to-Sequence (S2S) models have been successful on text generation tasks . however, learning complex structures with S2S models remains challenging . |
| Approach: | They propose to use constrained decoding to model part-of-speech tagging, named entity recognition, constituency, and dependency parsing tasks with 3 lexically diverse linearization schemas and corresponding constrained coding methods. |
| Outcome: | The proposed methods outperform the state-of-the-art on four core tasks. |
Dynamic Head Selection for Neural Lexicalized Constituency Parsing (2025.acl-long)
Copied to clipboard
| Challenge: | Lexicalized parsing has traditionally been neglected in favor of unlexicalized, span-based methods. |
| Approach: | They propose a latent lexicalization framework that dynamically infers lexicals from data without relying on predefined head-finding rules. |
| Outcome: | The proposed model learns lexical dependencies directly from data, offering greater adaptability across languages and datasets. |
GDA: Grammar-based Data Augmentation for Text Classification using Slot Information (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies suggest data augmentation approaches to resolve the low-resource problem in natural language processing tasks. |
| Approach: | They propose to use slot information to augment sentences using a set of injective relations between a sentence’s semantics and its syntactical structure to augment the dataset. |
| Outcome: | The proposed approach outperforms all other data augmentation methods by 19.38%. |
Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference (2020.acl-main)
Copied to clipboard
| Challenge: | Using custom architectures, constituency parsers are limited and require specialized hardware. |
| Approach: | They propose an algorithm that assigns labels to each word in a sentence in parallel and then performs a reconciliation phase to extract a tree in (empirically) linear time. |
| Outcome: | The proposed model achieves 95.4 F1 on the WSJ test set while also achieving substantial speedups compared to current state-of-the-art parsers with comparable accuracies. |