{"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":"/paper/benchmarking-natural-language-understanding","title":"Benchmarking Natural Language Understanding Services for building Conversational Agents","arxiv_id":"1903.05566","date":"2019-03-13","proceeding":null,"authors":["Xingkun Liu","Arash Eshghi","Pawel Swietojanski","Verena Rieser"],"abstract":"We have recently seen the emergence of several publicly available Natural\nLanguage Understanding (NLU) toolkits, which map user utterances to structured,\nbut more abstract, Dialogue Act (DA) or Intent specifications, while making\nthis process accessible to the lay developer. In this paper, we present the\nfirst wide coverage evaluation and comparison of some of the most popular NLU\nservices, on a large, multi-domain (21 domains) dataset of 25K user utterances\nthat we have collected and annotated with Intent and Entity Type specifications\nand which will be released as part of this submission. The results show that on\nIntent classification Watson significantly outperforms the other platforms,\nnamely, Dialogflow, LUIS and Rasa; though these also perform well.\nInterestingly, on Entity Type recognition, Watson performs significantly worse\ndue to its low Precision. Again, Dialogflow, LUIS and Rasa perform well on this\ntask.","url_abs":"http://arxiv.org/abs/1903.05566v3","url_pdf":"http://arxiv.org/pdf/1903.05566v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/xliuhw/NLU-Evaluation-Data","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"CC-BY-4.0"}},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/Lackel/DNA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/PolyAI-LDN/polyai-models","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/PolyAI-LDN/task-specific-datasets","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"CC-BY-4.0"}},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/amazon-science/intent-aware-encoder","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/haodeqi/BenchmarkingIntentDetection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/lackel/hierarchical_weighted_scl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/lackel/sdc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"benchmarking-natural-language-understanding","repo_url":"https://github.com/RasaHQ/rasa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"intent-classification","task_name":"Intent Classification"},{"task_slug":"natural-language-understanding","task_name":"Natural Language Understanding"},{"task_slug":"intent-classification-1","task_name":"intent-classification"}],"methods":[],"datasets_introduced":[{"slug":"hwu64","name":"HWU64","full_name":"HWU64"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.05566","atlas_url":"https://app.syntology.ai/?focus=1903.05566","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1903.05566"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.05566\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.05566"},"call":"get_concepts_for_paper(arxiv_id=\"1903.05566\")"}],"by_repo":[{"repo":"xliuhw/NLU-Evaluation-Data","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Lackel/DNA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2310.10151"],"harvested_for_calls":[{"arxiv_id":"2310.10151","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.10151"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.10151\")"}]},{"repo":"PolyAI-LDN/polyai-models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PolyAI-LDN/task-specific-datasets","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"amazon-science/intent-aware-encoder","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2003.04807"],"harvested_for_calls":[{"arxiv_id":"2003.04807","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2003.04807"},"call":"get_harvested_code_for_paper(arxiv_id=\"2003.04807\")"}]},{"repo":"haodeqi/BenchmarkingIntentDetection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lackel/hierarchical_weighted_scl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.07733"],"harvested_for_calls":[{"arxiv_id":"2210.07733","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.07733"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.07733\")"}]},{"repo":"lackel/sdc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"RasaHQ/rasa","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1910.00912"],"harvested_for_calls":[{"arxiv_id":"1910.00912","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.00912"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.00912\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"65a3469e8d02a237e7e6bff5f86d89bd4b169b3589e21f4d09e8a10a535f8dde","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}