TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/To be Continuous, or to be Discrete, Those are Bits of Que...

To be Continuous, or to be Discrete, Those are Bits of Questions

Yiran Wang, Masao Utiyama

2024-06-12Nested Named Entity RecognitionStructured PredictionConstituency Parsing
PaperPDFCode(official)

Abstract

Recently, binary representation has been proposed as a novel representation that lies between continuous and discrete representations. It exhibits considerable information-preserving capability when being used to replace continuous input vectors. In this paper, we investigate the feasibility of further introducing it to the output side, aiming to allow models to output binary labels instead. To preserve the structural information on the output side along with label information, we extend the previous contrastive hashing method as structured contrastive hashing. More specifically, we upgrade CKY from label-level to bit-level, define a new similarity function with span marginal probabilities, and introduce a novel contrastive loss function with a carefully designed instance selection strategy. Our model achieves competitive performance on various structured prediction tasks, and demonstrates that binary representation can be considered a novel representation that further bridges the gap between the continuous nature of deep learning and the discrete intrinsic property of natural languages.

Results

TaskDatasetMetricValueModel
Named Entity Recognition (NER)ACE 2005F185.9Hashing
Named Entity Recognition (NER)ACE 2004F187.93Hashing
Named Entity Recognition (NER)GENIAF180.54Hashing
Constituency ParsingCTB5F1 score92.33Hashing + Bert
Constituency ParsingPenn TreebankF1 score96.43Hashing + XLNet
Constituency ParsingPenn TreebankF1 score96.03Hashing + Bert

Related Papers

Automatic Extraction of Clausal Embedding Based on Large-Scale English Text Data2025-06-16Learning Distributions over Permutations and Rankings with Factorized Representations2025-05-30Nested Named Entity Recognition as Single-Pass Sequence Labeling2025-05-22Multi-domain Multilingual Sentiment Analysis in Industry: Predicting Aspect-based Opinion Quadruples2025-05-15Structured Prediction with Abstention via the Lovász Hinge2025-05-09Methods for Recognizing Nested Terms2025-04-22Predicting Through Generation: Why Generation Is Better for Prediction2025-02-25Volume Optimality in Conformal Prediction with Structured Prediction Sets2025-02-23