full-text-search

问题 I've setup a full text index on a small selection of records across 3 fields (tried a combination of the 3 as well and had the same result), and some words return results fine, but certain ones such as 'house' and 'australia' don't (interestingly, 'australian' and 'home' do). It seems like odd behaviour. If I add "WITH QUERY EXPANSION" I get results, but they aren't the most relevant now. Anyone got any idea why this is? Otherwise I'm going to have to resort to using LIKE searches, and I'd

问题 Using the Sql Server 2008 how can you actually find an exact string match using full-text search. I'm having a real hard time with this and I just couldn't find a satisfactory solution anywhere online. For example, if I'm searching for the string "Bojan Skrchevski" I want the first result to be exactly that. So far I've tried formatting the string like: "Bojan* NEAR Skrchevski*" and call CONTAINSTABLE to get results, but this string is formatted to return more results as Bojana and Bojananana

问题 I am doing a multilingual search. And I will use lucene as the tool to do it. I have the translated contents already, there will be 3 or 4 languages of each document. For indexing and search, there could be the 4 strategies, For each document/contents: each language are indexed in different index/directory. each language are indexed in different document but in the same index. each language are indexed in different Field but in the same document. all the languages are indexed in the same

问题 Does anyone have information on how to create a custom word breaker for SQL Server 2005. I'd prefer to write it in c#. I need to be able to search on terms such as 'c#', 'f#' etc but the '#' character is a word breaker in the English (UK) word breaker component and can't be changed in any other way. I have found the following article which provides an incomplete (the IWordSink interface is missing) sample and references an article that is no longer available. This article also doesn't provide

问题 I'm using mysql's built in boolean fulltext features to search a dataset. (MATCH... AGAINST syntax). I'm running into a problem where keywords that are in MySql's default stopwords list are not returning any results. For example, "before", "between", etc. There is (I think) no way to disable MySql's stopwords at runtime. And because I am hosting my website on a shared server (DreamHost), I dont have the option of recompiling MySQL with stopwords disabled. I'm wondering if anyone has any

问题 I'm using mysql's built in boolean fulltext features to search a dataset. (MATCH... AGAINST syntax). I'm running into a problem where keywords that are in MySql's default stopwords list are not returning any results. For example, "before", "between", etc. There is (I think) no way to disable MySql's stopwords at runtime. And because I am hosting my website on a shared server (DreamHost), I dont have the option of recompiling MySQL with stopwords disabled. I'm wondering if anyone has any

问题 I'm have some trouble with the fulltext CONTAINS operator. Here's a quick script to show what I'm doing. Note that the WAITFOR line simply gives the fulltext index a moment to finish filling up. create table test1 ( id int constraint pk primary key, string nvarchar(100) not null ); insert into test1 values (1, 'dog') insert into test1 values (2, 'dogbreed') insert into test1 values (3, 'dogbreedinfo') insert into test1 values (4, 'dogs') insert into test1 values (5, 'breeds') insert into

问题 We have a huge, old, horrible codebase that makes it nearly impossible to find things when you need it. We're working on improving it, sure... but I often find myself doing massive recursive greps to search through the contents of files to find where things are used. Is there a tool I can use to build a fulltext index of text files in a directory and then query that from the command-line? Prefer something that can be run in user-space and doesn't need a daemon. We have many users on our dev

问题 I am currently working on a project where I want to search for employees via just one input search term. For this I am using the SQL FTS. The table schema looks like this Employee table EmployeeId, Firstname, Lastname Sample data 1, John, Miller 2, Chuck, Norris Address table AddressId, EmployeeId, CityId, Street, StreetNumber Sample data 1, 1, 1, Avenue, 12 2, 2, 2, Wimbledon Rd, 12 City table CityId, Name, ZipCode Sample data 1, Hamburg, 22335 2, London, 12345 So now I got the following

问题 I tried to solve the problem of two dimensional search using a combination of Aho-Corasick and a single dimensional KMP, however, I still need something faster. To elaborate, I have a matrix A of characters of size n1*n2 and I wish to find all occurrences of a smaller matrix B of size m1*m2 and I want that to be in O(n1*n2+m1*m2) if possible. For example: A = a b c b c b b c a c a c d a b a b a q a s d q a and B = b c b c a c a b a the algorithm should return the indexes of say, the upper