Koc University Digital Collections
metadata only
Tree-stack LSTM in transition based dependency parsing
We introduce tree-stack LSTM to model state of a transition based parser with recurrent neural networks. Tree-stack LSTM does not use any parse tree based or hand-crafted features, yet performs better than models with these features. We also develop new set of embeddings from raw features to enhance
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Evaluating deep learning models for streamflow prediction under RCP 4.5 and RCP 8.5 climate scenarios#1136569
- Enhanced Rainfall Forecasting Through Deep Learning Optimization Using Long Short-Term Memory Networks#1017859
- SemPOI-RL: Aligning LLM Semantic Reasoning for Interpretable Out-of-Town POI Sequential Generation#799603
- SEAR: Segment-Evidence-Aware Routing for Weak-to-Strong Multilingual Speech MCQ#998890
- Cross-sector deep learning scales life cycle assessment using unified textual descriptions#478629
Record · ID 955706
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive