{"id":"https://openalex.org/W1985400739","doi":"https://doi.org/10.1017/s1351324997001642","title":"Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars","display_name":"Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W1985400739","doi":"https://doi.org/10.1017/s1351324997001642","mag":"1985400739"},"language":"en","primary_location":{"id":"doi:10.1017/s1351324997001642","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324997001642","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-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":null,"display_name":"B. SRINIVAS","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. SRINIVAS","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA 19104, USA. e-mail:","Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA 19104, USA. e-mail: srini@unagi.cis.upenn.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA 19104, USA. e-mail:","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA 19104, USA. e-mail: srini@unagi.cis.upenn.edu#TAB#","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.102883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"4","first_page":"367","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":1.0,"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":1.0,"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/T10028","display_name":"Topic Modeling","score":0.9984999895095825,"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/T13629","display_name":"Text Readability and Simplification","score":0.9900000095367432,"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/computer-science","display_name":"Computer science","score":0.8570573329925537},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.7422477006912231},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.6997205018997192},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6943807601928711},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6497780680656433},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6073102355003357},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.6042438745498657},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5840086936950684},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.530100405216217},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.4872983694076538},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4834669232368469},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.4592220187187195},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44563156366348267},{"id":"https://openalex.org/keywords/dependency-grammar","display_name":"Dependency grammar","score":0.4121049642562866},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.4121047258377075},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.36757418513298035},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.17673832178115845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09523922204971313}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8570573329925537},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.7422477006912231},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.6997205018997192},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6943807601928711},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6497780680656433},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6073102355003357},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.6042438745498657},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5840086936950684},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.530100405216217},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.4872983694076538},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4834669232368469},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.4592220187187195},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44563156366348267},{"id":"https://openalex.org/C164883195","wikidata":"https://www.wikidata.org/wiki/Q674834","display_name":"Dependency grammar","level":3,"score":0.4121049642562866},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.4121047258377075},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36757418513298035},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.17673832178115845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09523922204971313},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1351324997001642","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324997001642","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.8399999737739563}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W3978999","https://openalex.org/W10056579","https://openalex.org/W2093092055","https://openalex.org/W2160000948"],"related_works":["https://openalex.org/W1507356070","https://openalex.org/W2161441814","https://openalex.org/W2086184235","https://openalex.org/W2148849272","https://openalex.org/W1979054319","https://openalex.org/W2766630400","https://openalex.org/W74037770","https://openalex.org/W2768697761","https://openalex.org/W1504203756","https://openalex.org/W20454899"],"abstract_inverted_index":{"There":[0],"are":[1,53,72,102,121],"currently":[2],"two":[3],"philosophies":[4],"for":[5,64,125],"building":[6],"grammars":[7,17,39,71],"and":[8,14,18,56,98],"parsers:":[9],"hand-crafted,":[10],"wide":[11,69],"coverage":[12,70],"grammars;":[13],"statistically":[15],"induced":[16],"parsers.":[19],"Aside":[20],"from":[21,174],"the":[22,28,35,43,57,136,156],"methodological":[23],"differences":[24],"in":[25,34,42,91,149,166],"grammar":[26,111,144],"construction,":[27],"linguistic":[29,100],"knowledge":[30],"which":[31,49],"is":[32,40,87,94],"overt":[33],"rules":[36],"of":[37,115,139,159],"handcrafted":[38,68,141],"hidden":[41,55],"statistics":[44],"derived":[45],"by":[46],"probabilistic":[47],"methods,":[48],"means":[50],"that":[51,89],"generalizations":[52],"also":[54],"full":[58],"training":[59],"process":[60],"must":[61],"be":[62,76,123],"repeated":[63],"each":[65],"domain.":[66,128],"Although":[67],"portable,":[73],"they":[74],"can":[75],"made":[77],"more":[78,103],"efficient":[79],"when":[80],"applied":[81],"to":[82,122,134,147,163,176],"limited":[83,92,168],"domains,":[84],"if":[85],"it":[86],"recognized":[88],"language":[90],"domains":[93],"usually":[95],"well":[96],"constrained":[97],"certain":[99],"constructions":[101],"frequent":[104],"than":[105],"others.":[106],"We":[107,129,154],"view":[108,164],"a":[109,113,126,140,150,167],"domain-independent":[110],"as":[112,170],"repository":[114],"portable":[116],"grammatical":[117],"structures":[118],"whose":[119],"combinations":[120],"specialized":[124],"given":[127,151],"use":[130],"Explanation-Based":[131],"Learning":[132],"(EBL)":[133],"identify":[135],"relevant":[137],"subset":[138],"general":[142],"purpose":[143],"(XTAG)":[145],"needed":[146],"parse":[148],"domain":[152,169],"(ATIS).":[153],"exploit":[155],"key":[157],"properties":[158],"Lexicalized":[160],"Tree-Adjoining":[161],"Grammars":[162],"parsing":[165],"finite":[171],"state":[172],"transduction":[173],"strings":[175],"their":[177],"dependency":[178],"structures.":[179]},"counts_by_year":[],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}