{"id":"https://openalex.org/W2099960657","doi":"https://doi.org/10.1109/icassp.2006.1661342","title":"Sparse Forward-Backward Using Minimum Divergence Beams for Fast Training Of Conditional Random Fields","display_name":"Sparse Forward-Backward Using Minimum Divergence Beams for Fast Training Of Conditional Random Fields","publication_year":2006,"publication_date":"2006-08-02","ids":{"openalex":"https://openalex.org/W2099960657","doi":"https://doi.org/10.1109/icassp.2006.1661342","mag":"2099960657"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2006.1661342","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2006.1661342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://scholarworks.umass.edu/cs_faculty_pubs/897","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111911743","display_name":"C. Pal","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. Pal","raw_affiliation_strings":["Department Computer Science, University of Massachusetts, Amherst, Amherst, MA, USA","Dept. of Comput. Sci., Massachusetts Amherst Univ., MA"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, University of Massachusetts, Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Massachusetts Amherst Univ., MA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028501178","display_name":"Charles Sutton","orcid":"https://orcid.org/0000-0002-0041-3820"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Sutton","raw_affiliation_strings":["Department Computer Science, University of Massachusetts, Amherst, Amherst, MA, USA","Dept. of Comput. Sci., Massachusetts Amherst Univ., MA"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, University of Massachusetts, Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Massachusetts Amherst Univ., MA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107835063","display_name":"Andrew McCallum","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. McCallum","raw_affiliation_strings":["Department Computer Science, University of Massachusetts, Amherst, Amherst, MA, USA","Dept. of Comput. Sci., Massachusetts Amherst Univ., MA"],"affiliations":[{"raw_affiliation_string":"Department Computer Science, University of Massachusetts, Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Massachusetts Amherst Univ., MA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111911743"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":8.8389,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97606146,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"5","issue":null,"first_page":"V","last_page":"581"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","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/T10181","display_name":"Natural Language Processing Techniques","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/T10201","display_name":"Speech Recognition and Synthesis","score":0.9994000196456909,"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/T10028","display_name":"Topic Modeling","score":0.9993000030517578,"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/beam-search","display_name":"Beam search","score":0.6721081137657166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6191917657852173},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.6017252206802368},{"id":"https://openalex.org/keywords/conditional-random-field","display_name":"Conditional random field","score":0.5941330194473267},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5922161936759949},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.5532719492912292},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.5508707165718079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.528328537940979},{"id":"https://openalex.org/keywords/crfs","display_name":"CRFS","score":0.5187923312187195},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4868447184562683},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4799078404903412},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4651200771331787},{"id":"https://openalex.org/keywords/kronecker-delta","display_name":"Kronecker delta","score":0.4503992795944214},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.39834064245224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3981381356716156},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3202158808708191},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26555222272872925},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2622050642967224},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2040516436100006}],"concepts":[{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.6721081137657166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6191917657852173},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6017252206802368},{"id":"https://openalex.org/C152565575","wikidata":"https://www.wikidata.org/wiki/Q1124538","display_name":"Conditional random field","level":2,"score":0.5941330194473267},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5922161936759949},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.5532719492912292},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.5508707165718079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.528328537940979},{"id":"https://openalex.org/C2775953691","wikidata":"https://www.wikidata.org/wiki/Q5013874","display_name":"CRFS","level":3,"score":0.5187923312187195},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4868447184562683},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4799078404903412},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4651200771331787},{"id":"https://openalex.org/C39482219","wikidata":"https://www.wikidata.org/wiki/Q192826","display_name":"Kronecker delta","level":2,"score":0.4503992795944214},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.39834064245224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3981381356716156},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3202158808708191},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26555222272872925},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2622050642967224},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2040516436100006},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/icassp.2006.1661342","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2006.1661342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:scholarworks.umass.edu:cs_faculty_pubs-1895","is_oa":false,"landing_page_url":"https://scholarworks.umass.edu/cs_faculty_pubs/896","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department Faculty Publication Series","raw_type":"text"},{"id":"pmh:oai:scholarworks.umass.edu:cs_faculty_pubs-1896","is_oa":true,"landing_page_url":"https://scholarworks.umass.edu/cs_faculty_pubs/897","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department Faculty Publication Series","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/eb4de8b5-b39f-4232-89c8-b970eb38be6f","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/eb4de8b5-b39f-4232-89c8-b970eb38be6f","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:scholarworks.umass.edu:20.500.14394/10484","is_oa":false,"landing_page_url":"https://hdl.handle.net/20.500.14394/10484","pdf_url":null,"source":{"id":"https://openalex.org/S4306402057","display_name":"Scholarworks (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:scholarworks.umass.edu:cs_faculty_pubs-1896","is_oa":true,"landing_page_url":"https://scholarworks.umass.edu/cs_faculty_pubs/897","pdf_url":null,"source":{"id":"https://openalex.org/S4306402240","display_name":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I24603500","host_organization_name":"University of Massachusetts Amherst","host_organization_lineage":["https://openalex.org/I24603500"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department Faculty Publication Series","raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6000000238418579,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1501187080","https://openalex.org/W1505652865","https://openalex.org/W1513861746","https://openalex.org/W1578856370","https://openalex.org/W1590438054","https://openalex.org/W1601941589","https://openalex.org/W2110485445","https://openalex.org/W2147880316","https://openalex.org/W2156515921","https://openalex.org/W3029645440","https://openalex.org/W4293775970","https://openalex.org/W6630243686","https://openalex.org/W6636079996","https://openalex.org/W6682082992"],"related_works":["https://openalex.org/W2356597680","https://openalex.org/W50079190","https://openalex.org/W182104056","https://openalex.org/W2111726165","https://openalex.org/W2011251309","https://openalex.org/W2511246383","https://openalex.org/W3108423214","https://openalex.org/W2796133761","https://openalex.org/W3088215229","https://openalex.org/W2184553228"],"abstract_inverted_index":{"Hidden":[0],"Markov":[1],"models":[2],"and":[3],"linear-chain":[4],"conditional":[5],"random":[6],"fields":[7],"(CRFs)":[8],"are":[9],"applicable":[10],"to":[11,134],"many":[12,31],"tasks":[13],"in":[14,141],"spoken":[15],"language":[16],"processing.":[17],"In":[18],"large":[19],"state":[20],"spaces,":[21],"however,":[22],"training":[23,60,126],"can":[24,53,58],"be":[25,54],"expensive,":[26],"because":[27],"it":[28],"often":[29],"requires":[30],"iterations":[32],"of":[33,77],"forward-backward.":[34],"Beam":[35],"search":[36],"is":[37,102],"a":[38,66,83,119,132],"standard":[39,50,120],"heuristic":[40],"for":[41,107],"controlling":[42],"complexity":[43],"during":[44,48],"Viterbi":[45,108],"decoding,":[46,109],"but":[47,110],"forward-backward,":[49,65],"beam":[51,70,86,99],"heuristics":[52],"dangerous,":[55],"as":[56],"they":[57],"make":[59],"unstable.":[61],"We":[62],"introduce":[63],"sparse":[64,115],"variational":[67],"perspective":[68],"on":[69,89],"methods":[71],"that":[72],"uses":[73],"an":[74],"approximating":[75],"mixture":[76],"Kronecker":[78],"delta":[79],"functions.":[80],"This":[81],"motivates":[82],"novel":[84],"minimum-divergence":[85],"criterion":[87],"based":[88],"minimizing":[90],"KL":[91],"divergence":[92],"between":[93],"the":[94],"respective":[95],"marginal":[96],"distributions.":[97],"Our":[98],"selection":[100],"approach":[101],"not":[103],"only":[104],"more":[105,112],"efficient":[106],"also":[111],"stable":[113],"within":[114],"forward-backward":[116],"training.":[117],"For":[118],"text-to-speech":[121],"problem,":[122],"we":[123],"reduce":[124],"CRF":[125],"time":[127],"fourfold":[128],"-":[129,137],"from":[130],"over":[131],"day":[133],"six":[135],"hours":[136],"with":[138],"no":[139],"loss":[140],"accuracy":[142]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}