I built something like that where each word was translated into a token
and a key built from the token and the position of the word and used to
build a tree. The tree access was fast and could probably be adapted to
produce strict ranking by position. The complexity of the method is the
need
Unfortunately, the fts module of sqlite does not support "fuzzy text search =
google search".
What you first need is a similarity measure between strings, e.g. the
Edit-distance.
Based on such a similarity measure, you could build up an appropriate index
structure,
e.g. a Relational M-tree
2 matches
Mail list logo
