tags:

views:

97

answers:

0
Q: 

Approximate/fuzzy string lookup using Tokyo Cabinet

I recently learned about Tokyo Cabinet and more precisely Tokyo Dystopia, a full-text search engine built on top of TC.

I'm looking for an approximate/fuzzy text index but it doesn't seem to be supported out-of-the-box by Dystopia. However, it seems like the engine is using a q-gram inverted index so this should be a relatively simple hack.

I'd like to know if anyone here implemented a similar fuzzy search using TC.

Cheers d

related questions

How do you know what a good index is?
What datatype should be used for storing phone numbers in SQL Server 2005?
What is the best way to build an index to get the fastest read response?
How would I go about creating a custom search index much like Lucene?
What is a Covered Index?
When should you use full-text indexing?
SQL/Oracle: when indexes on multiple columns can be used
Best use of indices on temporary tables in T-SQL
On Disk Substring index
How to implement a "related" degree measure algorithm?
Non-Clustered Index on a Clustered Index column improves performance?
HTML Help keyword location
One or Two Primary Keys in Many-to-Many Table?
Strategies for keeping a Lucene Index up to date with domain model changes
Do indexes work with "IN" clause
Table Scan vs. Add Index - which is quicker?
Why does SQL Server work faster when you index a table after filling it?
PostgreSQL: GIN or GiST indexes?
What's the difference between a Table Scan and a Clustered Index Scan?
Database Case Insensitive Index?
Testing for inequality in T-SQL
Tables with no Primary Key
How do I index a database field
How does database indexing work?
Why doesn't SQL Full Text Indexing return results for words containing #?