{"url":"/sota/voice-conversion-on-zerospeech-2019-english","task":{"name":"Voice Conversion","url":"/task/voice-conversion","note":null},"dataset":{"name":"ZeroSpeech 2019 English","url":null},"category":"Audio","categories":["Audio","Speech"],"category_note":null,"description":"I remember all the summer days\r\nDrinking wine in the sunshine\r\nI hope it never leaves\r\nAnd I remember all the summer nights\r\nStaring at you in the moonlight\r\nI hope you never leave 'cause baby\r\nYou're so good to me\r\nYou have all that all that I ever need\r\nIt's easy to love you\r\nSo easy to love you\r\nOoh you know it's true\r\nThe best part of being with you\r\nTo know you're with me\r\nIt's not so hard to say\r\nIt's easy to love you\r\nI remember all those winter days frozen\r\nIn the cold tryin' to get you home\r\nShould I be moving in, we can be together then\r\nRemember spending all those winter nights\r\nStayin' inside by the warm fire\r\nYeah you gotta know that I can never let you go\r\nYou and I have the rest of our lives to say\r\nIt's easy to love you\r\nSo easy to love you\r\nOoh you know it's true\r\nThe best part of being with you\r\nTo know you're with me\r\nIt's not so hard to say\r\nIt's easy to love you\r\nCan anybody else see it?\r\nMm, can anybody else see what I do?\r\nCan anybody else feel it?\r\nOh, can anybody else feel the way I do?\r\nBut now I'm with you\r\nHard to forget all the moments when\r\nWe'd be sitting there hoping it would never end\r\n'Cause this is meant to be\r\nSo baby, will you marry me?\r\nIt's easy to love you\r\nSo easy to love you\r\nOoh, you know it's true\r\nThe best part of being with you\r\nTo know you are with me\r\nIt's not so hard to say\r\nIt's easy to love you\r\nYou and me will be together\r\nI know our love will last forever\r\nYou and me will be together\r\nI know our love will last forever\r\nYou know it's true\r\nThe best part of being with you\r\nYou're easy to love\r\n\r\n<span class=\"description-source\">Source: [Joint training framework for text-to-speech and voice conversion using multi-source Tacotron and WaveNet ](https://arxiv.org/abs/1903.12389)</span>","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":["Speaker Similarity"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Speaker Similarity":null}},"counts":{"rows":2,"rows_with_code":2,"rows_with_paper_page":2,"rows_dated":2,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"VQ-CPC","metrics":{"Speaker Similarity":"3.8"},"uses_additional_data":true,"paper_date":"2020-05-19","paper":"/paper/vector-quantized-neural-networks-for-acoustic","paper_url":"https://arxiv.org/abs/2005.09409v2","paper_title":"Vector-quantized neural networks for acoustic unit discovery in the ZeroSpeech 2020 challenge","code":"https://github.com/bshall/ZeroSpeech","n_code_links":2,"syntology":null},{"rank_in_archive_order":2,"model":"VQ-VAE","metrics":{"Speaker Similarity":"3.49"},"uses_additional_data":false,"paper_date":"2020-05-19","paper":"/paper/vector-quantized-neural-networks-for-acoustic","paper_url":"https://arxiv.org/abs/2005.09409v2","paper_title":"Vector-quantized neural networks for acoustic unit discovery in the ZeroSpeech 2020 challenge","code":"https://github.com/bshall/ZeroSpeech","n_code_links":2,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+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"}}}