{"id":"https://openalex.org/W2161901213","doi":"https://doi.org/10.1109/icassp.1982.1171695","title":"Dynamic time warping for isolated word recognition based on ordered graph searching techniques","display_name":"Dynamic time warping for isolated word recognition based on ordered graph searching techniques","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W2161901213","doi":"https://doi.org/10.1109/icassp.1982.1171695","mag":"2161901213"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1982.1171695","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171695","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing","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/A5101584963","display_name":"M. Brown","orcid":"https://orcid.org/0000-0003-4505-4574"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Brown","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110218997","display_name":"L. R. Rabiner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L. Rabiner","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101584963"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6359,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.71500387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":null,"first_page":"1255","last_page":"1258"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9997000098228455,"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/T13083","display_name":"Advanced Text Analysis Techniques","score":0.9861999750137329,"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/T13734","display_name":"Advanced Computational Techniques and Applications","score":0.9534000158309937,"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/dynamic-time-warping","display_name":"Dynamic time warping","score":0.9338310956954956},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7478620409965515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6585478782653809},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.567621111869812},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5290963649749756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5056476593017578},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5045596361160278},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4876162111759186},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4858929514884949},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47048118710517883},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4658812880516052},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.44212013483047485},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.42404720187187195},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3319935202598572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23764312267303467},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20878401398658752},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09312927722930908}],"concepts":[{"id":"https://openalex.org/C88516994","wikidata":"https://www.wikidata.org/wiki/Q1268863","display_name":"Dynamic time warping","level":2,"score":0.9338310956954956},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7478620409965515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6585478782653809},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.567621111869812},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5290963649749756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5056476593017578},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5045596361160278},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4876162111759186},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4858929514884949},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47048118710517883},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4658812880516052},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.44212013483047485},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.42404720187187195},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3319935202598572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23764312267303467},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20878401398658752},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09312927722930908},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1982.1171695","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171695","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1976882641","https://openalex.org/W2128160875","https://openalex.org/W2137089646","https://openalex.org/W2139106564","https://openalex.org/W2160645305"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W4391547476","https://openalex.org/W1966837078"],"abstract_inverted_index":{"The":[0,16,33,97],"technique":[1],"of":[2,18,35,61,73,106,123,135,144,177,193,219],"dynamic":[3],"time":[4,24,48,158,167],"warping":[5],"(DTW)":[6],"is":[7,21,31,38,99,128,151,162],"relied":[8],"on":[9,101],"heavily":[10],"in":[11,77,175,203,213,232],"isolated":[12,205],"word":[13,206],"recognition":[14,207,214],"systems.":[15],"advantage":[17],"using":[19,36],"DTW":[20,37,62,95,139,201],"that":[22,153],"reliable":[23],"alignment":[25,49,82],"between":[26],"reference":[27],"and":[28,130,170],"test":[29],"patterns":[30],"obtained.":[32],"disadvantage":[34],"the":[39,46,59,81,102,117,137,157,166,187,194,217,220,227],"heavy":[40],"computational":[41],"burden":[42],"required":[43],"to":[44,115,132,179,181,225,229],"find":[45,116],"optimal":[47],"path.":[50,83,119],"Several":[51],"alternative":[52,66,90],"procedures":[53],"have":[54],"been":[55],"proposed":[56],"for":[57,92,108,154,159,168],"reducing":[58],"computation":[60,143,161],"algorithms.":[63],"However":[64],"these":[65],"methods":[67],"generally":[68],"suffer":[69],"from":[70],"a":[71,94,109,113,124,172,199],"loss":[72,212],"optimality":[74],"or":[75],"precision":[76],"defining":[78],"points":[79],"along":[80],"In":[84],"this":[85],"paper":[86],"we":[87],"propose":[88],"another":[89],"procedure":[91,98,127],"implementing":[93],"algorithm.":[96,190],"based":[100],"well":[103],"known":[104],"class":[105],"techniques":[107],"directed":[110,125,188,195,221],"search":[111,126,189,196,222],"through":[112],"grid":[114],"\"shortest'":[118],"An":[120],"adaptive":[121],"version":[122],"defined":[129],"shown":[131,152],"be":[133,184],"capable":[134],"obtaining":[136],"exact":[138],"solution":[140],"with":[141,147,186,198],"reduced":[142],"distances":[145],"but":[146],"increased":[148],"overhead.":[149],"It":[150],"machines":[155],"where":[156],"distance":[160,233],"significantly":[163],"larger":[164],"than":[165],"combinatorics":[169],"overhead,":[171],"potential":[173],"gain":[174],"speed":[176],"up":[178],"3":[180,228],"1":[182,230],"can":[183],"realized":[185],"Formal":[191],"comparison":[192],"algorithm":[197],"standard":[200],"method,":[202],"an":[204],"test,":[208],"showed":[209],"essentially":[210],"no":[211],"accuracy":[215],"when":[216],"parameters":[218],"were":[223],"selected":[224],"realize":[226],"reduction":[231],"computation.":[234]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}