{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T15:56:10Z","timestamp":1682092570605},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Digit Libr"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s00799-003-0050-z","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T13:23:43Z","timestamp":1107955423000},"page":"99-105","source":"Crossref","is-referenced-by-count":27,"title":["Searchable words on the Web"],"prefix":"10.1007","volume":"5","author":[{"given":"Hugh E.","family":"Williams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,4,1]]},"reference":[{"key":"50_CR1","unstructured":"Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley-Longman, Reading, MA"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Harman D (1995) Overview of the second text retrieval conference (TREC-2). Inf Process Manage 31(3):271\u2013289","DOI":"10.1016\/0306-4573(94)00047-7"},{"key":"50_CR3","unstructured":"Hasan J (2001) Automatic dictionary construction from large collections of text. Master\u2019s thesis, School of Computer Science and Information Technology, RMIT University, RT-35 , Melbourne, Australia"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Heinz S, Zobel J, Williams HE (2002) Burst tries: a fast, efficient data structure for string keys. ACM Trans Inf Sys 20(2):192\u2013223","DOI":"10.1145\/506309.506312"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Kukich K (1992) Techniques for automatically correcting words in text. Comput Surv 24(4):377\u2013440","DOI":"10.1145\/146370.146380"},{"key":"50_CR6","unstructured":"Lotka AJ (1926) The frequency distribution of scientific productivity. J Wash Acad Sci 16(12):317\u2013323"},{"key":"50_CR7","unstructured":"Li W (1998) Comments on Zipf\u2019s law and the structures and evolution of natural language. Complexity 3(5):9\u201310"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Moffat A, Bell TAH (1995) In-situ generation of compressed inverted files. J Am Soc Inf Sci 46(7):537\u2013550","DOI":"10.1002\/(SICI)1097-4571(199508)46:7<537::AID-ASI7>3.0.CO;2-P"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Porter MF (1980) An algorithm for suffix stripping. Program 13(3):130\u2013137","DOI":"10.1108\/eb046814"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Spink A, Wolfram D, Jansen BJ, Saracevic T (2001) Searching the web: the public and their queries. J Am Soc Inf Sci 52(3):226\u2013234","DOI":"10.1002\/1097-4571(2000)9999:9999<::AID-ASI1591>3.0.CO;2-R"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Williams HE, Zobel J, Heinz S (2001) Self-adjusting trees in practice for large text collections. Softw Pract Exper 31(10):925\u2013939","DOI":"10.1002\/spe.394"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Witten IH, Bell TC (1990) Source models for natural language text. Int J Man Mach Stud 32:545\u2013579","DOI":"10.1016\/S0020-7373(05)80033-1"},{"key":"50_CR13","unstructured":"Witten IH, Moffat A, Bell TC (1999) Managing gigabytes: compressing and indexing documents and images, 2nd edn. Morgan Kaufmann, Los Altos, CA"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Xu J, Croft WB (1998) Corpus-based stemming using cooccurrence of word variants. ACM Trans Inf Sys 16(1):61\u201381","DOI":"10.1145\/267954.267957"},{"key":"50_CR15","unstructured":"Zipf GK (1949) Human behaviour and the principle of least effort. Addison-Wesley, Reading, MA"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Zobel J, Dart P (1995) Finding approximate matches in large lexicons. Softw Pract Exper 25(3):331\u2013345","DOI":"10.1002\/spe.4380250307"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Zobel J, Heinz S, Williams HE (2001) In-memory hash tables for accumulating text vocabularies. Inf Process Lett 80(6):271\u2013277","DOI":"10.1016\/S0020-0190(01)00239-3"},{"key":"50_CR18","unstructured":"Zobel J, Williams HE (1999) Combined models for high-performance compression of large text collections. In: Proceedings of String Processing and Information Retrieval (SPIRE), Cancun, Mexico, 1999. IEEE Press, pp 224\u2013231"}],"container-title":["International Journal on Digital Libraries"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-003-0050-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00799-003-0050-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-003-0050-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-003-0050-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T18:01:25Z","timestamp":1586109685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00799-003-0050-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s00799-003-0050-z","relation":{},"ISSN":["1432-5012","1432-1300"],"issn-type":[{"value":"1432-5012","type":"print"},{"value":"1432-1300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}