Lei Li, Jieyu Zhang, Xiangchen Song, Yuning Mao, Jiaming Shen, Ying Zeng, Jiaze Chen, Enlarged Taxonomy
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Automatically constructing taxonomy finds many applications in e-commerce and web search. One critical challenge is as data and business scope grow in real applications, new concepts are emerging and needed to be added to the existing taxonomy. Previous approaches focus on the taxonomy expansion, i.e. finding an appropriate hypernym concept from the taxonomy for a new query concept. In this paper, we formulate a new task, "taxonomy completion", by discovering both the hypernym and hyponym concepts for a query. We propose Triplet Matching Network (TMN 1 ), to find the appropriate hypernym, hyponym pairs for a given query concept. TMN consists of one primal scorer and multiple auxiliary scorers. These auxiliary scorers capture various fine-grained signals (e.g., query to hypernym or query to hyponym semantics), and the primal scorer makes a holistic prediction on query, hypernym, hyponym triplet based on the internal feature representations of all auxiliary scorers. Also, an innovative channel-wise gating mechanism that retains task-specific information in concept representations is introduced to further boost model performance. Experiments on four real-world large-scale datasets show that TMN achieves the best performance on both taxonomy completion task and the previous taxonomy expansion task, outperforming existing methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2101.01896")
get_code_for_paper("2101.01896")
have("2101.01896")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2101.01896.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2101.01896)
Connect an agent — have() is free.