久久久久久久av_日韩在线中文_看一级毛片视频_日本精品二区_成人深夜福利视频_武道仙尊动漫在线观看

    <small id='npPV7'></small><noframes id='npPV7'>

    • <bdo id='npPV7'></bdo><ul id='npPV7'></ul>

    <tfoot id='npPV7'></tfoot>

    1. <i id='npPV7'><tr id='npPV7'><dt id='npPV7'><q id='npPV7'><span id='npPV7'><b id='npPV7'><form id='npPV7'><ins id='npPV7'></ins><ul id='npPV7'></ul><sub id='npPV7'></sub></form><legend id='npPV7'></legend><bdo id='npPV7'><pre id='npPV7'><center id='npPV7'></center></pre></bdo></b><th id='npPV7'></th></span></q></dt></tr></i><div class="qwawimqqmiuu" id='npPV7'><tfoot id='npPV7'></tfoot><dl id='npPV7'><fieldset id='npPV7'></fieldset></dl></div>
      <legend id='npPV7'><style id='npPV7'><dir id='npPV7'><q id='npPV7'></q></dir></style></legend>

      是否有適用于 Lucene 的快速、準確的熒光筆?

      Is there a fast, accurate Highlighter for Lucene?(是否有適用于 Lucene 的快速、準確的熒光筆?)

      <tfoot id='cPTq4'></tfoot>
        <tbody id='cPTq4'></tbody>

      <small id='cPTq4'></small><noframes id='cPTq4'>

          • <bdo id='cPTq4'></bdo><ul id='cPTq4'></ul>
            <legend id='cPTq4'><style id='cPTq4'><dir id='cPTq4'><q id='cPTq4'></q></dir></style></legend>

              <i id='cPTq4'><tr id='cPTq4'><dt id='cPTq4'><q id='cPTq4'><span id='cPTq4'><b id='cPTq4'><form id='cPTq4'><ins id='cPTq4'></ins><ul id='cPTq4'></ul><sub id='cPTq4'></sub></form><legend id='cPTq4'></legend><bdo id='cPTq4'><pre id='cPTq4'><center id='cPTq4'></center></pre></bdo></b><th id='cPTq4'></th></span></q></dt></tr></i><div class="qwawimqqmiuu" id='cPTq4'><tfoot id='cPTq4'></tfoot><dl id='cPTq4'><fieldset id='cPTq4'></fieldset></dl></div>

                本文介紹了是否有適用于 Lucene 的快速、準確的熒光筆?的處理方法,對大家解決問題具有一定的參考價值,需要的朋友們下面隨著小編來一起學習吧!

                問題描述

                我一直在使用 (Java) Lucene 的熒光筆(在 Sandbox 包中)一段時間.但是,在匹配搜索結果中的正確詞時,這并不是很準確 - 它適用于簡單的查詢,例如搜索兩個單獨的詞會在結果中突出顯示兩個代碼片段.

                I've been using the (Java) Highlighter for Lucene (in the Sandbox package) for some time. However, this isn't really very accurate when it comes to matching the correct terms in search results - it works well for simple queries, for example searching for two separate words will highlight both code fragments in the results.

                但是,它不適用于更復雜的查詢.在最簡單的情況下,諸如Stack Overflow"之類的短語查詢將匹配突出顯示中出現的所有 Stack 或 Overflow,這會給用戶一種效果不佳的印象.

                However, it doesn't act well with more complicated queries. In the simplest case, phrase queries such as "Stack Overflow" will match all occurrences of Stack or Overflow in the highlighting, which gives the impression to the user that it isn't working very well.

                我嘗試在 here 應用修復程序,但它來了有很多性能警告,最終根本無法使用.性能尤其是通配符查詢的問題.這是由于突出顯示的工作方式;而不是只處理查詢字符串和文本,它會像 Lucene 那樣解析它,然后查找 Lucene 所做的所有匹配;不幸的是,這意味著對于某些通配符查詢,它可能會在大型文檔中查找 2000 多個子句的匹配項,而且速度還不夠快.

                I tried applying the fix here but that came with a lot of performance caveats, and at the end of the day was just plain unusable. The performance is especially an issue on wildcard queries. This is due to the way that the highlighting works; instead of just working on the querystring and the text it parses it as Lucene would and then looks for all the matches that Lucene has made; unfortunately this means that for certain wildcard queries it can be looking for matches to 2000+ clauses on large documents, and it's simply not fast enough.

                有沒有更快的實現準確的熒光筆?

                Is there any faster implementation of an accurate highlighter?

                推薦答案

                有一個新的更快的熒光筆(需要修補,但將是 2.9 版本的一部分)

                There is a new faster highlighter (needs to be patched in but will be part of release 2.9)

                https://issues.apache.org/jira/browse/LUCENE-1522

                還有一個回溯這個問題

                這篇關于是否有適用于 Lucene 的快速、準確的熒光筆?的文章就介紹到這了,希望我們推薦的答案對大家有所幫助,也希望大家多多支持html5模板網!

                【網站聲明】本站部分內容來源于互聯網,旨在幫助大家更快的解決問題,如果有圖片或者內容侵犯了您的權益,請聯系我們刪除處理,感謝您的支持!

                相關文檔推薦

                How can I detect integer overflow on 32 bits int?(如何檢測 32 位 int 上的整數溢出?)
                Local variables before return statements, does it matter?(return 語句之前的局部變量,這有關系嗎?)
                How to convert Integer to int?(如何將整數轉換為整數?)
                How do I create an int array with randomly shuffled numbers in a given range(如何在給定范圍內創建一個隨機打亂數字的 int 數組)
                Inconsistent behavior on java#39;s ==(java的行為不一致==)
                Why is Java able to store 0xff000000 as an int?(為什么 Java 能夠將 0xff000000 存儲為 int?)
                <i id='USlFM'><tr id='USlFM'><dt id='USlFM'><q id='USlFM'><span id='USlFM'><b id='USlFM'><form id='USlFM'><ins id='USlFM'></ins><ul id='USlFM'></ul><sub id='USlFM'></sub></form><legend id='USlFM'></legend><bdo id='USlFM'><pre id='USlFM'><center id='USlFM'></center></pre></bdo></b><th id='USlFM'></th></span></q></dt></tr></i><div class="qwawimqqmiuu" id='USlFM'><tfoot id='USlFM'></tfoot><dl id='USlFM'><fieldset id='USlFM'></fieldset></dl></div>

                • <small id='USlFM'></small><noframes id='USlFM'>

                • <tfoot id='USlFM'></tfoot>
                      <tbody id='USlFM'></tbody>

                      • <bdo id='USlFM'></bdo><ul id='USlFM'></ul>

                        1. <legend id='USlFM'><style id='USlFM'><dir id='USlFM'><q id='USlFM'></q></dir></style></legend>

                        2. 主站蜘蛛池模板: 在线亚洲欧美 | 日韩成人在线网站 | 免费看日韩视频 | 日韩在线综合网 | 日产久久 | 久久久久国产精品 | 米奇狠狠鲁 | 亚洲午夜网 | 久操国产 | 国产精品毛片无码 | 精品国产一区二区三区免费 | 国产主播第一页 | 欧美日韩中文字幕在线 | 自拍偷拍第一页 | 日韩成人免费视频 | 国产亚洲网站 | 国产福利精品一区 | 色约约视频 | 日韩精品一区二区三区中文在线 | 99视频免费播放 | 欧美成人猛片aaaaaaa | 久久久久久国产精品免费免费 | 欧美a∨| 中文字幕一区二区三区四区五区 | 在线观看视频你懂得 | 亚洲精品毛片av | 国产亚洲精品久久午夜玫瑰园 | 人妖一区| 午夜成人免费视频 | 久久精品国产一区 | 欧美在线精品一区 | 亚洲欧洲国产视频 | 久久久久无码国产精品一区 | 99精品一区二区 | 亚洲国产精品一区二区第一页 | 欧美日韩在线一区 | 欧美日韩在线观看一区 | 国产自产21区 | 91观看| 精品免费视频 | 精品欧美 |