https://github.com/laserpants/fuzzyset-haskell
:sheep: A fuzzy string set implementation in Haskell.
https://github.com/laserpants/fuzzyset-haskell
fuzzy-matching haskell search string
Last synced: 4 months ago
JSON representation
:sheep: A fuzzy string set implementation in Haskell.
- Host: GitHub
- URL: https://github.com/laserpants/fuzzyset-haskell
- Owner: laserpants
- License: bsd-3-clause
- Created: 2017-09-24T21:34:42.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2024-03-08T03:13:11.000Z (over 1 year ago)
- Last Synced: 2025-03-12T23:13:27.195Z (4 months ago)
- Topics: fuzzy-matching, haskell, search, string
- Language: Haskell
- Homepage: http://hackage.haskell.org/package/fuzzyset
- Size: 207 KB
- Stars: 10
- Watchers: 1
- Forks: 3
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# fuzzyset-haskell
[](https://github.com/laserpants/fuzzyset-haskell/actions/workflows/haskell.yml)
[](https://opensource.org/licenses/BSD-3-Clause)
[](https://www.haskell.org/)
[](http://hackage.haskell.org/package/fuzzyset)A fuzzy string set data structure for approximate string matching.
In a nutshell:
1. Add data to the set (see `add`, `add_`, `addMany`, and `addMany_`)
2. Query the set (see `find`, `findMin`, `findOne`, `findOneMin`, `closestMatchMin`, and `closestMatch`)Refer to the [Haddock docs](http://hackage.haskell.org/package/fuzzyset) for details.
## Example
```haskell
{-# LANGUAGE OverloadedStrings #-}
module Main where ```import Control.Monad.Trans.Class (lift)
import Data.Text (Text)
import Data.FuzzySet (FuzzySearchT, add_, closestMatch, runDefaultFuzzySearchT)findMovie :: Text -> FuzzySearchT IO (Maybe Text)
findMovie = closestMatchprog :: FuzzySearchT IO ()
prog = do
add_ "Jurassic Park"
add_ "Terminator"
add_ "The Matrix"
result <- findMovie "The Percolator"
lift (print result)main :: IO ()
main = runDefaultFuzzySearchT prog
```