Language.Distance.Search.Class

Documentation

class Search container full algo | container -> full, container -> algo where

Generic class for data structures that can perform queries retrieving words close to a given one.

Minimal definition: empty, insert, and query.

Methods

empty :: container

insert :: full -> container -> container

query

Arguments

:: Int

The maximum distance to search for

-> full

The starting word

-> container

-> [(full, Distance algo)]

singleton :: full -> container

member :: full -> container -> Bool

fromList :: [full] -> container

Instances

(Eq sym, ListLike full sym, EditDistance sym algo) => Search (BKDist full sym algo) full algo

(Ord sym, ListLike full sym, EditDistance sym DamerauLevenshtein) => Search (TSTDist full sym DamerauLevenshtein) full DamerauLevenshtein

(Ord sym, ListLike full sym, EditDistance sym Levenshtein) => Search (TSTDist full sym Levenshtein) full Levenshtein