Haskell Data Analysis Cookbook

Chapter 3. The Science of Words

In this chapter, we will cover the following recipes:

• Displaying a number in another base
• Reading a number from another base
• Searching for a substring using Data.ByteString
• Searching a string using the Boyer–Moore–Horspool algorithm
• Searching a string using the Rabin-Karp algorithm
• Splitting a string on lines, words, or arbitrary tokens
• Finding the longest common subsequence
• Computing a phonetic code
• Calculating the edit distance between two strings
• Computing the Jaro–Winkler distance between two strings
• Finding strings within one-edit distance
• Fixing spelling mistakes using edit distance

Introduction

Many interesting analysis ...