Take the query “word1 word2” as an example. BOOLEAN mode indicates that your entire query matches the document (e.g. it contains both word1 AND word2). Boolean mode is a strict match. The formula normally used is based on the Vector Space Model of searching. Very simplified, it figures out two measures to determine how important … Read more
In general, there is a tradeoff between “precision” and “recall”. High precision means that fewer irrelevant results are presented (no false positives), while high recall means that fewer relevant results are missing (no false negatives). Using the LIKE operator gives you 100% precision with no concessions for recall. A full text search facility gives you … Read more
There is pdfgrep, which does exactly what its name suggests. pdfgrep -R ‘a pattern to search recursively from path’ /some/path I’ve used it for simple searches and it worked fine. (There are packages in Debian, Ubuntu and Fedora.) Since version 1.3.0 pdfgrep supports recursive search. This version is available in Ubuntu since Ubuntu 12.10 (Quantal).
A very simple way would be to use Luke. On the ‘Overview’ tab, there is a ‘Show top terms’ button that can be used for what you need.
use a myisam fulltext table to index back into your innodb tables for example: Build your system using innodb: create table users (…) engine=innodb; create table forums (…) engine=innodb; create table threads ( forum_id smallint unsigned not null, thread_id int unsigned not null default 0, user_id int unsigned not null, subject varchar(255) not null, — … Read more
Using interceptors introduced in EF6, you could mark the full text search in linq and then replace it in dbcommand as described in http://www.entityframework.info/Home/FullTextSearch: public class FtsInterceptor : IDbCommandInterceptor { private const string FullTextPrefix = “-FTSPREFIX-“; public static string Fts(string search) { return string.Format(“({0}{1})”, FullTextPrefix, search); } public void NonQueryExecuting(DbCommand command, DbCommandInterceptionContext<int> interceptionContext) { } … Read more
Bad news: there’s no way. Good news: you don’t need it (as it won’t help anyway). I’ve faced similar issue on one of my projects. My understanding is that while building full-text index, SQL Server treats all special characters as word delimiters and hence: Your word with such a character is represented as two (or … Read more
Give a try to: db.supplies.runCommand(“text”, {search:”\”printer\” \”ink\””}) Also, here’s a quote from docs: If the search string includes phrases, the search performs an AND with any other terms in the search string; e.g. search for “\”twinkle twinkle\” little star” searches for “twinkle twinkle” and (“little” or “star”). Hope that helps.
This section of the manual might interest you : 11.8.6. Fine-Tuning MySQL Full-Text Search (quoting a portion of it) : The minimum and maximum lengths of words to be indexed are defined by the ft_min_word_len and ft_max_word_len system variables. The default minimum value is four characters; the default maximum is version dependent. If you change … Read more
Oracle Text is the equivalent functionality. I’ve had good experiences with it. Assuming that you are maintaining the text index asynchronously, that tends to be the first source of problems, since it may be a bit between a change being made and the index getting updated, but that’s normally quite reasonable during normal operation.