{"id":"https://openalex.org/W2022319071","doi":"https://doi.org/10.1137/s009753979326009x","title":"Tree-Adjoining Language Parsing in $O(n^6 )$ Time","display_name":"Tree-Adjoining Language Parsing in $O(n^6 )$ Time","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2022319071","doi":"https://doi.org/10.1137/s009753979326009x","mag":"2022319071"},"language":"en","primary_location":{"id":"doi:10.1137/s009753979326009x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979326009x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":"https://openalex.org/A5104353202","display_name":"Sanguthevar Rajasekaran","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sanguthevar Rajasekaran","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5104353202"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0117,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.7470806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"4","first_page":"862","last_page":"873"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9987000226974487,"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/parsing","display_name":"Parsing","score":0.7789226770401001},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.620581865310669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5824374556541443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5668958425521851},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5574740767478943},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4970302879810333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48867276310920715},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.48246389627456665},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.481432169675827},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4718213975429535},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.43892917037010193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3709098696708679},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32653817534446716},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22595927119255066}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7789226770401001},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.620581865310669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5824374556541443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5668958425521851},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5574740767478943},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4970302879810333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48867276310920715},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.48246389627456665},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.481432169675827},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4718213975429535},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.43892917037010193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3709098696708679},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32653817534446716},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22595927119255066},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s009753979326009x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753979326009x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5799999833106995,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1979740015","https://openalex.org/W2047505657","https://openalex.org/W2053309264","https://openalex.org/W2130630493","https://openalex.org/W2131504185"],"related_works":["https://openalex.org/W2118045671","https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4389362338","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2887154986","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"In":[0,117],"this":[1,49],"paper,":[2],"we":[3],"present":[4,140],"algorithms":[5,141,169],"for":[6,22,30,64,83,142],"parsing":[7,39,143],"general":[8],"tree-adjoining":[9],"languages":[10,145],"(TALs).":[11],"Tree-adjoining":[12],"grammars":[13],"(TAGs)":[14],"have":[15],"been":[16],"proposed":[17],"as":[18,35],"an":[19,27,54,95],"elegant":[20],"formalism":[21],"natural":[23],"languages.":[24],"It":[25],"was":[26],"open":[28],"question":[29,50],"the":[31,61,79,85,119],"past":[32],"ten":[33],"years":[34],"to":[36],"whether":[37],"TAL":[38],"can":[40],"be":[41,171],"done":[42],"in":[43,106],"time":[44,62,86,107,127],"$O(n^6":[45,157],")$.":[46,93],"We":[47,138],"settle":[48],"affirmatively":[51],"by":[52],"presenting":[53],"$O(n^3":[55,154],"M(n))$-time":[56],"algorithm,":[57],"where":[58],"$M(k)$":[59],"is":[60,78,91],"needed":[63],"multiplying":[65],"two":[66],"Boolean":[67],"matrices":[68],"of":[69,88,128,172],"size":[70],"$k":[71],"\\times":[72],"k$":[73],"each.":[74],"Since":[75],"$O(k^{2.376}":[76],")$":[77,155],"current":[80],"best-known":[81,120],"value":[82],"$M(k)$,":[84],"bound":[87],"our":[89,103],"algorithm":[90,104,123],"$O(n^{5.376}":[92],"On":[94],"exclusive-read":[96],"exclusive-write":[97],"parallel":[98,122],"random-access":[99],"machine":[100],"(EREW":[101],"PRAM),":[102],"runs":[105],"$O(n\\log":[108],"n)$":[109],"using":[110,130],"${{(n^2":[111],"M(n))}":[112],"/":[113],"{\\log":[114],"n}}$":[115],"processors.":[116],"comparison,":[118],"previous":[121],"had":[124],"a":[125,135],"run":[126,151,163],"$O(n)$":[129],"$n^5":[131],"$":[132],"processors":[133],"(on":[134],"systolic-array":[136],"machine).":[137],"also":[139],"context-free":[144],"(CFLs)":[146],"and":[147,156],"TALs":[148],"whose":[149,161],"worst-case":[150],"times":[152,164],"are":[153,165],")$,":[158],"respectively,":[159],"but":[160],"average":[162],"better.":[166],"Therefore,":[167],"these":[168],"may":[170],"practical":[173],"interest.":[174]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}