{"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/the-nni-query-by-example-system-for-mediaeval","title":"The NNI Query-by-Example System for MediaEval 2014","arxiv_id":null,"date":"2014-10-16","proceeding":null,"authors":["Peng Yang","HaiHua Xu","Xiong Xiao","Lei Xie","Cheung-Chi Leung","Hongjie Chen","JIA YU","Hang Lv","Lei Wang","Su Jun Leow","Bin Ma","Eng Siong Chng","Haizhou Li"],"abstract":"In this paper we describe the system proposed by NNI (NWPU-NTU-I2R) team for the QUESST task within the Mediaeval 2014 evaluation. To solve the problem, we used both dynamic time warping (DTW) and symbolic search (SS) based approaches. The DTW system performs template matching using subsequence DTW algorithm and posterior representations. The symbolic search is performed on phone sequences generated by phone recognizers. For both symbolic and DTW search, partial sequence matching is performed to reduce missing rate, especially for query type 2 and 3. After fusing 9 DTW systems, 7 symbolic systems, and query length side information, we obtained 0.6023 actual normalized cross entropy (actCnxe) for all queries combined. For type 3 complex queries, we achieved 0.7252 actCnxe.","url_abs":"http://www.npu-aslp.org/lxie/papers/2014QUESST-NNI.pdf","url_pdf":"http://www.npu-aslp.org/lxie/papers/2014QUESST-NNI.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":[],"tasks":[{"task_slug":"dynamic-time-warping","task_name":"Dynamic Time Warping"},{"task_slug":"keyword-spotting","task_name":"Keyword Spotting"},{"task_slug":"template-matching","task_name":"Template Matching"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"NNI DTW(All Queries)","rank_in_archive_order":6,"of":69,"metrics":{"ATWV":"0.2918","Cnxe":"0.6925","MTWV":"0.2974","MinCnxe":"0.6816"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"NNI Symbolic(All Queries)","rank_in_archive_order":8,"of":69,"metrics":{"ATWV":"0.2696","Cnxe":"0.7322","MTWV":"0.2717","MinCnxe":"0.7293"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"NNI Choi(for the development set)","rank_in_archive_order":62,"of":69,"metrics":{"ATWV":"0.0692","Cnxe":"5.8940","MTWV":"0.0692","MinCnxe":"0.9595"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"NNI non-filtered(for the development set)","rank_in_archive_order":63,"of":69,"metrics":{"ATWV":"0.0768","Cnxe":"6.0905","MTWV":"0.0767","MinCnxe":"0.9571"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"49d2a3a59b0c8de2da62da05c182e7680507c332954e40cc8d46db2d19c6667f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}