Abstract
This chapter presents some basic procedures for operating with strings and the MATLAB® built-in functions for performing the most commonly required string operations. The chapter is structured as follows, first, in Sect. 4.1, basic functions for searching and comparing strings are presented along with the concept of edit distance. Then, in Sect. 4.2, basic functions and procedures for string replacement and insertion are described. In Sect. 4.3, the specific problems of string segmentation and concatenation are addressed; and in Sect. 4.4 set operations with strings are presented and discussed. Finally, in Sect. 4.5 some illustrative exercises are proposed.
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
Notes
- 1.
Proposed by the Russian mathematician Vladimir Levenshtein in 1965.
References
Levenshtein V (1966) Binary codes capable of correcting deletions, insertions, and reversals. Sov Phys Dokl 10:707–716
Stoll RR (1979) Set theory and logic. Dover Publications, New York
The MathWorks (2011) MATLAB product documentation. http://www.mathworks.com/help/techdoc/. Accessed 2 Nov 2011
Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J ACM 21(1):168–173
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Banchs, R.E. (2013). Basic Operations with Strings. In: Text Mining with MATLAB®. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4151-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4151-9_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4150-2
Online ISBN: 978-1-4614-4151-9
eBook Packages: Computer ScienceComputer Science (R0)