{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:57:48Z","timestamp":1743065868587,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232107"},{"type":"electronic","value":"9783642232114"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23211-4_10","type":"book-chapter","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T11:48:24Z","timestamp":1317296904000},"page":"158-173","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Bit Vectors for Fast Unification"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Skala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerald","family":"Penn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. A\u00eft-Kaci","year":"1989","unstructured":"A\u00eft-Kaci, H., Boyer, R.S., Lincoln, P., Nasr, R.: Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems\u00a011(1), 115\u2013146 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"7","key":"10_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"10_CR3","unstructured":"Copestake, A., Flickinger, D.: An open-source grammar development environment and broad-coverage English grammar using HPSG. In: Proceedings of the Second Conference on Language Resources and Evaluation (LREC 2000) (2000)"},{"key":"10_CR4","unstructured":"Fall, A.: Reasoning with Taxonomies. Ph.D. thesis, Simon Fraser University (1996)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Kiefer, B., Krieger, H.U., Carroll, J., Malouf, R.: A bag of useful techniques for efficient and robust parsing. In: Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL 1999), pp. 473\u2013480. ACL (1999)","DOI":"10.3115\/1034678.1034750"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Meurers, D., De Kuthy, K., Metcalf, V.: Modularity of grammatical constraints in hpsg-based grammar implementations. In: Proceedings of the ESSLLI Workshop on Ideas and strategies for multilingual grammar Engineering (2003)","DOI":"10.21248\/hpsg.2003.5"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Meurers, D., Penn, G., Richter, F.: A web-based instructional platform for constraint-based grammar formalisms and parsing. In: Proceedings of the ACL Workshop on Effective Tools and Methodologies for Teaching NLP and CL (2002)","DOI":"10.3115\/1118108.1118111"},{"key":"10_CR8","unstructured":"Penn, G.: A Utility for Feature-based Grammatical Theories. Master\u2019s thesis, Carnegie Mellon University (1993)"},{"key":"10_CR9","unstructured":"Penn, G.: Optimising don\u2019t-care nondeterminism with statistical information. Tech. Rep. 140, SFB 340, T\u00fcbingen (1999)"},{"key":"10_CR10","unstructured":"Pollard, C., Sag, I.: Head-driven Phrase Structure Grammar, Chicago (1994)"},{"key":"10_CR11","unstructured":"Skala, M., Krakovna, V., Kram\u00e1r, J., Penn, G.: A generalized-zero-preserving method for compact encoding of concept lattices. In: 48th Annual Meeting of the Association for Computational Linguistics (ACL 2010), pp. 1512\u20131521. ACL (2010)"},{"key":"10_CR12","unstructured":"Talbot, D., Osborne, M.: Smoothed Bloom filter language models: Tera-scale LMs on the cheap. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp. 468\u2013476 (2007)"}],"container-title":["Lecture Notes in Computer Science","The Mathematics of Language"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23211-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T04:37:12Z","timestamp":1686371832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23211-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232107","9783642232114"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23211-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}