{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:40:03Z","timestamp":1745991603366,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642376870"},{"type":"electronic","value":"9783642376887"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37688-7_6","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T10:55:24Z","timestamp":1366196124000},"page":"121-143","source":"Crossref","is-referenced-by-count":0,"title":["Fact Based Search Engine: News Fact Finder Utilizing Naive Bayes Classification"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Salmon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swathi","family":"Amarala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"An Introduction to the Europe Media Monitor Family of Applications. In: Information Access in a Multilingual World - Proceedings of the SIGIR, Workshop (SIGIR- CLIR 2009), Boston, USA (2009)"},{"key":"6_CR2","unstructured":"Sentence Level Fact Based Search Engine: News Fact Finder, Las Vegas, NV, USA (2010)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Siadaty, M.S., Shu, J., Knaus, W.A.: Relemed: sentence-level search engine with relevance score for the medline database of biomedical articles. BMC Medical Informatics and Decision Making\u00a07(1) (2007)","DOI":"10.1186\/1472-6947-7-1"},{"key":"6_CR4","unstructured":"Proceedings of the 7th Annual Research Colloquium of the UK, Special Interest Group for Computational Linguistics, Birmingham, UK (2004)"},{"key":"6_CR5","unstructured":"AnswerBus question answering system. In: Proceedings of HLT 2002, Second International Conference on Human Language Technology Research. Morgan Kaufmann Publishers Inc., San Francisco (2002)"},{"key":"6_CR6","unstructured":"Buttcher, S., Clarke, C., Cormack, G.: Information Retrieval: Implementing and Evaluating Search Engines. MIT Press (2010)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string b-tree: a new data structure for string search in external memory and its applications. Journal of the ACM (JACM)\u00a046(2), 236\u2013280 (1999)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space economical suffix tree construction algorithm. Journal of the ACM (JACM)\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"6_CR10","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches, pp. 319\u2013327. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications, pp. 390\u2013398","DOI":"10.1109\/SFCS.2000.892127"},{"key":"6_CR12","unstructured":"Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays, pp. 225\u2013232. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"6_CR13","unstructured":"When indexing equals compression: Experiments with compressing suffix arrays and applications. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004)"},{"key":"6_CR14","unstructured":"The performance of linear time suffix sorting algorithms"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11496656_5","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 45\u201356. Springer, Heidelberg (2005)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-540-27801-6_32","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2004","unstructured":"M\u00e4kinen, V., Navarro, G.: Compressed compact suffix arrays. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 420\u2013433. Springer, Heidelberg (2004)"},{"key":"6_CR17","unstructured":"Ferragina, P., Manzini, G.: An experimental study of an opportunistic index, pp. 269\u2013278. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S1570-8667(03)00066-2","volume":"2","author":"G. Navarro","year":"2004","unstructured":"Navarro, G.: Indexing text using the ziv-lempel trie. Journal of Discrete Algorithms\u00a02(1), 87\u2013114 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"6_CR19","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.: Suffix arrays: what are they good for? p. 18. Australian Computer Society, Inc."},{"key":"6_CR20","unstructured":"Opinion sentence search engine on open domain blog. In: Artificial Intelligence (IJCAI 2007), Hyderabad, India (2007)"},{"key":"6_CR21","unstructured":"Fact or fiction: Content classification for digital libraries. In: The Proceedings of Joint DELOS-NSF Workshop on Personalisation and Recommender Systems in Digital Libraries, Dublin, Ireland (2001)"},{"key":"6_CR22","unstructured":"Brill, E.: Some advances in transformation-based parts of speech tagging. In: AAAI (1994)"},{"key":"6_CR23","unstructured":"Identifying collocations for recognizing opinions. In: Proceedings of the ACL 2001 Workshop on Computational Natural Language Learning (ConLL), Toulouse, France (2001)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Fellbaum, C.: Wordnet: An electronic lexical database (1998)","DOI":"10.7551\/mitpress\/7287.001.0001"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Wiebe, J., Wilson, T., Cardie, C.: Annotating expressions of opinions and emotions in language. Language Resources and Evaluation, 165\u2013210 (2005)","DOI":"10.1007\/s10579-005-7880-9"},{"key":"6_CR26","unstructured":"Wilson, T.: Fine-grained subjectivity analysis (2008)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Biopython, v1.55 (August 31, 2010)","DOI":"10.1007\/BF03089502"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Salson, M., Leonard, M., Lecroq, T., Mouchard, L.: Dynamic extended suffix arrays. Journal of Discrete Algorithms (2009)","DOI":"10.1016\/j.jda.2009.02.007"}],"container-title":["Intelligent Systems Reference Library","Quality Issues in the Management of Web Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37688-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:24:23Z","timestamp":1745990663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37688-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642376870","9783642376887"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37688-7_6","relation":{},"ISSN":["1868-4394","1868-4408"],"issn-type":[{"type":"print","value":"1868-4394"},{"type":"electronic","value":"1868-4408"}],"subject":[],"published":{"date-parts":[[2013]]}}}