{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:18:40Z","timestamp":1725517120802},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859017"},{"type":"electronic","value":"9783540859024"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85902-4_10","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T14:00:01Z","timestamp":1219240801000},"page":"115-121","source":"Crossref","is-referenced-by-count":3,"title":["Phrase Detection in the Wikipedia"],"prefix":"10.1007","author":[{"given":"Miro","family":"Lehtonen","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Doucet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/1185877.1185881","volume":"24","author":"M. Lehtonen","year":"2006","unstructured":"Lehtonen, M.: Preparing heterogeneous XML for full-text search. ACM Trans. Inf. Syst.\u00a024, 455\u2013474 (2006)","journal-title":"ACM Trans. Inf. Syst."},{"key":"10_CR2","first-page":"13","volume":"46","author":"A. Doucet","year":"2006","unstructured":"Doucet, A., Ahonen-Myka, H.: Probability and expected document frequency of discontinued word sequences, an efficient method for their exact computation. Traitement Automatique des Langues (TAL)\u00a046, 13\u201337 (2006)","journal-title":"Traitement Automatique des Langues (TAL)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","first-page":"119","volume-title":"Comparative Evaluation of XML Information Retrieval Systems","author":"M. Lehtonen","year":"2007","unstructured":"Lehtonen, M., Doucet, A.: Extirp: Baseline retrieval from wikipedia. In: Malik, S., Trotman, A., Lalmas, M., Fuhr, N. (eds.) INEX 2006. LNCS, vol.\u00a04518, pp. 119\u2013124. Springer, Heidelberg (2007)"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M.F. Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program\u00a014, 130\u2013137 (1980)","journal-title":"Program"},{"key":"10_CR5","unstructured":"Ahonen-Myka, H.: Finding all frequent maximal sequences in text. In: Mladenic, D., Grobelnik, M. (eds.) Proceedings of the 16th International Conference on Machine Learning ICML 1999 Workshop on Machine Learning in Text Data Analysis, Ljubljana, Slovenia, J. Stefan Institute, pp. 11\u201317 (1999)"},{"key":"10_CR6","unstructured":"Doucet, A., Ahonen-Myka, H.: Fast extraction of discontiguous sequences in text: a new approach based on maximal frequent sequences. In: Proceedings of IS-LTC 2006, pp. 186\u2013191 (2006)"}],"container-title":["Lecture Notes in Computer Science","Focused Access to XML Documents"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85902-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:54:12Z","timestamp":1619524452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85902-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540859017","9783540859024"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85902-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}