{"url":"/sota/intent-detection-on-snips","task":{"name":"Intent Detection","url":"/task/intent-detection","note":null},"dataset":{"name":"SNIPS","url":"/dataset/snips"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"**Intent Detection** is a task of determining the underlying purpose or goal behind a user's search query given a context. The task plays a significant role in search and recommendations. \r\nA traditional approach for intent detection implies using an intent detector model to classify user search query into predefined intent categories, given a context.\r\nOne of the key challenges of the task implies identifying user intents for cold-start sessions, i.e., search sessions initiated by a non-logged-in\r\nor unrecognized user.\r\n\r\n<span class=\"description-source\">Source: [Analyzing and Predicting Purchase Intent in E-commerce: Anonymous vs. Identified Customers](https://arxiv.org/abs/2012.08777)</span>\r\n<span class=\"description-source\">","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":10,"rows_with_code":9,"rows_with_paper_page":10,"rows_dated":10,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"CTRAN","metrics":{"Accuracy":"99.42"},"uses_additional_data":false,"paper_date":"2023-03-19","paper":"/paper/ctran-cnn-transformer-based-network-for","paper_url":"https://arxiv.org/abs/2303.10606v1","paper_title":"CTRAN: CNN-Transformer-based Network for Natural Language Understanding","code":"https://github.com/rafiepour/CTran","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"Stack-Propagation (+BERT)","metrics":{"Accuracy":"99.0"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/a-stack-propagation-framework-with-token","paper_url":"https://arxiv.org/abs/1909.02188v1","paper_title":"A Stack-Propagation Framework with Token-Level Intent Detection for Spoken Language Understanding","code":"https://github.com/LeePleased/StackPropagation-SLU","n_code_links":2,"syntology":null},{"rank_in_archive_order":3,"model":"JointBERT-CAE","metrics":{"Accuracy":"98.3"},"uses_additional_data":false,"paper_date":"2022-09-21","paper":"/paper/cae-mechanism-to-diminish-the-class","paper_url":"https://link.springer.com/chapter/10.1007/978-3-031-16210-7_12","paper_title":"CAE: Mechanism to Diminish the Class Imbalanced in SLU Slot Filling Task","code":"https://github.com/phuongnm94/JointBERT_CAE","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"AGIF","metrics":{"Accuracy":"98.1"},"uses_additional_data":false,"paper_date":"2020-04-21","paper":"/paper/td-gin-token-level-dynamic-graph-interactive","paper_url":"https://arxiv.org/abs/2004.10087v4","paper_title":"AGIF: An Adaptive Graph-Interactive Framework for Joint Multiple Intent Detection and Slot Filling","code":"https://github.com/LooperXX/AGIF","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"Stack-Propagation","metrics":{"Accuracy":"98.00"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/a-stack-propagation-framework-with-token","paper_url":"https://arxiv.org/abs/1909.02188v1","paper_title":"A Stack-Propagation Framework with Token-Level Intent Detection for Spoken Language Understanding","code":"https://github.com/LeePleased/StackPropagation-SLU","n_code_links":2,"syntology":null},{"rank_in_archive_order":6,"model":"LIDSNet","metrics":{"Accuracy":"98.0"},"uses_additional_data":false,"paper_date":"2021-10-06","paper":"/paper/lidsnet-a-lightweight-on-device-intent","paper_url":"https://arxiv.org/abs/2110.15717v1","paper_title":"LIDSNet: A Lightweight on-device Intent Detection model using Deep Siamese Network","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":7,"model":"SF-ID","metrics":{"Accuracy":"97.43"},"uses_additional_data":false,"paper_date":"2019-06-30","paper":"/paper/a-novel-bi-directional-interrelated-model-for","paper_url":"https://arxiv.org/abs/1907.00390v1","paper_title":"A Novel Bi-directional Interrelated Model for Joint Intent Detection and Slot Filling","code":"https://github.com/ZephyrChenzf/SF-ID-Network-For-NLU","n_code_links":2,"syntology":null},{"rank_in_archive_order":8,"model":"SF-ID (BLSTM) network","metrics":{"Accuracy":"97.43"},"uses_additional_data":false,"paper_date":"2019-06-30","paper":"/paper/a-novel-bi-directional-interrelated-model-for","paper_url":"https://arxiv.org/abs/1907.00390v1","paper_title":"A Novel Bi-directional Interrelated Model for Joint Intent Detection and Slot Filling","code":"https://github.com/ZephyrChenzf/SF-ID-Network-For-NLU","n_code_links":2,"syntology":null},{"rank_in_archive_order":9,"model":"Capsule-NLU","metrics":{"Accuracy":"97.3"},"uses_additional_data":false,"paper_date":"2018-12-22","paper":"/paper/joint-slot-filling-and-intent-detection-via","paper_url":"https://arxiv.org/abs/1812.09471v2","paper_title":"Joint Slot Filling and Intent Detection via Capsule Neural Networks","code":"https://github.com/czhang99/Capsule-NLU","n_code_links":3,"syntology":null},{"rank_in_archive_order":10,"model":"Slot-Gated BLSTM with Attension","metrics":{"Accuracy":"97.00"},"uses_additional_data":false,"paper_date":"2018-06-01","paper":"/paper/slot-gated-modeling-for-joint-slot-filling","paper_url":"https://aclanthology.org/N18-2118","paper_title":"Slot-Gated Modeling for Joint Slot Filling and Intent Prediction","code":"https://github.com/MiuLab/SlotGated-SLU","n_code_links":2,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}