{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:27Z","timestamp":1725551907429},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_49","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T11:37:18Z","timestamp":1136461038000},"page":"511-520","source":"Crossref","is-referenced-by-count":1,"title":["Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet"],"prefix":"10.1007","author":[{"given":"Svetlana","family":"Strunja\u0161-Yoshikawa","sequence":"first","affiliation":[]},{"given":"Fred S.","family":"Annexstein","sequence":"additional","affiliation":[]},{"given":"Kenneth A.","family":"Berman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact Labeling Schemes for Ancestor Queries. In: Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 547\u2013556 (2001)"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00224-004-1155-5","volume":"37","author":"S. Alstrup","year":"2004","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest Common Ancestor: A\u00a0Survey and a New Algorithm for a Distributed Environment. Theory of Computing Systems\u00a037, 441\u2013456 (2004)","journal-title":"Theory of Computing Systems"},{"key":"49_CR3","unstructured":"Budanitsky, A., Hirst, G.: Semantic Distance in WordNet: An Experimental, Application-Oriented Evaluation of Five Measures. In: Workshop on WordNet and Other Lexical Resources, Second Meeting of the North American Chapter of the Association for Computational Linguistics (2001)"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Caseau, Y.: Efficient Handling of Multiple Inheritance Hierarchies. In: OOPSLA 1993, pp. 271\u2013287 (1993)","DOI":"10.1145\/165854.165905"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1111\/0824-7935.00081","volume":"15","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., Habib, M., Nourine, L., Raynaud, O.: Encoding of Multiple Inheritance Hierarchies and Partial Orders. Computational Intelligence\u00a015, 50\u201363 (1999)","journal-title":"Computational Intelligence"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Christophides, V., Plexousakis, D., Scholl, M., Tourtounis, S.: On Labeling Schemes for the Semantic Web. In: Proceedings of the 13th World Wide Web Conference, pp. 544\u2013555 (2003)","DOI":"10.1145\/775152.775230"},{"key":"49_CR7","unstructured":"Kaplan, H., Milo, T., Ronen, S.: A Comparison of Labeling Schemes for Ancestor Queries. In: Proceedings of the 13th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 954\u2013963 (2000)"},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0053377","volume-title":"ECOOP \u201997 - Object-Oriented Programming","author":"A. Krall","year":"1997","unstructured":"Krall, A., Vitek, J., Horspoool, R.N.: Near Optimal Hierarchical Encoding of Types. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol.\u00a01241, pp. 128\u2013145. Springer, Heidelberg (1997)"},{"key":"49_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-48005-6_12","volume-title":"The Semantic Web - ISWC 2002","author":"A. Maganaraki","year":"2002","unstructured":"Maganaraki, A., Alexaki, S., Christophides, V., Plexousakis, D.: Benchmarking rdf Schemas for the Semantic Web. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol.\u00a02342, pp. 132\u2013147. Springer, Heidelberg (2002)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Miller, G.: Wordnet: An On-Line Lexical Database. International Journal of Lexicography\u00a03(4) (1990)","DOI":"10.1093\/ijl\/3.4.235"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-44612-5_53","volume-title":"Mathematical Foundations of Computer Science 2000","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Informative Labeling Schemes for Graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 579\u2013588. Springer, Heidelberg (2000)"},{"key":"49_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1613\/jair.514","volume":"11","author":"P. Resnik","year":"1999","unstructured":"Resnik, P.: Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language. Journal of Artificial Intelligence Research\u00a011, 95\u2013130 (1999)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:09:41Z","timestamp":1619492981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11611257_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}