{"id":"https://openalex.org/W2115753373","doi":"https://doi.org/10.1162/089120103321337467","title":"Weighted Deductive Parsing and Knuth's Algorithm","display_name":"Weighted Deductive Parsing and Knuth's Algorithm","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W2115753373","doi":"https://doi.org/10.1162/089120103321337467","mag":"2115753373"},"language":"en","primary_location":{"id":"doi:10.1162/089120103321337467","is_oa":true,"landing_page_url":"https://doi.org/10.1162/089120103321337467","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/089120103321337467","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/089120103321337467","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088112856","display_name":"Mark-Jan Nederhof","orcid":"https://orcid.org/0000-0002-1845-6829"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark-Jan Nederhof","raw_affiliation_strings":["Faculty of Arts, Humanities Computing, University of Groningen, P.O. Box 716, NL-9700 AS Groningen, The Netherlands. Secondary affiliation is the German Research Center for Artificial Intelligence (DFKI)","Secondary affiliation is the German Research Center for Artificial Intelligence (DFKI)","Faculty of Arts, Humanities Computing, University of Groningen, P.O. Box 716, NL-9700 AS Groningen, The Netherlands. Secondary affiliation is the German Research Center for Artificial Intelligence (DFKI). E-mail:"],"affiliations":[{"raw_affiliation_string":"Faculty of Arts, Humanities Computing, University of Groningen, P.O. Box 716, NL-9700 AS Groningen, The Netherlands. Secondary affiliation is the German Research Center for Artificial Intelligence (DFKI)","institution_ids":[]},{"raw_affiliation_string":"Secondary affiliation is the German Research Center for Artificial Intelligence (DFKI)","institution_ids":[]},{"raw_affiliation_string":"Faculty of Arts, Humanities Computing, University of Groningen, P.O. Box 716, NL-9700 AS Groningen, The Netherlands. Secondary affiliation is the German Research Center for Artificial Intelligence (DFKI). E-mail:","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088112856"],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":null,"apc_paid":null,"fwci":3.2999,"has_fulltext":true,"cited_by_count":71,"citation_normalized_percentile":{"value":0.92628464,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"1","first_page":"135","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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.9988999962806702,"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.9987999796867371,"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.9962999820709229,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7648873329162598},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6936772465705872},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6660020351409912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6473483443260193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5066700577735901},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5053656697273254},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4935344457626343},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.40660446882247925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3666048049926758},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2786747217178345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2749589681625366},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13296940922737122},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07656601071357727}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7648873329162598},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6936772465705872},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6660020351409912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6473483443260193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5066700577735901},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5053656697273254},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4935344457626343},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.40660446882247925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3666048049926758},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2786747217178345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2749589681625366},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13296940922737122},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07656601071357727},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1162/089120103321337467","is_oa":true,"landing_page_url":"https://doi.org/10.1162/089120103321337467","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/089120103321337467","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire/5cfe8cd9-36c8-41ed-a17b-d50f81e16628","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/5cfe8cd9-36c8-41ed-a17b-d50f81e16628","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nederhof, MJ 2003, 'Weighted deductive parsing and Knuth's algorithm', Computational Linguistics, vol. 29, no. 1, pp. 135-143. https://doi.org/10.1162/089120103321337467","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:14d5811ac50e4818a43c98108275b22d","is_oa":true,"landing_page_url":"https://doaj.org/article/14d5811ac50e4818a43c98108275b22d","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Linguistics, Vol 29, Iss 1 (2021)","raw_type":"article"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/5cfe8cd9-36c8-41ed-a17b-d50f81e16628","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/5cfe8cd9-36c8-41ed-a17b-d50f81e16628","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nederhof, MJ 2003, 'Weighted deductive parsing and Knuth's algorithm', Computational Linguistics, vol. 29, no. 1, pp. 135-143. https://doi.org/10.1162/089120103321337467","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1162/089120103321337467","is_oa":true,"landing_page_url":"https://doi.org/10.1162/089120103321337467","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/089120103321337467","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320934","display_name":"Koninklijke Nederlandse Akademie van Wetenschappen","ror":"https://ror.org/043c0p156"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2115753373.pdf","grobid_xml":"https://content.openalex.org/works/W2115753373.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1502053752","https://openalex.org/W1541301615","https://openalex.org/W1577934069","https://openalex.org/W1586368951","https://openalex.org/W1955233831","https://openalex.org/W1970515221","https://openalex.org/W1975638108","https://openalex.org/W1982944197","https://openalex.org/W1991133427","https://openalex.org/W1999924358","https://openalex.org/W2035801902","https://openalex.org/W2066006804","https://openalex.org/W2066856273","https://openalex.org/W2084162167","https://openalex.org/W2087804070","https://openalex.org/W2112660220","https://openalex.org/W2148175641","https://openalex.org/W2152096446","https://openalex.org/W2164730904","https://openalex.org/W2169362686","https://openalex.org/W2169528473","https://openalex.org/W2752885492","https://openalex.org/W2911246871","https://openalex.org/W2988806182","https://openalex.org/W3037996278","https://openalex.org/W4231741839","https://openalex.org/W4241850027"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294","https://openalex.org/W4318196244"],"abstract_inverted_index":{"We":[0,17],"discuss":[1],"weighted":[2,52],"deductive":[3],"parsing":[4],"and":[5],"consider":[6],"the":[7,11,14,26,42,51],"problem":[8,28],"of":[9,22],"finding":[10],"derivation":[12],"with":[13],"lowest":[15],"weight.":[16],"show":[18],"that":[19,44],"Knuth's":[20,45],"generalization":[21],"Dijkstra's":[23],"algorithm":[24,46],"for":[25],"shortest-path":[27],"offers":[29],"a":[30],"general":[31],"method":[32],"to":[33],"solve":[34],"this":[35],"problem.":[36],"Our":[37],"approach":[38],"is":[39,47],"modular":[40],"in":[41],"sense":[43],"formulated":[48],"independently":[49],"from":[50],"deduction":[53],"system.":[54]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2025-10-10T00:00:00"}