{"id":"https://openalex.org/W2139266884","doi":"https://doi.org/10.21437/eurospeech.2003-637","title":"Exploiting order-preserving perfect hashing to speedup n-gram language model lookahead","display_name":"Exploiting order-preserving perfect hashing to speedup n-gram language model lookahead","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2139266884","doi":"https://doi.org/10.21437/eurospeech.2003-637","mag":"2139266884"},"language":"en","primary_location":{"id":"doi:10.21437/eurospeech.2003-637","is_oa":false,"landing_page_url":"https://doi.org/10.21437/eurospeech.2003-637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"8th European Conference on Speech Communication and Technology (Eurospeech 2003)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100371535","display_name":"Xiaolong Li","orcid":"https://orcid.org/0000-0001-7493-2650"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaolong Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033518479","display_name":"Yunxin Zhao","orcid":"https://orcid.org/0000-0001-5511-3692"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yunxin Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2325,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48275862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2281","last_page":"2284"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.989799976348877,"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/T10651","display_name":"IPv6, Mobility, Handover, Networks, Security","score":0.9718000292778015,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8019530773162842},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7572643160820007},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7522521018981934},{"id":"https://openalex.org/keywords/trigram","display_name":"Trigram","score":0.6600270867347717},{"id":"https://openalex.org/keywords/bigram","display_name":"Bigram","score":0.640184760093689},{"id":"https://openalex.org/keywords/bit-array","display_name":"Bit array","score":0.5843256115913391},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.563491702079773},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.5416285395622253},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5318792462348938},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.47565385699272156},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.46094760298728943},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.45682716369628906},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4392533004283905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40992027521133423},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3286752700805664},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.15985780954360962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10819333791732788},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.08257362246513367},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08115977048873901},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07937279343605042}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8019530773162842},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7572643160820007},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7522521018981934},{"id":"https://openalex.org/C137546455","wikidata":"https://www.wikidata.org/wiki/Q3213474","display_name":"Trigram","level":2,"score":0.6600270867347717},{"id":"https://openalex.org/C108757681","wikidata":"https://www.wikidata.org/wiki/Q2773912","display_name":"Bigram","level":3,"score":0.640184760093689},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.5843256115913391},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.563491702079773},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.5416285395622253},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5318792462348938},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.47565385699272156},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.46094760298728943},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.45682716369628906},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4392533004283905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40992027521133423},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3286752700805664},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.15985780954360962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10819333791732788},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.08257362246513367},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08115977048873901},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07937279343605042},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21437/eurospeech.2003-637","is_oa":false,"landing_page_url":"https://doi.org/10.21437/eurospeech.2003-637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"8th European Conference on Speech Communication and Technology (Eurospeech 2003)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W103696213","https://openalex.org/W1501633760","https://openalex.org/W2088802182","https://openalex.org/W2097978681","https://openalex.org/W2106669799","https://openalex.org/W2113094193","https://openalex.org/W2146005787","https://openalex.org/W2149298150"],"related_works":["https://openalex.org/W2011383762","https://openalex.org/W4327499987","https://openalex.org/W2048414027","https://openalex.org/W3173084154","https://openalex.org/W2940857995","https://openalex.org/W2895883758","https://openalex.org/W2021988580","https://openalex.org/W2018220357","https://openalex.org/W4242274649","https://openalex.org/W2135525032"],"abstract_inverted_index":{"Minimum":[0],"Perfect":[1],"Hashing":[2],"(MPH)":[3],"has":[4],"recently":[5],"been":[6],"shown":[7],"successful":[8],"in":[9,16,71,108],"reducing":[10],"Language":[11],"Model":[12],"(LM)":[13],"lookahead":[14,53,99],"time":[15,100],"LVCSR":[17],"decoding.":[18],"In":[19],"this":[20],"paper":[21],"we":[22],"propose":[23],"to":[24,36],"exploit":[25],"the":[26,61,81,97,111],"orderpreserving":[27,56],"(OP)":[28],"property":[29],"of":[30,84,106,114],"a":[31,104],"string-key":[32],"based":[33],"MPH":[34,57,86,116],"function":[35],"further":[37],"reduce":[38],"hashing":[39],"operation":[40],"and":[41,54,69,87,94],"speed":[42],"up":[43],"LM":[44,52,98],"lookahead.":[45],"A":[46],"subtree":[47,88],"structure":[48,62,90],"is":[49,58],"proposed":[50,82],"for":[51,91],"an":[55],"integrated":[59],"into":[60],"design.":[63],"Subtrees":[64],"are":[65],"generated":[66],"on":[67,76],"demand":[68],"stored":[70],"caches.":[72],"Experiments":[73],"were":[74],"performed":[75],"Switchboard":[77],"data.":[78],"By":[79],"using":[80,115],"method":[83],"OP":[85],"cache":[89],"both":[92],"trigrams":[93],"backoff":[95],"bigrams,":[96],"was":[101],"reduced":[102],"by":[103],"factor":[105],"2.9":[107],"comparison":[109],"with":[110],"baseline":[112],"case":[113],"alone.":[117]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}