{"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/tuke-at-mediaeval-2015-quesst","title":"TUKE at MediaEval 2015 QUESST","arxiv_id":null,"date":"2015-09-14","proceeding":"MediaEval 2015 Workshop 2015 9","authors":["Jozef Vavrek","Peter Viszlay","Martin Lojka","Matúš Pleva","Jozef Juhár","Milan Rusko"],"abstract":"In this paper, we present our retrieving system for QUery by Example Search on Speech Task (QUESST), comprising the posteriorgram-based modeling approach along with the weighted fast sequential dynamic time warping algorithm (WFS-DTW). For this year, our main effort was directed toward developing language-dependent keyword matching system, utilizing all available information about spoken languages, considering all queries and utterance files. Despite the fact that the retrieving algorithm is the same as we used in previous year, a big novelty resides in the way of utilizing the information about all languages spoken in the retrieving database. Two low-resource systems using language dependent acoustic unit modeling (AUM) approaches have been submitted. The first one, called supervised, employs four well-trained phonetic decoders using acoustic models trained on time-aligned and annotated speech. The second one, defined as unsupervised, uses blind phonetic segmentation for the specific language where the information about spoken language is extracted from Mediaeval 2013 and Mediaeval 2014 databases. Considering the influence on the overall retrieving performance, the acoustic model adaptation to the specific language through retraining procedure was investigated for both approaches as well.","url_abs":"http://ceur-ws.org/Vol-1436/Paper45.pdf","url_pdf":"http://ceur-ws.org/Vol-1436/Paper45.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"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE p-S late submission (dev)","rank_in_archive_order":37,"of":69,"metrics":{"ATWV":"0.055","Cnxe":"0.962","MTWV":"0.059","MinCnxe":"0.940"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE p-S late submission (eval)","rank_in_archive_order":38,"of":69,"metrics":{"ATWV":"0.046","Cnxe":"0.963","MTWV":"0.049","MinCnxe":"0.940"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE p-S (dev)","rank_in_archive_order":39,"of":69,"metrics":{"ATWV":"0.022","Cnxe":"0.970","ISF":"2.312","MTWV":"0.036","MinCnxe":"0.947","PL":"0.068","PMUi":"0.250","PMUs":"1.874","SSF":"0.0061"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE g-U late submission (dev)","rank_in_archive_order":40,"of":69,"metrics":{"ATWV":"0.032","Cnxe":"0.970","MTWV":"0.035","MinCnxe":"0.951"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE p-S (eval)","rank_in_archive_order":42,"of":69,"metrics":{"ATWV":"0.002","Cnxe":"0.971","MTWV":"0.022","MinCnxe":"0.953"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE g-U (eval)","rank_in_archive_order":43,"of":69,"metrics":{"ATWV":"-0.01","Cnxe":"0.973","MTWV":"0.023","MinCnxe":"0.953"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE g-U (dev)","rank_in_archive_order":45,"of":69,"metrics":{"ATWV":"0.0001","Cnxe":"0.974","ISF":"0.383","MTWV":"0.031","MinCnxe":"0.953","PL":"0.033","PMUi":"0.515","PMUs":"2.292","SSF":"0.0066"},"uses_additional_data":false},{"leaderboard":"/sota/keyword-spotting-on-quesst","task":"Keyword Spotting","dataset":"QUESST","model":"TUKE g-U late submission (eval)","rank_in_archive_order":46,"of":69,"metrics":{"ATWV":"0.028","Cnxe":"0.974","MTWV":"0.032","MinCnxe":"0.954"},"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":"9343e1156bab43d79fd2a1345477f6f2960201701b14c869bdf340d5c9c3d5b5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}