- Release notes
- Quick start
- Introduction to Whoosh
- Glossary
- Designing a schema
- How to index documents
- How to search
- Parsing user queries
- The default query language
- Indexing and parsing dates/times
- Query objects
- About analyzers
- Stemming, variations, and accent folding
- Indexing and searching N-grams
- Sorting and faceting
- How to create highlighted search result excerpts
- Query expansion and Key word extraction
- “Did you mean… ?” Correcting errors in user queries
- Field caches
- Tips for speeding up batch indexing
- Concurrency, locking, and versioning
- Indexing and searching document hierarchies
- Whoosh recipes
- Whoosh API
analysismodulecodec.basemodulecollectorsmodulecolumnsmodulefieldsmodulefiledb.filestoremodulefiledb.filetablesmodulefiledb.structfilemoduleformatsmodulehighlightmodulesupport.bitvectormoduleindexmodulelang.morph_enmodulelang.portermodulelang.wordnetmodulematchingmoduleqparsermodulequerymodulereadingmodulescoringmodulesearchingmodulesortingmodulespellingmodulesupport.charsetmodulesupport.levenshteinmoduleutilmodulewritingmodule
- Technical notes
support.levenshtein module¶
Contains functions implementing edit distance algorithms.
-
whoosh.support.levenshtein.relative(a, b)¶ Returns the relative distance between two strings, in the range [0-1] where 1 means total equality.
-
whoosh.support.levenshtein.distance(seq1, seq2, limit=None)¶ Returns the Damerau-Levenshtein edit distance between two strings.