Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Lucene 4 Cookbook
  • Toc
  • feedback
Lucene 4 Cookbook

Lucene 4 Cookbook

By : Edwood Ng, Vineeth Mohan
3.2 (5)
close
Lucene 4 Cookbook

Lucene 4 Cookbook

3.2 (5)
By: Edwood Ng, Vineeth Mohan

Overview of this book

This book is for software developers who are new to Lucene and who want to explore the more advanced topics to build a search engine. Knowledge of Java is necessary to follow the code samples. You will learn core concepts, best practices, and also advanced features, in order to build an effective search application.
Table of Contents (11 chapters)
close
close
Preface
Preface
What this book covers
What you need for this book
Who this book is for
Sections
Conventions
Reader feedback
Customer support
Free Chapter
1
1. Introducing Lucene
1. Introducing Lucene
Introduction
Installing Lucene
Setting up a simple Java Lucene project
Obtaining an IndexWriter
Creating an analyzer
Creating fields
Creating and writing documents to an index
Deleting documents
Obtaining an IndexSearcher
Creating queries with the Lucene QueryParser
Performing a search
Enumerating results
2
2. Analyzing Your Text
2. Analyzing Your Text
Introduction
Obtaining a common analyzer
Obtaining a TokenStream
Obtaining TokenAttribute values
Using PositionIncrementAttribute
Using PerFieldAnalyzerWrapper
Defining custom TokenFilters
Defining custom analyzers
Defining custom tokenizers
Defining custom attributes
3
3. Indexing Your Data
3. Indexing Your Data
Introduction
Obtaining an IndexWriter
Creating a StringField
Creating a TextField
Creating a numeric field
Creating a DocValue Field
Transactional commits and index versioning
Reusing field and document objects per thread
Delving into field norms
Changing similarity implementation used during indexing
4
4. Searching Your Indexes
4. Searching Your Indexes
Introduction
Obtaining IndexReaders
Un-inverting single-valued fields in memory with FieldCache
TermVectors
IndexSearcher
Constructing queries
Specifying sort logic
Forming a search result
Pagination
Using Collectors
Sorting with custom FieldComparator
5
5. Near Real-time Searching
5. Near Real-time Searching
Introduction
Using the DirectoryReader to open index in Near Real-Time
Using the SearcherManager to refresh IndexSearcher
Generational indexing with TrackingIndexWriter
Maintaining search sessions with SearcherLifetimeManager
Performance tuning: latency and throughput
6
6. Querying and Filtering Data
chevron up
6. Querying and Filtering Data
Introduction
Performing advanced filtering
Creating a custom filter
Searching with QueryParser
TermQuery and TermRangeQuery
BooleanQuery
PrefixQuery and WildcardQuery
PhraseQuery and MultiPhraseQuery
FuzzyQuery
NumericRangeQuery
DisjunctionMaxQuery
RegexpQuery
SpanQuery
CustomScoreQuery
7
7. Flexible Scoring
7. Flexible Scoring
Introduction
Overriding similarity
Implementing the BM25 model
Implementing the language model
Implementing the divergence from randomness model
Implementing the information-based model
8
8. Introducing Elasticsearch
8. Introducing Elasticsearch
Introduction
Getting Elasticsearch
Creating a new index
Predefine field mappings
Adding a document
Deleting a document
Updating a document
Performing bulk indexing
Searching the index
Scaling Elasticsearch
9
9. Extending Lucene with Modules
9. Extending Lucene with Modules
Introduction
Exploring spatial search
Implementing joins
Performing faceting
Implementing grouping
Employing autosuggest
Implementing highlighting
10
Index
Index

FuzzyQuery

A FuzzyQuery matches terms based on similarity, using the Damerau-Levenshtein algorithm. We are not going into the details of the algorithm as it is outside of our topic. What we need to know is a fuzzy match is measured in the number of edits between terms. FuzzyQuery allows a maximum of 2 edits. For example, between "humptX" and humpty is first edit and between humpXX and humpty are two edits. There is also a requirement that the number of edits must be less than the minimum term length (of either the input term or candidate term). As another example, ab and abcd would not match because the number of edits between the two terms is 2 and it's not greater than the length of ab, which is 2.

How to do it...

Here is a code snippet to demonstrate FuzzyQuery:

FuzzyQuery query = new FuzzyQuery(new Term("content", "humpXX"));

How it works…

This Query will return sentences one, two, and four from our setup, as humpXX matches humpty within the two edits. In QueryParser, FuzzyQuery can be triggered...

End of Section 12
Next Section
bookmark search playlist font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete