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.
The ability to accurately model a sentence at varying stages (e.g., word-phrase-sentence) plays a central role in natural language processing. As an effort towards this goal we propose a self-adaptive hierarchical sentence model (AdaSent). AdaSent effectively forms a hierarchy of representations from words to phrases and then to sentences through recursive gated local composition of adjacent segments. We design a competitive mechanism (through gating networks) to allow the representations of the same sentence to be engaged in a particular learning task (e.g., classification), therefore effectively mitigating the gradient vanishing problem persistent in other recursive models. Both qualitative and quantitative analysis shows that AdaSent can automatically form and select the representations suitable for the task at hand during training, yielding superior classification performance over competitor models on 5 benchmark data sets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1504.05070")
get_code_for_paper("1504.05070")
have("1504.05070")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1504.05070.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1504.05070)
Connect an agent — have() is free.