Story Ending Selection by Finding Hints From Pairwise Candidate Endings

Research article (IEEE/ACM Transactions on Audio Speech and Language Processing, 2019) · cited 14× · AI/ML

academia openalex:W2909205211

Press Enter · cited answer in seconds

Story Ending Selection by Finding Hints From Pairwise Candidate Endings

Summary

Story Ending Selection by Finding Hints From Pairwise Candidate Endings is a scholarly article^[1].

Key Facts

Story Ending Selection by Finding Hints From Pairwise Candidate Endings's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 2

Mantong Zhou, Minlie Huang

← Author of 2

Mantong Zhou, Minlie Huang

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ Story Ending Selection by Finding Hints From Pairwise Candidate Endings — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Story Ending Selection by Finding Hints From Pairwise Candidate Endings is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). Story Ending Selection by Finding Hints From Pairwise Candidate Endings. Retrieved May 24, 2026, from https://4ort.xyz/entity/story-ending-selection-by-finding-hints-from-pairwise-candidate-endings

MLA

“Story Ending Selection by Finding Hints From Pairwise Candidate Endings.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/story-ending-selection-by-finding-hints-from-pairwise-candidate-endings.

BibTeX

@misc{4ortxyz_story-ending-selection-by-finding-hints-from-pairwise-candidate-endings_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Story Ending Selection by Finding Hints From Pairwise Candidate Endings}}, year = {2026}, url = {https://4ort.xyz/entity/story-ending-selection-by-finding-hints-from-pairwise-candidate-endings}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Story Ending Selection by Finding Hints From Pairwise Candidate Endings — https://4ort.xyz/entity/story-ending-selection-by-finding-hints-from-pairwise-candidate-endings (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/story-ending-selection-by-finding-hints-from-pairwise-candidate-endings · Last refreshed: May 24, 2026