Abstract
In this investigation, we propose a new kind of text retrieval, called dynamic KMP, where the pattern becomes longer incrementally.We introduce several auxiliary information for efficient management and examine how well the approach the works.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ishihata, K.: Algorithm and Data Structure. Iwanami Publishing (1989) (in Japanese)
Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935–948 (1993)
Reuter Corpus, http://www.daviddlewis.com/resources/testcollections/reuters21578
Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)
Weiner, P.: Linear pattern matching algorithm. In: 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11 (1973)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yamaguchi, M., Miura, T. (2014). Incremental Patterns in Text Search. In: Zavoral, F., Jung, J., Badica, C. (eds) Intelligent Distributed Computing VII. Studies in Computational Intelligence, vol 511. Springer, Cham. https://doi.org/10.1007/978-3-319-01571-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-01571-2_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01570-5
Online ISBN: 978-3-319-01571-2
eBook Packages: EngineeringEngineering (R0)