Is it 2 character search possible in lucence

by

Yes, this is possible using wildcards.

Feed your QueryParser with te*, and it will generate a query that starts for a te prefix with any suffix.

More Related Contents:

  1. Get highest frequency terms from Lucene index
  2. Given N number display M*M format [closed]
  3. In selection sort, if we have two duplicate elements, what is the behavior of the algorithm?
  4. Java while loop query [closed]
  5. How to make a 4×4 sudoku solver in java [closed]
  6. Java: check if array is heap
  7. Why does Java’s hashCode() in String use 31 as a multiplier?
  8. Sparse matrices / arrays in Java
  9. Quickest way to find missing number in an array of numbers
  10. Calculating all of the subsets of a set of numbers
  11. How to convert a byte array to its numeric value (Java)?
  12. How to get a Token from a Lucene TokenStream?
  13. Iteratively compute the Cartesian product of an arbitrary number of sets
  14. Find duplicate element in array in time O(n)
  15. Algorithm for finding all paths in a NxN grid
  16. print directory tree
  17. Most efficient way to see if an ArrayList contains an object in Java
  18. Sample Directed Graph and Topological Sort Code [closed]
  19. Lossless JPEG Rotate (90/180/270 degrees) in Java?
  20. Randomly Generate Letters According to their Frequency of Use?
  21. Most elegant way to change 0 to 1 and vice versa
  22. Find all numbers in the String [closed]
  23. find an element in a sorted matrix [duplicate]
  24. Java algorithm to make a straight pyramid [closed]
  25. The simplest algorithm for poker hand evaluation
  26. Can SHA-1 algorithm be computed on a stream? With low memory footprint?
  27. How does this Google Maps zoom level calculation work?
  28. How does the Euclidean Algorithm work?
  29. Java Smooth Color Transition
  30. (a * b) / c MulDiv and dealing with overflow from intermediate multiplication

Leave a Comment