{"id":"https://openalex.org/W42179106","doi":"https://doi.org/10.21437/interspeech.2005-620","title":"Perceptually-based data-driven join costs: comparing join types","display_name":"Perceptually-based data-driven join costs: comparing join types","publication_year":2005,"publication_date":"2005-09-04","ids":{"openalex":"https://openalex.org/W42179106","doi":"https://doi.org/10.21437/interspeech.2005-620","mag":"42179106"},"language":"en","primary_location":{"id":"doi:10.21437/interspeech.2005-620","is_oa":false,"landing_page_url":"https://doi.org/10.21437/interspeech.2005-620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Interspeech 2005","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/A5002689895","display_name":"Ann K. Syrdal","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ann K. Syrdal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028548414","display_name":"Alistair Conkie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alistair D. Conkie","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002689895"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2402,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.94016775,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2813","last_page":"2816"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9914000034332275,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/join","display_name":"Join (topology)","score":0.9456377625465393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7137691974639893},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.4634539783000946},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3526340126991272},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1935519576072693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06007105112075806}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.9456377625465393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7137691974639893},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.4634539783000946},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3526340126991272},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1935519576072693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06007105112075806},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.21437/interspeech.2005-620","is_oa":false,"landing_page_url":"https://doi.org/10.21437/interspeech.2005-620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Interspeech 2005","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.210","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/%7Ettsweb/tts/papers/2005_Interspeech/JoinCosts.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W60941773","https://openalex.org/W116305788","https://openalex.org/W1571061851","https://openalex.org/W1594031697","https://openalex.org/W1733696394","https://openalex.org/W1887401733","https://openalex.org/W1980719954","https://openalex.org/W2002182716","https://openalex.org/W2010860705","https://openalex.org/W2068804781","https://openalex.org/W2098920026","https://openalex.org/W2150658333","https://openalex.org/W2155631621","https://openalex.org/W2406674117","https://openalex.org/W2798510847"],"related_works":["https://openalex.org/W2381211091","https://openalex.org/W2091359263","https://openalex.org/W4283362132","https://openalex.org/W2469706965","https://openalex.org/W1589496614","https://openalex.org/W4234452035","https://openalex.org/W2159860101","https://openalex.org/W3187487646","https://openalex.org/W4205996836","https://openalex.org/W2733467199"],"abstract_inverted_index":{"Unit":[0],"selection":[1],"synthesis":[2,24,36],"has":[3],"improved":[4],"the":[5,29,32],"quality":[6],"of":[7,28,31,73],"synthetic":[8],"speech":[9,16],"by":[10,38],"making":[11],"it":[12],"possible":[13],"to":[14,21,48],"concatenate":[15],"from":[17,57],"a":[18,58],"large":[19],"database":[20],"produce":[22],"intelligible":[23],"while":[25],"preserving":[26],"much":[27],"naturalness":[30],"original":[33],"signal.":[34],"Such":[35],"is":[37],"no":[39],"means":[40],"perfect,":[41],"however,":[42],"and":[43,63,68],"this":[44],"paper":[45],"describes":[46],"work":[47],"achieve":[49],"more":[50],"optimal":[51],"joins":[52],"between":[53],"concatenated":[54],"units.":[55],"Results":[56],"psychoacoustic":[59],"experiment,":[60],"acoustic":[61],"parameters":[62],"phonetic":[64],"factors":[65],"are":[66],"analyzed":[67],"used":[69],"in":[70],"statistical":[71],"training":[72],"join":[74],"costs":[75],"so":[76],"that":[77],"audible":[78],"discontinuities":[79],"at":[80],"concatenation":[81],"boundaries":[82],"can":[83],"be":[84],"minimized.":[85],"1.":[86]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}