suggestions = spellChecker.suggestSimilar(queryString,suggestionsNumber);  

public String[] suggestSimilar(String word, int numSug, IndexReader ir,String field, SuggestMode suggestMode, float accuracy)                                                          throws IOException {   // obtainSearcher calls ensureOpenfinal IndexSearcher indexSearcher = obtainSearcher();try {if (ir == null || field == null) {suggestMode = SuggestMode.SUGGEST_ALWAYS;//1.}if (suggestMode == SuggestMode.SUGGEST_ALWAYS) {ir = null;field = null;}final int lengthWord = word.length();final int freq = (ir != null && field != null) ? ir.docFreq(new Term(field, word)) : 0;final int goalFreq = suggestMode==SuggestMode.SUGGEST_MORE_POPULAR ? freq : 0;// if the word exists in the real index and we don't care for word frequency, return the word itselfif (suggestMode==SuggestMode.SUGGEST_WHEN_NOT_IN_INDEX && freq > 0) {return new String[] { word };}BooleanQuery query = new BooleanQuery();String[] grams;String key;for (int ng = getMin(lengthWord); ng <= getMax(lengthWord); ng++) {//2.key = "gram" + ng; // form keygrams = formGrams(word, ng); // form word into ngrams (allow dups too)if (grams.length == 0) {continue; // hmm
        }if (bStart > 0) { // should we boost prefixes?add(query, "start" + ng, grams[0], bStart); // matches start of word}if (bEnd > 0) { // should we boost suffixesadd(query, "end" + ng, grams[grams.length - 1], bEnd); // matches end of word}for (int i = 0; i < grams.length; i++) {add(query, key, grams[i]);}}int maxHits = 10 * numSug;ScoreDoc[] hits = indexSearcher.search(query, null, maxHits).scoreDocs;//3.SuggestWordQueue sugQueue = new SuggestWordQueue(numSug, comparator);// go thru more than 'maxr' matches in case the distance filter triggersint stop = Math.min(hits.length, maxHits);SuggestWord sugWord = new SuggestWord();for (int i = 0; i < stop; i++) {sugWord.string = indexSearcher.doc(hits[i].doc).get(F_WORD); // get orig word// don't suggest a word for itself, that would be sillyif (sugWord.string.equals(word)) {//4.　　　　　　　　　　continue;}// edit distancesugWord.score = sd.getDistance(word,sugWord.string);//5.if (sugWord.score < accuracy) {continue;}if (ir != null && field != null) { // use the user indexsugWord.freq = ir.docFreq(new Term(field, sugWord.string)); // freq in the index// don't suggest a word that is not present in the fieldif ((suggestMode==SuggestMode.SUGGEST_MORE_POPULAR && goalFreq > sugWord.freq) || sugWord.freq < 1) {continue;}}sugQueue.insertWithOverflow(sugWord);if (sugQueue.size() == numSug) {// if queue full, maintain the minScore scoreaccuracy = sugQueue.top().score;}sugWord = new SuggestWord();}// convert to array stringString[] list = new String[sugQueue.size()];for (int i = sugQueue.size() - 1; i >= 0; i--) {list[i] = sugQueue.pop().string;}return list;} finally {releaseSearcher(indexSearcher);}}