{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:12:18Z","timestamp":1743081138881,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319467580"},{"type":"electronic","value":"9783319467597"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46759-7_11","type":"book-chapter","created":{"date-parts":[[2016,9,25]],"date-time":"2016-09-25T23:38:43Z","timestamp":1474846723000},"page":"137-150","source":"Crossref","is-referenced-by-count":0,"title":["Bit-Vector Search Filtering with Application to a Kanji Dictionary"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Skala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,27]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","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 Trans. Program. Lang. Syst. 11(1), 115\u2013146 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR2","unstructured":"Apel, U.: KanjiVG. http:\/\/kanjivg.tagaini.net\/"},{"issue":"7","key":"11_CR3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5487-7","volume-title":"Logic Programming with Prolog","author":"M Bramer","year":"2013","unstructured":"Bramer, M.: Logic Programming with Prolog, 2nd edn. Springer, London (2013)","edition":"2"},{"issue":"3","key":"11_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"11_CR6","unstructured":"CHISE project. http:\/\/www.chise.org\/"},{"issue":"1\u20132","key":"11_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10618-010-0184-8","volume":"22","author":"YS Choi","year":"2011","unstructured":"Choi, Y.S.: Tree pattern expression for extracting information from syntactically parsed text corpora. Data Min. Knowl. Disc. 22(1\u20132), 211\u2013231 (2011)","journal-title":"Data Min. Knowl. Disc."},{"issue":"2","key":"11_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theor. Comput. Syst. 30(2), 113\u2013119 (1997)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"11_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TKDE.2009.57","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. IEEE Trans. Knowl. Data Eng. 22(1), 120\u2013133 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 604\u2013613. ACM, New York (1998)","DOI":"10.1145\/276698.276876"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.jda.2011.12.018","volume":"14","author":"Y Kaneta","year":"2012","unstructured":"Kaneta, Y., Arimura, H., Raman, R.: Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms 14, 119\u2013135 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"11_CR12","unstructured":"Kawabata, T.: IDS data for CJK unified Ideographs. https:\/\/github.com\/cjkvi\/cjkvi-ids"},{"key":"11_CR13","volume-title":"The Art of Computer Programming, Pre-fascicle 1B","author":"DE Knuth","year":"2009","unstructured":"Knuth, D.E.: The Art of Computer Programming, Pre-fascicle 1B, vol. 4. Addison-Wesley, Reading (2009)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10849-009-9086-9","volume":"19","author":"C Lai","year":"2010","unstructured":"Lai, C., Bird, S.: Querying linguistic trees. J. Logic Lang. Inf. 19(1), 53\u201373 (2010)","journal-title":"J. Logic Lang. Inf."},{"key":"11_CR15","unstructured":"Levy, R., Andrew, G.: Tregex and Tsurgeon: tools for querying and manipulating tree data structures. In: Calzolari, N., Choukri, K., Gangemi, A., Maegaard, B., Mariani, J., Odijk, J., Tapias, D. (eds.) 5th International Conference on Language Resources and Evaluation (LREC 2006), Genoa, Italy, 22\u201328 May 2006"},{"key":"11_CR16","unstructured":"Lind-Nielsen, J.: BuDDy: a BDD package. http:\/\/buddy.sourceforge.net\/manual\/main.html"},{"key":"11_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511803260","volume-title":"Chaos in Dynamical Systems","author":"E Ott","year":"2002","unstructured":"Ott, E.: Chaos in Dynamical Systems, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"11_CR18","unstructured":"Pol\u00e1ch, R.: Tree pattern matching and tree expressions. Master\u2019s thesis, Czech Technical University in Prague (2011)"},{"key":"11_CR19","unstructured":"Skala, M.: Tsukurimashou font family and IDSgrep. http:\/\/tsukurimashou.osdn.jp\/"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11575832_12","volume-title":"String Processing and Information Retrieval","author":"M Skala","year":"2005","unstructured":"Skala, M.: Measuring the difficulty of distance-based indexing. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 103\u2013114. Springer, Heidelberg (2005). doi: 10.1007\/11575832_12"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Skala, M.: On the complexity of reverse similarity search. In: Ch\u00e1vez, E., Navarro, G. (eds.) First International Workshop on Similarity Search and Applications (SISAP 2008), Cancun, Mexico, 11\u201312 April 2008, pp. 149\u2013156. IEEE (2008)","DOI":"10.1109\/SISAP.2008.16"},{"key":"11_CR22","unstructured":"Skala, M.: Tsukurimashou: a Japanese-language font meta-family. TUGboat 34(3), 269\u2013278. In: Proceedings of the 34th Annual Meeting of the TEX Users Group (TUG 2013), Tokyo, Japan, 23\u201326 October 2013 (2014)"},{"issue":"2","key":"11_CR23","first-page":"127","volume":"23","author":"M Skala","year":"2015","unstructured":"Skala, M.: A structural query system for Han characters. Int. J. Asian Lang. Process. 23(2), 127\u2013159 (2015)","journal-title":"Int. J. Asian Lang. Process."},{"key":"11_CR24","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), Uppsala, Sweden, 11\u201316 July 2010, pp. 1512\u20131521. Association for Computational Linguistics (2010). http:\/\/www.aclweb.org\/anthology\/P10-1153"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-23211-4_10","volume-title":"The Mathematics of Language","author":"M Skala","year":"2011","unstructured":"Skala, M., Penn, G.: Approximate bit vectors for fast unification. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds.) MOL 2011. LNCS (LNAI), vol. 6878, pp. 158\u2013173. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23211-4_10"},{"key":"11_CR26","unstructured":"Skala, M.A.: Aspects of metric spaces in computation. Ph.D. thesis, University of Waterloo (2008)"},{"key":"11_CR27","unstructured":"Unicode Consortium: Ideographic description characters. In: The Unicode Standard, Version 6.0.0, Section 12.2. The Unicode Consortium, Mountain View, USA (2011). http:\/\/www.unicode.org\/versions\/Unicode6.0.0\/ch12.pdf"},{"issue":"2\u20133","key":"11_CR28","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.tcs.2005.09.023","volume":"348","author":"R Williams","year":"2005","unstructured":"Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2\u20133), 357\u2013365 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46759-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T19:40:50Z","timestamp":1498333250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46759-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319467580","9783319467597"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46759-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}