{"id":"https://openalex.org/W262524825","doi":"https://doi.org/10.21437/interspeech.2010-76","title":"Using robust viterbi algorithm and HMM-modeling in unit selection TTS to replace units of poor quality","display_name":"Using robust viterbi algorithm and HMM-modeling in unit selection TTS to replace units of poor quality","publication_year":2010,"publication_date":"2010-09-26","ids":{"openalex":"https://openalex.org/W262524825","doi":"https://doi.org/10.21437/interspeech.2010-76","mag":"262524825"},"language":"en","primary_location":{"id":"doi:10.21437/interspeech.2010-76","is_oa":false,"landing_page_url":"https://doi.org/10.21437/interspeech.2010-76","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Interspeech 2010","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060434979","display_name":"Hanna Sil\u00e9n","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hanna Sil\u00e9n","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014011829","display_name":"Elina Helander","orcid":"https://orcid.org/0000-0002-0076-0590"},"institutions":[{"id":"https://openalex.org/I150589677","display_name":"Tampere University of Applied Sciences","ror":"https://ror.org/00bwtjf83","country_code":"FI","type":"education","lineage":["https://openalex.org/I150589677"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Elina Helander","raw_affiliation_strings":["Tampere University of Applied Sciences, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Tampere University of Applied Sciences, Tampere, Finland","institution_ids":["https://openalex.org/I150589677"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112039585","display_name":"Jani Nurminen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jani Nurminen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084387674","display_name":"Konsta Koppinen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Konsta Koppinen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007583477","display_name":"Moncef Gabbouj","orcid":"https://orcid.org/0000-0002-9788-2323"},"institutions":[{"id":"https://openalex.org/I150589677","display_name":"Tampere University of Applied Sciences","ror":"https://ror.org/00bwtjf83","country_code":"FI","type":"education","lineage":["https://openalex.org/I150589677"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Moncef Gabbouj","raw_affiliation_strings":["Tampere University of Applied Sciences, Tampere, Finland"],"affiliations":[{"raw_affiliation_string":"Tampere University of Applied Sciences, Tampere, Finland","institution_ids":["https://openalex.org/I150589677"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5060434979"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3274,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88901707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"166","last_page":"169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10201","display_name":"Speech Recognition and Synthesis","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10201","display_name":"Speech Recognition and Synthesis","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10860","display_name":"Speech and Audio Processing","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12031","display_name":"Speech and dialogue systems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.9502098560333252},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.8318812847137451},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.7430558204650879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7205722332000732},{"id":"https://openalex.org/keywords/forward-algorithm","display_name":"Forward algorithm","score":0.7020730376243591},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5788418054580688},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.5383917093276978},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.5286120772361755},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4758826792240143},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.47475722432136536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42834946513175964},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.42774662375450134},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3471663296222687},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.33121800422668457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3126314580440521},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.20519617199897766},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.1545746624469757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15345051884651184},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09645304083824158},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.08434489369392395}],"concepts":[{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.9502098560333252},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.8318812847137451},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.7430558204650879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7205722332000732},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.7020730376243591},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5788418054580688},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.5383917093276978},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.5286120772361755},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4758826792240143},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.47475722432136536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42834946513175964},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.42774662375450134},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3471663296222687},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.33121800422668457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3126314580440521},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20519617199897766},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.1545746624469757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15345051884651184},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09645304083824158},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.08434489369392395},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.21437/interspeech.2010-76","is_oa":false,"landing_page_url":"https://doi.org/10.21437/interspeech.2010-76","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Interspeech 2010","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.2558","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tut.fi/%7Emoncef/publications/using-robust-viterbi-ISCA-2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W18378689","https://openalex.org/W22981672","https://openalex.org/W96779174","https://openalex.org/W1842848203","https://openalex.org/W2049686551","https://openalex.org/W2097644822","https://openalex.org/W2150658333","https://openalex.org/W2153160479","https://openalex.org/W2155433314","https://openalex.org/W2159528802","https://openalex.org/W2400063444","https://openalex.org/W3142087749"],"related_works":["https://openalex.org/W2062804535","https://openalex.org/W2993094530","https://openalex.org/W2143297499","https://openalex.org/W2896749479","https://openalex.org/W2767243160","https://openalex.org/W2073817053","https://openalex.org/W2593596363","https://openalex.org/W3093520795","https://openalex.org/W2171280163","https://openalex.org/W2136652457"],"abstract_inverted_index":{"In":[0],"hidden":[1,72],"Markov":[2,73],"model-based":[3,74],"unit":[4,11,87],"selection":[5,12,29],"synthesis,":[6],"the":[7,40,44,63,79,90,94],"benefits":[8],"of":[9,81],"both":[10],"and":[13,42,61],"statistical":[14],"parametric":[15],"speech":[16],"synthesis":[17],"are":[18,35,69],"combined.":[19],"However,":[20],"conventional":[21],"Viterbi":[22,53,83],"algorithm":[23,54,84],"is":[24],"forced":[25],"to":[26,50,93],"do":[27],"a":[28],"also":[30],"when":[31],"no":[32],"suitable":[33],"units":[34,60,68],"available.":[36],"This":[37],"can":[38,56],"drift":[39],"search":[41],"decrease":[43],"overall":[45],"quality.":[46],"Consequently,":[47],"we":[48],"propose":[49],"use":[51,80],"robust":[52,82],"that":[55,78],"simultaneously":[57],"detect":[58],"bad":[59],"select":[62],"best":[64],"sequence.":[65],"The":[66],"unsuitable":[67],"replaced":[70],"using":[71],"synthesis.":[75],"Evaluations":[76],"indicate":[77],"combined":[85],"with":[86],"replacement":[88],"increases":[89],"quality":[91],"compared":[92],"traditional":[95],"algorithm.":[96]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}