{"id":"https://openalex.org/W200927961","doi":"https://doi.org/10.21437/icslp.2002-401","title":"An efficient algorithm for the n-best-strings problem","display_name":"An efficient algorithm for the n-best-strings problem","publication_year":2002,"publication_date":"2002-09-16","ids":{"openalex":"https://openalex.org/W200927961","doi":"https://doi.org/10.21437/icslp.2002-401","mag":"200927961"},"language":"en","primary_location":{"id":"doi:10.21437/icslp.2002-401","is_oa":false,"landing_page_url":"https://doi.org/10.21437/icslp.2002-401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Conference on Spoken Language Processing (ICSLP 2002)","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/A5058849006","display_name":"Mehryar Mohri","orcid":"https://orcid.org/0000-0002-3987-9847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mehryar Mohri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014137885","display_name":"Michael Riley","orcid":"https://orcid.org/0009-0002-9449-025X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Riley","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":null,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1313","last_page":"1316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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/T12029","display_name":"DNA and Biological Computing","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6594586968421936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46613451838493347},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.42580270767211914}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6594586968421936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46613451838493347},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.42580270767211914}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.21437/icslp.2002-401","is_oa":false,"landing_page_url":"https://doi.org/10.21437/icslp.2002-401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Conference on Spoken Language Processing (ICSLP 2002)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.6436","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.6436","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/~mohri/postscript/nbest.ps","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":8,"referenced_works":["https://openalex.org/W181370797","https://openalex.org/W1505482284","https://openalex.org/W1506437980","https://openalex.org/W1578332044","https://openalex.org/W1977697308","https://openalex.org/W2036102925","https://openalex.org/W2064283427","https://openalex.org/W2125529971"],"related_works":["https://openalex.org/W2393888177","https://openalex.org/W2117183908","https://openalex.org/W2544423928","https://openalex.org/W2115794623","https://openalex.org/W3115392711","https://openalex.org/W2533127928","https://openalex.org/W2360264381","https://openalex.org/W1613730747","https://openalex.org/W2067173559","https://openalex.org/W2541389358"],"abstract_inverted_index":{"problem":[0,6],"in":[1,9,67,85],"a":[2,14,44,68],"weighted":[3],"automaton.":[4],"This":[5],"arises":[7],"commonly":[8],"speech":[10],"recognition":[11],"applications":[12],"when":[13],"ranked":[15],"list":[16],"of":[17,47],"unique":[18],"recognizer":[19,93],"hypotheses":[20,34],"is":[21,26],"desired.":[22],"We":[23,42,54],"believe":[24],"this":[25,86],"the":[27,39,48],"first":[28],"n-best":[29,40],"algorithm":[30,49],"to":[31],"remove":[32],"redundant":[33],"before":[35],"rather":[36],"than":[37],"after":[38],"determination.":[41],"give":[43],"detailed":[45],"description":[46],"and":[50,61],"demonstrate":[51],"its":[52,59],"correctness.":[53],"report":[55],"experimental":[56],"results":[57],"showing":[58],"efficiency":[60],"practicality":[62],"even":[63],"for":[64],"large":[65],"n":[66],"40;":[69],"000-word":[70],"vocabulary":[71],"North":[72],"American":[73],"Business":[74],"News":[75],"(NAB)":[76],"task.":[77],"In":[78],"particular,":[79],"we":[80],"show":[81],"that":[82],"1000-best":[83],"generation":[84],"task":[87],"requires":[88],"negligible":[89],"added":[90],"time":[91],"over":[92],"lattice":[94],"generation.":[95]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}