Table Search
6 papers with code • 0 benchmarks • 1 datasets
Benchmarks
These leaderboards are used to track progress in Table Search
Pylon Benchmark
Most implemented papers
Table Search Using a Deep Contextualized Language Model
Zhiyu-Chen/SIGIR2020-BERT-Table-Search
•
•
Pretrained contextualized language models such as BERT have achieved impressive results on various natural language processing benchmarks.
Retrieving Complex Tables with Multi-Granular Graph Representation Learning
FeiWang96/GTR
•
•
The task of natural language table retrieval (NLTR) seeks to retrieve semantically relevant tables based on natural language queries.
Learned Sorted Table Search and Static Indexes in Small Model Space
In modern applications, model space is a key factor and, in fact, a major open question concerning this area is to assess to what extent one can enjoy the speed-up of Binary Search achieved by Learned Indexes while using constant or nearly constant space models.
StruBERT: Structure-aware BERT for Table Search and Matching
medtray/StruBERT
•
•
In this paper, we propose StruBERT, a structure-aware BERT model that fuses the textual and structural information of a data table to produce context-aware representations for both textual and tabular content of a data table.
Generative Benchmark Creation for Table Union Search
northeastern-datalab/alt-gen
•
•
We thoroughly evaluate recent existing table union search methods over existing benchmarks and our new benchmark.
From Specific to Generic Learned Sorted Set Dictionaries: A Theoretically Sound Paradigm Yelding Competitive Data Structural Boosters in Practice
We propose a novel paradigm that, complementing known specialized ones, can produce Learned versions of any Sorted Set Dictionary, for instance, Balanced Binary Search Trees or Binary Search on layouts other that sorted, i. e., Eytzinger.
