{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T05:10:19Z","timestamp":1695964219934},"reference-count":20,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":4504,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1994,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Among the different processes that entail unification\u2010based grammar parsing, the unification of feature structures is by far the most expensive one in terms of execution time. Unification of the feature structures of a given sentence typically takes between 85 and 98 per cent of the total elapsed time during parsing, thus the need to develop faster unification methods. The approach presented in this paper is based on the fact that, in general, between 60 and 85 per cent of unifications attempted in a typical parse result in failure. Our claim is that the efficient treatment of such unification failures reduces unification time significantly. In this paper we present what we call a unification filter or U\u2010filter, that preprocesses the feature structures to be unified. If the U\u2010filter succeeds, unification is then skipped because the attempt to unify the involved structures would result in failure. On the other hand, when the U\u2010filter does not succeed it is not possible to determine at that moment whether or not the structures unify, so unification is performed. The U\u2010filter stops around 87 per cent of unification failures, and speeds up unification time by an average of around 29 per cent over quasi\u2010destructive graph unification, the fastest unification method known so far.<\/jats:p>","DOI":"10.1002\/spe.4380240702","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T07:12:30Z","timestamp":1163833950000},"page":"603-622","source":"Crossref","is-referenced-by-count":1,"title":["Signature\u2010check based unification filter"],"prefix":"10.1002","volume":"24","author":[{"given":"Alfredo M.","family":"Maeda","sequence":"first","affiliation":[]},{"given":"Jun\u2010Ichi","family":"Aoe","sequence":"additional","affiliation":[]},{"given":"Hideto","family":"Tomabechi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/362007.362035"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1885-0"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7766-3"},{"key":"e_1_2_1_5_2","volume-title":"Generalized Phrase Structure Grammar","author":"Gazdar G.","year":"1985"},{"key":"e_1_2_1_6_2","volume-title":"Information\u2010based Syntax and Semantics","author":"Pollard C.","year":"1987"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"K.Kogure \u2018Strategic lazy incremental copy graph unification\u2019 Proc. COLING\u201090 1990.","DOI":"10.3115\/997939.997978"},{"key":"e_1_2_1_8_2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A. V.","year":"1986"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"F.Pereira \u2018A structure sharing representation for unification\u2010based grammar formalisms\u2019 Proc. ACL\u201085 1985 pp.137\u2013144.","DOI":"10.3115\/981210.981227"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"L.Karttunen \u2018D\u2010PATR: a development environment for unification\u2010based grammars\u2019 Proc. COLING\u201086 1986.","DOI":"10.3115\/991365.991386"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"D.Wroblewski \u2018Nondestructive graph unification\u2019 Proc. AAAI\u201087 1987 pp.582\u2013587.","DOI":"10.1007\/BF00533399"},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"M. C.Emele \u2018Unification with lazy non\u2010redundant copying\u2019 Proc. ACL\u201091 1991 pp.323\u2013330.","DOI":"10.3115\/981344.981386"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"H.Tomabechi \u2018Quasi\u2010destructive graph unification\u2019 Proc. ACL\u201091 1991 pp.315\u2013322.","DOI":"10.3115\/981344.981385"},{"key":"e_1_2_1_14_2","unstructured":"H.Tomabechi \u2018Efficient unification for natural language\u2019 Ph.D. Thesis Carnegie Mellon University Program in Computational Linguistics 1993."},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"H.Tomabechi \u2018Quasi\u2010destructive graph unification with structure sharing\u2019 Pro. COLING\u201092 1992.","DOI":"10.3115\/992133.992138"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"P. A.Larson \u2018A method for speeding up text retrieval\u2019 Proc ACM SIGMOD\u201083 1983.","DOI":"10.1145\/647004.711872"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010223"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/362919.362934"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"key":"e_1_2_1_21_2","unstructured":"K.YoshimotoandK.Logure \u2018Japanese sentence analysis by means of phrase structure grammar\u2019 ATR Technical Report TR\u20101\u20130049 1989."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380240702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380240702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T02:23:46Z","timestamp":1695867826000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380240702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["10.1002\/spe.4380240702"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380240702","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}