Generating CCG Categories

• URL: http://arxiv.org/abs/2103.08139v1
• Date: Mon, 15 Mar 2021 05:01:48 GMT
• Title: Generating CCG Categories
• Authors: Yufang Liu, Tao Ji, Yuanbin Wu, Man Lan
• Abstract summary: We propose to generate categories rather than classify them. We show that with this finer view on categories, annotations of different categories could be shared and interactions with sentence contexts could be enhanced. The proposed category generator is able to achieve state-of-the-art tagging (95.5% accuracy) and parsing (89.8% labeled F1) performances on the standard CCGBank.
• Score: 20.154553201329712
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Previous CCG supertaggers usually predict categories using multi-class classification. Despite their simplicity, internal structures of categories are usually ignored. The rich semantics inside these structures may help us to better handle relations among categories and bring more robustness into existing supertaggers. In this work, we propose to generate categories rather than classify them: each category is decomposed into a sequence of smaller atomic tags, and the tagger aims to generate the correct sequence. We show that with this finer view on categories, annotations of different categories could be shared and interactions with sentence contexts could be enhanced. The proposed category generator is able to achieve state-of-the-art tagging (95.5% accuracy) and parsing (89.8% labeled F1) performances on the standard CCGBank. Furthermore, its performances on infrequent (even unseen) categories, out-of-domain texts and low resource language give promising results on introducing generation models to the general CCG analyses.

Related papers

• Prototypical Hash Encoding for On-the-Fly Fine-Grained Category Discovery [65.16724941038052]
  Category-aware Prototype Generation (CPG) and Discrimi Category 5.3% (DCE) are proposed. CPG enables the model to fully capture the intra-category diversity by representing each category with multiple prototypes. DCE boosts the discrimination ability of hash code with the guidance of the generated category prototypes.
  arXiv  Detail & Related papers  (2024-10-24T23:51:40Z)
• Category-Extensible Out-of-Distribution Detection via Hierarchical Context Descriptions [35.20091752343433]
  This work introduces two hierarchical contexts, namely perceptual context and spurious context, to carefully describe the precise category boundary. The two contexts hierarchically construct the precise description for a certain category, which is first roughly classifying a sample to the predicted category. The precise descriptions for those categories within the vision-language framework present a novel application: CATegory-EXtensible OOD detection (CATEX)
  arXiv  Detail & Related papers  (2024-07-23T12:53:38Z)
• Textual Knowledge Matters: Cross-Modality Co-Teaching for Generalized Visual Class Discovery [69.91441987063307]
  Generalized Category Discovery (GCD) aims to cluster unlabeled data from both known and unknown categories. Current GCD methods rely on only visual cues, which neglect the multi-modality perceptive nature of human cognitive processes in discovering novel visual categories. We propose a two-phase TextGCD framework to accomplish multi-modality GCD by exploiting powerful Visual-Language Models.
  arXiv  Detail & Related papers  (2024-03-12T07:06:50Z)
• Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discovery [49.1865089933055]
  We propose a novel, efficient and self-supervised method capable of discovering previously unknown categories at test time. A salient feature of our approach is the assignment of minimum length category codes to individual data instances. Experimental evaluations, bolstered by state-of-the-art benchmark comparisons, testify to the efficacy of our solution.
  arXiv  Detail & Related papers  (2023-10-30T17:45:32Z)
• Dynamic Conceptional Contrastive Learning for Generalized Category Discovery [76.82327473338734]
  Generalized category discovery (GCD) aims to automatically cluster partially labeled data. Unlabeled data contain instances that are not only from known categories of the labeled data but also from novel categories. One effective way for GCD is applying self-supervised learning to learn discriminate representation for unlabeled data. We propose a Dynamic Conceptional Contrastive Learning framework, which can effectively improve clustering accuracy.
  arXiv  Detail & Related papers  (2023-03-30T14:04:39Z)
• Parametric Classification for Generalized Category Discovery: A Baseline Study [70.73212959385387]
  Generalized Category Discovery (GCD) aims to discover novel categories in unlabelled datasets using knowledge learned from labelled samples. We investigate the failure of parametric classifiers, verify the effectiveness of previous design choices when high-quality supervision is available, and identify unreliable pseudo-labels as a key problem. We propose a simple yet effective parametric classification method that benefits from entropy regularisation, achieves state-of-the-art performance on multiple GCD benchmarks and shows strong robustness to unknown class numbers.
  arXiv  Detail & Related papers  (2022-11-21T18:47:11Z)
• Comparison Knowledge Translation for Generalizable Image Classification [31.530232003512957]
  We build a generalizable framework that emulates the humans' recognition mechanism in the image classification task. We put forward a Comparison Classification Translation Network (CCT-Net), which comprises a comparison classifier and a matching discriminator. CCT-Net achieves surprising generalization ability on unseen categories and SOTA performance on target categories.
  arXiv  Detail & Related papers  (2022-05-07T11:05:18Z)
• Out-of-Category Document Identification Using Target-Category Names as Weak Supervision [64.671654559798]
  Out-of-category detection aims to distinguish documents according to their semantic relevance to the inlier (or target) categories. We present an out-of-category detection framework, which effectively measures how confidently each document belongs to one of the target categories.
  arXiv  Detail & Related papers  (2021-11-24T21:01:25Z)
• Supertagging the Long Tail with Tree-Structured Decoding of Complex Categories [26.657488131046865]
  Current CCG supertaggers achieve high accuracy on the standard WSJ test set, but few systems make use of the categories' internal structure. We investigate constructive models that account for their internal structure, including novel methods for tree-structured prediction. Our best tagger is capable of recovering a sizeable fraction of the long-tail supertags and even generates CCG categories that have never been seen in training.
  arXiv  Detail & Related papers  (2020-12-02T15:51:36Z)
• Deep Hierarchical Classification for Category Prediction in E-commerce System [16.6932395109085]
  In e-commerce system, category prediction is to automatically predict categories of given texts. We propose a Deep Hierarchical Classification framework, which incorporates the multi-scale hierarchical information in neural networks. We also define a novel combined loss function to punish hierarchical prediction losses.
  arXiv  Detail & Related papers  (2020-05-14T02:29:14Z)
• Joint Embedding of Words and Category Labels for Hierarchical Multi-label Text Classification [4.2750700546937335]
  hierarchical text classification (HTC) has received extensive attention and has broad application prospects. We propose a joint embedding of text and parent category based on hierarchical fine-tuning ordered neurons LSTM (HFT-ONLSTM) for HTC.
  arXiv  Detail & Related papers  (2020-04-06T11:06:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.