{"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":"/method/fastpitch","slug":"fastpitch","name":"FastPitch","full_name":"FastPitch","full_name_withheld":false,"description_markdown":"**FastPitch** is a fully-parallel text-to-speech model based on FastSpeech, conditioned on fundamental frequency contours. The architecture of FastPitch is shown in the Figure. It is based on FastSpeech and composed mainly of two feed-forward [Transformer](https://paperswithcode.com/method/transformer) (FFTr) stacks. The first one operates in the resolution of input tokens, the second one in the resolution of the output frames. Let $x=\\left(x\\_{1}, \\ldots, x\\_{n}\\right)$ be the sequence of input lexical units, and $\\mathbf{y}=\\left(y\\_{1}, \\ldots, y\\_{t}\\right)$ be the sequence of target mel-scale spectrogram frames. The first FFTr stack produces the hidden representation $\\mathbf{h}=\\operatorname{FFTr}(\\mathbf{x})$. The hidden representation $h$ is used to make predictions about the duration and average pitch of every character with a 1-D CNN \r\n\r\n$$\r\n\\hat{\\mathbf{d}}=\\text { DurationPredictor }(\\mathbf{h}), \\quad \\hat{\\mathbf{p}}=\\operatorname{PitchPredictor}(\\mathbf{h})\r\n$$\r\n\r\nwhere $\\hat{\\mathbf{d}} \\in \\mathbb{N}^{n}$ and $\\hat{\\mathbf{p}} \\in \\mathbb{R}^{n}$. Next, the pitch is projected to match the dimensionality of the hidden representation $h \\in$ $\\mathbb{R}^{n \\times d}$ and added to $\\mathbf{h}$. The resulting sum $\\mathbf{g}$ is discretely upsampled and passed to the output FFTr, which produces the output mel-spectrogram sequence\r\n\r\n$$\r\n\\mathbf{g}=\\mathbf{h}+\\operatorname{PitchEmbedding}(\\mathbf{p})\r\n$$\r\n\r\n$$\r\n\\hat{\\mathbf{y}}=\\operatorname{FFTr}\\left([\\underbrace{g\\_{1}, \\ldots, g\\_{1}}\\_{d\\_{1}}, \\ldots \\underbrace{g\\_{n}, \\ldots, g\\_{n}}_{d\\_{n}}]\\right)\r\n$$\r\n\r\n\r\nGround truth $\\mathbf{p}$ and $\\mathbf{d}$ are used during training, and predicted $\\hat{\\mathbf{p}}$ and $\\hat{\\mathbf{d}}$ are used during inference. The model optimizes mean-squared error (MSE) between the predicted and ground-truth modalities\r\n\r\n$$\r\n\\mathcal{L}=\\|\\hat{\\mathbf{y}}-\\mathbf{y}\\|\\_{2}^{2}+\\alpha\\|\\hat{\\mathbf{p}}-\\mathbf{p}\\|\\_{2}^{2}+\\gamma\\|\\hat{\\mathbf{d}}-\\mathbf{d}\\|\\_{2}^{2}\r\n$$","description_state":"present","introduced_year":null,"introduced_by":{"title":"FastPitch: Parallel Text-to-speech with Pitch Prediction","paper":"/paper/fastpitch-parallel-text-to-speech-with-pitch","first_author":"Adrian Łańcucki","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/fastpitch-parallel-text-to-speech-with-pitch"},"source":{"url":"https://arxiv.org/abs/2006.06873v2","title":"FastPitch: Parallel Text-to-speech with Pitch Prediction","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Audio","area_id":"audio","collection":"Text-to-Speech Models","url":"/methods/category/text-to-speech-models","pwc_aliases":[]}],"n_papers_tagged":9,"archive_num_papers":9,"papers_newest_first":[{"paper":null,"slug":"efficient-training-strategies-for-natural","title":"Efficient training strategies for natural sounding speech synthesis and speaker adaptation based on FastPitch","date":"2024-10-09","arxiv_id":"2410.06787","n_code_links":0,"syntology":null},{"paper":null,"slug":"attempt-towards-stress-transfer-in-speech-to","title":"Attempt Towards Stress Transfer in Speech-to-Speech Machine Translation","date":"2024-03-07","arxiv_id":"2403.04178","n_code_links":0,"syntology":null},{"paper":null,"slug":"incremental-fastpitch-chunk-based-high","title":"Incremental FastPitch: Chunk-based High Quality Text to Speech","date":"2024-01-03","arxiv_id":"2401.01755","n_code_links":0,"syntology":null},{"paper":"/paper/improved-child-text-to-speech-synthesis","slug":"improved-child-text-to-speech-synthesis","title":"Improved Child Text-to-Speech Synthesis through Fastpitch-based Transfer Learning","date":"2023-11-07","arxiv_id":"2311.04313","n_code_links":1,"syntology":null},{"paper":"/paper/towards-building-text-to-speech-systems-for","slug":"towards-building-text-to-speech-systems-for","title":"Towards Building Text-To-Speech Systems for the Next Billion Users","date":"2022-11-17","arxiv_id":"2211.09536","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["gokulkarthik/text2speech"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"enhancement-of-pitch-controllability-using","title":"Enhancement of Pitch Controllability using Timbre-Preserving Pitch Augmentation in FastPitch","date":"2022-04-12","arxiv_id":"2204.05753","n_code_links":0,"syntology":null},{"paper":"/paper/generative-modeling-for-low-dimensional","slug":"generative-modeling-for-low-dimensional","title":"Generative Modeling for Low Dimensional Speech Attributes with Neural Spline Flows","date":"2022-03-03","arxiv_id":"2203.01786","n_code_links":1,"syntology":null},{"paper":null,"slug":"exploring-timbre-disentanglement-in-non","title":"Exploring Timbre Disentanglement in Non-Autoregressive Cross-Lingual Text-to-Speech","date":"2021-10-14","arxiv_id":"2110.07192","n_code_links":0,"syntology":null},{"paper":"/paper/fastpitch-parallel-text-to-speech-with-pitch","slug":"fastpitch-parallel-text-to-speech-with-pitch","title":"FastPitch: Parallel Text-to-speech with Pitch Prediction","date":"2020-06-11","arxiv_id":"2006.06873","n_code_links":6,"syntology":{"ran":8,"of":9,"n_ran_checked":7,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["NVIDIA/DeepLearningExamples"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper"]}}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":4,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/fastpitch/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/fastpitch/papers/ran/1","json":"/method/fastpitch/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/text-to-speech","name":"Text to Speech","papers":9},{"task":"/task/text-to-speech-1","name":"text-to-speech","papers":9},{"task":"/task/speech-synthesis","name":"Speech Synthesis","papers":5},{"task":"/task/text-to-speech-synthesis","name":"Text-To-Speech Synthesis","papers":4},{"task":"/task/diversity","name":"Diversity","papers":2},{"task":"/task/automatic-speech-recognition-2","name":"Automatic Speech Recognition","papers":1},{"task":"/task/automatic-speech-recognition","name":"Automatic Speech Recognition (ASR)","papers":1},{"task":"/task/disentanglement","name":"Disentanglement","papers":1},{"task":"/task/machine-translation","name":"Machine Translation","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1},{"task":"/task/sentence","name":"Sentence","papers":1},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":1},{"task":"/task/speech-synthesis-assamese","name":"Speech Synthesis - Assamese","papers":1},{"task":"/task/speech-synthesis-bengali","name":"Speech Synthesis - Bengali","papers":1},{"task":"/task/speech-synthesis-bodo","name":"Speech Synthesis - Bodo","papers":1},{"task":"/task/speech-synthesis-gujarati","name":"Speech Synthesis - Gujarati","papers":1},{"task":"/task/speech-synthesis-hindi","name":"Speech Synthesis - Hindi","papers":1},{"task":"/task/speech-synthesis-kannada","name":"Speech Synthesis - Kannada","papers":1},{"task":"/task/speech-synthesis-malayalam","name":"Speech Synthesis - Malayalam","papers":1},{"task":"/task/speech-synthesis-manipuri","name":"Speech Synthesis - Manipuri","papers":1}],"tasks_shown":20,"n_tasks":28,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":3},{"year":"2023","papers":1},{"year":"2024","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/fastpitch"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=FastPitch","read_at":"2026-10-05T00:55:53+00:00","query":"FastPitch","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2006.06873"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2006.06873","repositories":{"listed":6,"in_graph":6,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='2006.06873')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2006.06873","citations":418},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'FastPitch'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2006.06873","page":"/paper/fastpitch-parallel-text-to-speech-with-pitch","syntology_url":"https://syntology.ai/paper/2006.06873","in_graph_layer":true,"samples":9,"ran":8,"n_ran_checked":7,"n_instrument":1,"unverified":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 6 listed of 6 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:2006.06873, not a method entry. This answer is about arXiv:2006.06873, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"1fb7b488682a44af43fa806e27ab6c110624bb29f74d8e5f57900323a8b77b7c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}