{"id":"https://openalex.org/W1997409097","doi":"https://doi.org/10.1017/s1351324900002382","title":"Efficient feature structure operations without compilation","display_name":"Efficient feature structure operations without compilation","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W1997409097","doi":"https://doi.org/10.1017/s1351324900002382","mag":"1997409097"},"language":"en","primary_location":{"id":"doi:10.1017/s1351324900002382","doi":"https://doi.org/10.1017/s1351324900002382","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324900002382","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,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-3","poland-140","vabb-shw"],"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"},"volume":null,"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/A5006235007","display_name":"Robert Malouf","orcid":"https://orcid.org/0000-0002-5716-321X","observed_orcids":["https://orcid.org/0000-0002-5716-321X"]},"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":false,"raw_author_name":"ROBERT MALOUF","raw_affiliation_strings":["Alfa Informatica, University of Groningen, Postbus 716, 9700 AS Groningen, The Netherlands; e-mail:","Alfa Informatica, University of Groningen, Postbus 716, 9700 AS Groningen, The Netherlands; e-mail: malouf@let.rug.nl#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alfa Informatica, University of Groningen, Postbus 716, 9700 AS Groningen, The Netherlands; e-mail:","institution_ids":["https://openalex.org/I169381384"]},{"raw_affiliation_string":"Alfa Informatica, University of Groningen, Postbus 716, 9700 AS Groningen, The Netherlands; e-mail: malouf@let.rug.nl#TAB#","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054610664","display_name":"John M. Carroll","orcid":"https://orcid.org/0000-0001-5189-337X","observed_orcids":["https://orcid.org/0000-0001-5189-337X"]},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"JOHN CARROLL","raw_affiliation_strings":["Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH, UK; e-mail:","Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH, UK; e-mail: johnca@cogs.susx.ac.uk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH, UK; e-mail:","institution_ids":["https://openalex.org/I162608824"]},{"raw_affiliation_string":"Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH, UK; e-mail: johnca@cogs.susx.ac.uk#TAB#","institution_ids":["https://openalex.org/I162608824"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012396877","display_name":"Ann Copestake","orcid":"https://orcid.org/0000-0003-0347-946X","observed_orcids":["https://orcid.org/0000-0003-0347-946X"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ANN COPESTAKE","raw_affiliation_strings":["Center for the Study of Language and Information, Stanford University, Stanford, CA 94305, USA; e-mail:","Center for the Study of Language and Information, Stanford University, Stanford, CA 94305, USA; e-mail: aac@csli.stanford.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for the Study of Language and Information, Stanford University, Stanford, CA 94305, USA; e-mail:","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Center for the Study of Language and Information, Stanford University, Stanford, CA 94305, USA; e-mail: aac@csli.stanford.edu#TAB#","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.499,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.97061409,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"1","first_page":"29","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9282000064849854,"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.9282000064849854,"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/T10034","display_name":"Syntax, Semantics, Linguistic Variation","score":0.062300000339746475,"subfield":{"id":"https://openalex.org/subfields/1203","display_name":"Language and Linguistics"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.00559999980032444,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/feature-structures","display_name":"feature structures","score":0.8349999785423279},{"id":"https://openalex.org/keywords/unification","display_name":"unification","score":0.8109999895095825},{"id":"https://openalex.org/keywords/head-driven-phrase-structure-grammar","display_name":"HPSG","score":0.8080000281333923},{"id":"https://openalex.org/keywords/wide-coverage-grammar","display_name":"wide-coverage grammar","score":0.6800000071525574},{"id":"https://openalex.org/keywords/structure-sharing","display_name":"structure sharing","score":0.8870000243186951},{"id":"https://openalex.org/keywords/subsumption-checking","display_name":"subsumption checking","score":0.7720000147819519},{"id":"https://openalex.org/keywords/equality-test","display_name":"equality test","score":0.6840000152587891},{"id":"https://openalex.org/keywords/grammatical-development","display_name":"grammatical development","score":0.5009999871253967},{"id":"https://openalex.org/keywords/syntactic-analysis","display_name":"syntactic analysis","score":0.42500001192092896},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.6129999756813049}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9138643741607666},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.8526854515075684},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6774433851242065},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6536381244659424},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5898404717445374},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5562543272972107},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5526233911514282},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.5328225493431091},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.4570711553096771},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42866241931915283},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.42418044805526733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3804495930671692},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3728095591068268},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28023189306259155},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s1351324900002382","doi":"https://doi.org/10.1017/s1351324900002382","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324900002382","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,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-3","poland-140","vabb-shw"],"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.569","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-csli.stanford.edu/~aac/papers/unify.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.3325","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.let.rug.nl/~malouf/papers/nle2000.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/d3db8bbb-5e7f-4ac6-9f57-40d75fb1c392","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/11370/d3db8bbb-5e7f-4ac6-9f57-40d75fb1c392","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Malouf, R 2000, 'Efficient feature structure operations without compilation', Natural Language Engineering, vol. 6, pp. 29 - 46.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:rug:oai:pure.rug.nl:publications/d3db8bbb-5e7f-4ac6-9f57-40d75fb1c392","doi":null,"is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/d3db8bbb-5e7f-4ac6-9f57-40d75fb1c392","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Natural Language Engineering, 6, 29 - 46","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Quality education","id":"https://metadata.un.org/sdg/4","score":0.5400000214576721}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W9954089","https://openalex.org/W122915500","https://openalex.org/W1539395461","https://openalex.org/W1595440401","https://openalex.org/W1655990431","https://openalex.org/W1804197673","https://openalex.org/W1994947359","https://openalex.org/W2026052661","https://openalex.org/W2063747743","https://openalex.org/W2086463894","https://openalex.org/W2105899789","https://openalex.org/W2114081068","https://openalex.org/W2137489486","https://openalex.org/W2162630573","https://openalex.org/W3037539091"],"related_works":["https://openalex.org/W2018636311","https://openalex.org/W2099043223","https://openalex.org/W7096136736","https://openalex.org/W2112263224","https://openalex.org/W59690391","https://openalex.org/W204196033","https://openalex.org/W2092473750","https://openalex.org/W178590682","https://openalex.org/W2153561174","https://openalex.org/W1994947359"],"abstract_inverted_index":{"One":[0],"major":[1],"obstacle":[2],"to":[3,39,60,72,169],"the":[4,20,26,53,63,92],"efficient":[5,75,131],"processing":[6],"of":[7,25,94,120,145],"large":[8,118],"wide":[9],"coverage":[10],"grammars":[11],"in":[12,114,157,162],"unification-based":[13],"grammatical":[14],"frameworks":[15],"such":[16],"as":[17],"HPSG":[18],"is":[19,36,57,155],"time":[21,83],"and":[22,82,105],"space":[23,81],"cost":[24],"unification":[27,76],"operation":[28],"itself.":[29],"In":[30,65],"a":[31,103,117,142,148,158],"grammar":[32],"development":[33],"system":[34],"it":[35,58],"not":[37],"appropriate":[38],"address":[40],"this":[41,50,66,146,163],"problem":[42],"with":[43],"techniques":[44],"which":[45,78,113,165],"involve":[46],"lengthy":[47],"compilation,":[48],"since":[49],"slows":[51],"down":[52],"edit-test-debug":[54],"cycle.":[55],"Nor":[56],"possible":[59],"radically":[61],"restructure":[62],"grammar.":[64],"paper,":[67],"we":[68,128],"describe":[69,102],"novel":[70],"extensions":[71],"an":[73,130],"existing":[74],"algorithm":[77,132],"improve":[79],"its":[80,87],"behaviour":[84],"(without":[85],"affecting":[86],"correctness)":[88],"by":[89],"substantially":[90],"increasing":[91],"amount":[93],"structure":[95],"sharing":[96],"that":[97,122],"takes":[98],"place.":[99],"We":[100],"also":[101],"fast":[104,149],"automatically":[106],"tunable":[107],"pre-unification":[108],"filter":[109],"(the":[110],"\u2018quick":[111],"check\u2019)":[112],"practice":[115],"detects":[116],"proportion":[119],"unifications":[121],"if":[123],"performed":[124],"would":[125],"fail.":[126],"Finally,":[127],"present":[129],"for":[133,135],"checking":[134],"subsumption":[136,153],"relationships":[137],"between":[138],"two":[139],"feature":[140],"structures;":[141],"special":[143],"case":[144],"gives":[147],"equality":[150],"test.":[151],"The":[152],"check":[154],"used":[156],"parser":[159],"(described":[160],"elsewhere":[161],"issue)":[164],"\u2018packs\u2019":[166],"local":[167],"ambiguities":[168],"avoid":[170],"performing":[171],"redundant":[172],"sub-computations.":[173]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-06-24T00:00:00"}