{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/short-text-conversation","name":"Short-Text Conversation","slug":"short-text-conversation","description_markdown":"Given a short text, finding an appropriate response (Source: http://staff.ustc.edu.cn/~cheneh/paper_pdf/2013/HaoWang.pdf)","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"},{"name":"Speech","url":"/area/speech"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":22,"papers_with_code":9,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/lccc","name":"LCCC","full_name":"Large-scale Cleaned Chinese Conversation corpus","num_papers_in_archive":17},{"url":"/dataset/threatgram-101-extreme-telegram-data","name":"ThreatGram 101 - Extreme Telegram Data","full_name":"ThreatGram 101 - Extreme Telegram Replies Data with Threat Levels","num_papers_in_archive":2},{"url":"/dataset/vmd","name":"VMD","full_name":"Virtual Moderation Dataset","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/dialogue","name":"Dialogue"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":22,"of":22,"of_with_code":9,"tagged_in_all":22,"counts":{"archive_papers_tagged":22,"with_a_code_link":9,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":22,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/neural-responding-machine-for-short-text","slug":"neural-responding-machine-for-short-text","title":"Neural Responding Machine for Short-Text Conversation","date":"2015-03-09","arxiv_id":"1503.02364","repositories_listed":4,"syntology":null},{"url":"/paper/a-large-scale-chinese-short-text-conversation","slug":"a-large-scale-chinese-short-text-conversation","title":"A Large-Scale Chinese Short-Text Conversation Dataset","date":"2020-08-10","arxiv_id":"2008.03946","repositories_listed":2,"syntology":null},{"url":"/paper/threatgram-101-extreme-telegram-replies-data","slug":"threatgram-101-extreme-telegram-replies-data","title":"ThreatGram 101 - Extreme Telegram Replies Data with Threat Levels","date":"2024-09-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/predict-and-use-latent-patterns-for-short","slug":"predict-and-use-latent-patterns-for-short","title":"Predict and Use Latent Patterns for Short-Text Conversation","date":"2020-10-27","arxiv_id":"2010.13982","repositories_listed":1,"syntology":null},{"url":"/paper/short-text-conversation-based-on-deep-neural","slug":"short-text-conversation-based-on-deep-neural","title":"Short Text Conversation Based on Deep Neural Network and Analysis on Evaluation Measures","date":"2019-07-06","arxiv_id":"1907.03070","repositories_listed":1,"syntology":null},{"url":"/paper/towards-less-generic-responses-in-neural","slug":"towards-less-generic-responses-in-neural","title":"Towards Less Generic Responses in Neural Conversation Models: A Statistical Re-weighting Method","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/nips-conversational-intelligence-challenge","slug":"nips-conversational-intelligence-challenge","title":"NIPS Conversational Intelligence Challenge 2017 Winner System: Skill-based Conversational Agent with Supervised Dialog Manager","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/addressee-and-response-selection-for-multi","slug":"addressee-and-response-selection-for-multi","title":"Addressee and Response Selection for Multi-Party Conversation","date":"2016-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-information-retrieval-approach-to-short","slug":"an-information-retrieval-approach-to-short","title":"An Information Retrieval Approach to Short Text Conversation","date":"2014-08-29","arxiv_id":"1408.6988","repositories_listed":1,"syntology":null},{"url":null,"slug":"dch-2-a-parallel-customer-helpdesk-dialogue","title":"DCH-2: A Parallel Customer-Helpdesk Dialogue Corpus with Distributions of Annotators' Labels","date":"2021-04-18","arxiv_id":"2104.08755","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemblegan-adversarial-learning-for","title":"EnsembleGAN: Adversarial Learning for Retrieval-Generation Ensemble Model on Short-Text Conversation","date":"2020-04-30","arxiv_id":"2004.14592","repositories_listed":0,"syntology":null},{"url":null,"slug":"relevance-promoting-language-model-for-short","title":"Relevance-Promoting Language Model for Short-Text Conversation","date":"2019-11-26","arxiv_id":"1911.11489","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-discrete-cvae-for-response-generation-on-1","title":"A Discrete CVAE for Response Generation on Short-Text Conversation","date":"2019-11-22","arxiv_id":"1911.09845","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-sentence-functions-for-short","title":"Fine-Grained Sentence Functions for Short-Text Conversation","date":"2019-07-24","arxiv_id":"1907.10302","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-multiple-diverse-responses-for","title":"Generating Multiple Diverse Responses for Short-Text Conversation","date":"2018-11-14","arxiv_id":"1811.05696","repositories_listed":0,"syntology":null},{"url":null,"slug":"memd-a-diversity-promoting-learning-framework","title":"MEMD: A Diversity-Promoting Learning Framework for Short-Text Conversation","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-implicit-content-introducing-for","title":"Towards Implicit Content-Introducing for Generative Short-Text Conversation Systems","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-start-for-sequence-to-sequence","title":"Learning to Start for Sequence to Sequence Architecture","date":"2016-08-19","arxiv_id":"1608.05554","repositories_listed":0,"syntology":null},{"url":null,"slug":"docchat-an-information-retrieval-approach-for","title":"DocChat: An Information Retrieval Approach for Chatbot Engines Using Unstructured Documents","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sequence-to-backward-and-forward-sequences-a","title":"Sequence to Backward and Forward Sequences: A Content-Introducing Approach to Generative Short-Text Conversation","date":"2016-07-04","arxiv_id":"1607.00970","repositories_listed":0,"syntology":null},{"url":null,"slug":"sentence-level-recurrent-topic-model-letting","title":"Sentence Level Recurrent Topic Model: Letting Topics Speak for Themselves","date":"2016-04-07","arxiv_id":"1604.02038","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dataset-for-research-on-short-text","title":"A Dataset for Research on Short-Text Conversations","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3295fd74cd435cfaa8958734a8e891f3b25d59022f3ea4055358cd2dc25cecda","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}