On Tue, Feb 19, 2008 at 2:08 PM, Bryan Oakley <[EMAIL PROTECTED]> wrote:
> On Feb 19, 2008 3:59 PM, Scott Hess <[EMAIL PROTECTED]> wrote:
> > On Tue, Feb 19, 2008 at 1:49 PM, Bryan Oakley <[EMAIL PROTECTED]> wrote:
> > > Also, I've seen references to fts3 -- is there a compelling reason for
>
On Feb 19, 2008 4:08 PM, Bryan Oakley <[EMAIL PROTECTED]> wrote:
> Is fts3 built-in to sqlite? I don't build my own -- I use the tcl
> bindings and just download a binary. I'm too stingy to buy a microsoft
> compiler :-\
You would think after so many years in the industry I'd learn to spend
5
On Tue, Feb 19, 2008 at 1:49 PM, Bryan Oakley <[EMAIL PROTECTED]> wrote:
> My code uses fts2, and for the first time today I discovered that no
> stemming appears to be going on under the covers. Googling around I
> see that I need to add "tokenize porter" when creating my table.
> Adding that
I'm revisiting a project I started a while ago, and have a question
about the FTS module(s). I haven't had my head wrapped around SQLite
in a long time -- I wrote the code, it works, and that's all I've had
to think about it for over year. So forgive me if I'm asking a common
question.
My code
On Tue, Feb 12, 2008 at 10:06 AM, Bram - Smartelectronix
<[EMAIL PROTECTED]> wrote:
> I have various tables which all relate to the same central object, all
> of them contain various pieces of information about this object. And I
> want to full-text-search for these objects.
>
> I.e. in my
Hello All, (my first post here)
I have various tables which all relate to the same central object, all
of them contain various pieces of information about this object. And I
want to full-text-search for these objects.
I.e. in my case sounds (which have tags, comments, metadata, categories,
On 8/29/07, Scott Hess <[EMAIL PROTECTED]> wrote:
> What was fts3 will now be fts4. fts3 will now be
> fts2-with-rowid-fixed. fts3 is already in the tree, but with an
> #error at the top to force people to not use it without reading a
> comment. I was planning to turn that off this week (what
Hmm, and a clarification on the n-gram case ... there are no current
plans to implement any n-gram capabilities in fts. This kind of thing
has been discussed, but since it still seems like a nice-to-have type
thing and not a must-have type thing, no time is being spent on it. I
have somewhat of
What was fts3 will now be fts4. fts3 will now be
fts2-with-rowid-fixed. fts3 is already in the tree, but with an
#error at the top to force people to not use it without reading a
comment. I was planning to turn that off this week (what with the
SQLite 3.5 stuff going on, might as well!).
The
A primary constraint of the porter algorithm in fts is that it's
completely unencumbered open-source. That may-or-may-not make it a
great stemmer, of course :-). One of the reasons it's in there in the
first place is as an example of an alternative to the very basic
"simple" fts tokenizer. One
On 8/24/07, Scott Hess <[EMAIL PROTECTED]> wrote:
>
> My current focus for the next generation is international support
> (this is more of a Google Gears project, but with focus on SQLite so
> there is likely to be stuff checked in on the SQLite side), and more
> scalable/manageable indexing.
N-gram is a sequense of N Letters of a word or set of words...
http://en.wikipedia.org/wiki/N-gram
On 29/08/2007, Uma Krishnan <[EMAIL PROTECTED]> wrote:
>
> Hello Scott,
>
> I have several clarifications with respect to full text search. I'm a
> newbie in open source development, so please
Hello Scott,
I have several clarifications with respect to full text search. I'm a newbie in
open source development, so please bear with me if some of the questions are
irrelevant/obvious/nonsense.
I was given to understand that the potter stemming algorithm implemented in
fts2 is not robust
Porter stemmer is already in there. The main issue with Porter is
that it's English only.
There is no general game-plan for fuzzy search at this time, though if
someone wants to step into the breech, go for it! Even a prototype
which demonstrates the concepts and problems but isn't
Would it not be more useful to first implement potter stemmer algorithm, and
then to implement n-gram (as I understand n-gram is for cross column fuzzy
search?). What is the general game plan for FTS3 with regard to fuzzy search?
Thanks in advance
"Cesar D. Rodas" <[EMAIL PROTECTED]>
I
On 23/08/07, Russell Leighton <[EMAIL PROTECTED]> wrote:
>
>
> Could fts3 (the next fts) have the option to override the default
> 'match' function with one passed in (similar to the tokenizer)?
>
> The reason I ask is then the fts table could be used as smart index
> when the tokenizer is
>
Could fts3 (the next fts) have the option to override the default
'match' function with one passed in (similar to the tokenizer)?
The reason I ask is then the fts table could be used as smart index
when the tokenizer is
something like bigram, trigram, etc. and the 'match' function computes
It's all interesting, but categorization is hard. Not so hard to get
some results, sort of hard to get quality results. Might work as a
nice adjunct to fts, so that you can throw the search terms into the
categorization engine and put up suggestions for re-running the search
with a tighter
On 23/08/07, Scott Hess <[EMAIL PROTECTED]> wrote:
> On 8/20/07, Cesar D. Rodas <[EMAIL PROTECTED]> wrote:
> > As I know ( I can be wrong ) SQLite Full Text Search is only match with hole
> > words right? It could not be
> > And also no FT extension to db ( as far I know) is miss spell tolerant,
>
On 8/20/07, Cesar D. Rodas <[EMAIL PROTECTED]> wrote:
> As I know ( I can be wrong ) SQLite Full Text Search is only match with hole
> words right? It could not be
> And also no FT extension to db ( as far I know) is miss spell tolerant,
Yes, fts is matching exactly. There is some primitive
: [sqlite] FTS2 Question again Python + .NET
"
I'm having the same problem with .net, cant find a function which does
this...
"
Which .NET wrapper are you using?
System.Data.SQLite has FTS2 precompiled. http://sqlite.phxsoftware.com
Sam
---
We
Hello SQLite community
This is suggestion for the core team suggestion.
As I know ( I can be wrong ) SQLite Full Text Search is only match with hole
words right? It could not be
And also no FT extension to db ( as far I know) is miss spell tolerant, And
I've found this Paper that talks about
er to join our team building Flex
based products. Position is in the Washington D.C. metro area. If interested
contact [EMAIL PROTECTED]
-Original Message-
From: Andre du Plessis [mailto:[EMAIL PROTECTED]
Sent: Monday, August 20, 2007 11:50 AM
To: sqlite-users@sqlite.org
Subject: [sq
Schema:
create table files (FILE_NAME TEXT, DATA TEXT);
create index idx_file_name on files (FILE_NAME);
create virtual table fts_files using fts2('file_name', 'data');
Ok, I just can't seem to figure out how to load fts2.dll in Python:
Standard sqlite3 module that comes with python
I have modified the Makefile, so I have added:
SRC += \
$(TOP)/ext/fts2/fts2.c \
$(TOP)/ext/fts2/fts2.h \
$(TOP)/ext/fts2/fts2_hash.c \
$(TOP)/ext/fts2/fts2_hash.h \
$(TOP)/ext/fts2/fts2_porter.c \
$(TOP)/ext/fts2/fts2_tokenizer.h \
$(TOP)/ext/fts2/fts2_tokenizer1.c
make sqlite3.c
"David Crawshaw" <[EMAIL PROTECTED]> wrote:
> Hello all,
>
> I was wondering if it would be possible to include fts2 in the
> amalgamated version of the source code. It looks like all that needs
> to be done is add
>
> tclsh $(TOP)/ext/fts2/mkfts2amal.tcl
>
> to the end of the target_source
I guess that the sqlite authors only want to include the core library
in the amalgamation and rely on loadable extension modules for the rest.
Perhaps fts1 and fts2 could be statically added to the amalgomation, but
ifdef'd out by default.
--- David Crawshaw <[EMAIL PROTECTED]> wrote:
> I was
]
Sent: Thursday, July 26, 2007 3:39 AM
To: sqlite-users@sqlite.org
Subject: [sqlite] fts2 in the amalgamation source?
Hello all,
I was wondering if it would be possible to include fts2 in the
amalgamated version of the source code. It looks like all that needs
to be done is add
tclsh $(TOP
Hello all,
I was wondering if it would be possible to include fts2 in the
amalgamated version of the source code. It looks like all that needs
to be done is add
tclsh $(TOP)/ext/fts2/mkfts2amal.tcl
to the end of the target_source target in Makefile.in and then add
fts2amal.c
to the
Uma Krishnan wrote:
Downloading SQLite source does not come with FTS2 source? If not, how do I
download FTS2 source. I see only a way to download binary.
Thanks in advance
Uma
Look in the CVS archive. Everything is there.
Downloading SQLite source does not come with FTS2 source? If not, how do I
download FTS2 source. I see only a way to download binary.
Thanks in advance
Uma
Andre du Plessis wrote:
I saw this post on FTS2, and looked on the site and saw the FTS2 binary,
where can I find more information on this
The wiki has a lot of info. Check out:
http://www.sqlite.org/cvstrac/wiki?p=FtsOne
http://www.sqlite.org/cvstrac/wiki?p=FtsTwo
I saw this post on FTS2, and looked on the site and saw the FTS2 binary,
where can I find more information on this I searched the documentation
and can't find anything, it would be appreciated if someone can point me
to a doc that explains what it is and how to use it.
Thank you.
Hi all! I am having a problem with FTS2. Someone in the IRC channel
(after I posted a bug report) said to contact here.
My issue is here. Please respond asap! Thanks.
http://www.sqlite.org/cvstrac/tktview?tn=2446
Daniel A. White
{ Kent State University: Computer Science major }
{ JMC
We have just started to use it. So far it is performing well, but we
have not subjected it to high volume and large data sets yet.
I have written a simple function which helps in our application. The
function concanenates columns to produce a block of text then strips out
punctuation and
2007/6/18, Russell Leighton <[EMAIL PROTECTED]>:
Could folks that have used fts2 in production apps/systems relate their
experiences to the group?
I would very much be interested in how folks are using it, how well it
performs with large data and general impressions.
I had a look at it for an
Could folks that have used fts2 in production apps/systems relate their
experiences to the group?
I would very much be interested in how folks are using it, how well it
performs with large data and general impressions.
Thanks in advance.
Russ
On 11/14/06, Vikram Bhandoh <[EMAIL PROTECTED]> wrote:
I'm using fts2 to index some documents. And I want to get a list of all the
distinct terms that are in those documents. Is there a seperate table which
holds the terms or is there a function maybe like snippet, offset?
Just to clarify -
Hi, firstly I want to say thanks for this terrific extension and product.
I'm amazed at what it can do and how quick it is.
I'm using fts2 to index some documents. And I want to get a list of all the
distinct terms that are in those documents. Is there a seperate table which
holds the terms or
Cesar David Rodas Maldonado wrote:
Ok.
I have another question. I compile SQLite (the last version 3.3.8)
with this
fts2 extension. So how can i index something (i mean with the SQL).
A good reference for using fts1 or fts2 is available at URL:
http://www.sqlite.org/cvstrac/wiki?p=FtsOne
Ok.
I have another question. I compile SQLite (the last version 3.3.8) with this
fts2 extension. So how can i index something (i mean with the SQL).
Thanks.
And I think this ext is very useful
On 10/13/06, Scott Hess <[EMAIL PROTECTED]> wrote:
You'll want (from the bottom of
You'll want (from the bottom of http://www.sqlite.org/download.html):
cvs -d :pserver:[EMAIL PROTECTED]:/sqlite login
cvs -d :pserver:[EMAIL PROTECTED]:/sqlite checkout sqlite
or perhaps
cvs -d :pserver:[EMAIL PROTECTED]:/sqlite login
cvs -d :pserver:[EMAIL PROTECTED]:/sqlite checkout
That's very cool... What i am wondering is if is there any way to
download the complete tarball of that folder...
thanks.
On 10/13/06, Scott Hess <[EMAIL PROTECTED]> wrote:
I've checked a new version of the full-text search module into
ext/fts2 under CVS. fts2 uses a very different style of
I've checked a new version of the full-text search module into
ext/fts2 under CVS. fts2 uses a very different style of storage from
fts1, and is much much faster for insertions (25x faster inserting the
Enron email database, for instance). The interface is identical, you
just refer to fts2
44 matches
Mail list logo
