{"id":"https://openalex.org/W3088930208","doi":"https://doi.org/10.3115/980691.980725","title":"An alternative LR algorithm for TAGS","display_name":"An alternative LR algorithm for TAGS","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W3088930208","doi":"https://doi.org/10.3115/980691.980725","mag":"3088930208"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.3115/980691.980725","pdf_url":"https://dl.acm.org/doi/pdf/10.3115/980691.980725","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.3115/980691.980725","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":[],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Mark-Jan Nederhof","raw_affiliation_strings":["DFKI, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"DFKI, Saarbr\u00fccken, Germany","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5088112856"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.815,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.754906,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":81},"biblio":{"volume":"2","issue":null,"first_page":"946","last_page":"952"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9997,"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.9997,"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 Technology","score":0.9779,"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/T12031","display_name":"Dialogue Act Modeling for Spoken Language Systems","score":0.9771,"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/tree","display_name":"Tree (set theory)","score":0.5751276},{"id":"https://openalex.org/keywords/language-modeling","display_name":"Language Modeling","score":0.524996},{"id":"https://openalex.org/keywords/part-of-speech-tagging","display_name":"Part-of-Speech Tagging","score":0.523595},{"id":"https://openalex.org/keywords/statistical-language-modeling","display_name":"Statistical Language Modeling","score":0.510527},{"id":"https://openalex.org/keywords/semantic-processing","display_name":"Semantic Processing","score":0.509237},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.47431442}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7709409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.74171233},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6641869},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6051801},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5751276},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5327411},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.52060986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.52046895},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.48134884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47692794},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.47431442},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26519156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17298701},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.05922252},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.3115/980691.980725","pdf_url":"https://dl.acm.org/doi/pdf/10.3115/980691.980725","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"http://www.aclweb.org/anthology/P98-2156","pdf_url":"https://aclanthology.org/P98-2156.pdf","source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9089","pdf_url":"http://acl.ldc.upenn.edu/P/P98/P98-2156.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.3115/980691.980725","pdf_url":"https://dl.acm.org/doi/pdf/10.3115/980691.980725","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"score":0.57,"display_name":"Quality education","id":"https://metadata.un.org/sdg/4"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":4,"referenced_works":["https://openalex.org/W1491178396","https://openalex.org/W155179339","https://openalex.org/W1557614480","https://openalex.org/W2142463934"],"related_works":["https://openalex.org/W4398164120","https://openalex.org/W4386333039","https://openalex.org/W4286266684","https://openalex.org/W3202319462","https://openalex.org/W2073788202","https://openalex.org/W2055334547","https://openalex.org/W2002048494","https://openalex.org/W1557335907","https://openalex.org/W152266133","https://openalex.org/W1517502158"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"new":[3,25],"LR":[4,35],"algorithm":[5,16,26],"for":[6,37],"tree-adjoining":[7],"grammars.":[8,39],"It":[9],"is":[10,18,27],"an":[11,14],"alternative":[12],"to":[13,20,33],"existing":[15],"that":[17],"shown":[19],"be":[21],"incorrect.":[22],"Furthermore,":[23],"the":[24,46],"much":[28],"simpler,":[29],"being":[30],"very":[31],"close":[32],"traditional":[34],"parsing":[36],"context-free":[38],"The":[40],"construction":[41],"of":[42,48],"derived":[43],"trees":[44],"and":[45],"computation":[47],"features":[49],"also":[50],"become":[51],"straightforward.":[52]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3088930208","counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2024-12-04T19:38:25.403219","created_date":"2020-10-01"}
