201128416 六、發明說明： 【發明所屬之技術領域】 本申請案關於電腦應用技術領域，特別是關於一種搜 尋結果產生方法及資訊搜尋系統。 【先前技術】 資訊搜尋系統是一種能夠爲用戶提供資訊檢索服務的 系統，以網際網路中常用的搜尋引擎爲例，作爲應用在網 際網路領域的搜尋系統，搜尋引擎目前已經成爲用戶上網 必不可少的輔助工具之一。從用戶使用的角度看，搜尋引 擎一般提供一個包含搜尋框的介面，用、戶在搜尋框輸入搜 尋關鍵字，通過流覽器提交給搜尋引擎後，搜尋引擎就會 返回與用戶輸入的關鍵字內容相匹配的資訊。 在實際應用中，用戶對於搜尋關鍵字的選擇，具有較 大的主觀隨意性，因此，當用戶所選擇的關鍵字不恰當時 ，往往無法得到滿意的搜尋結果。爲解決這一問題，現有 很多搜尋引擎都提供了“相關搜尋”的功能。其基本實現方 法是：搜尋引擎在接收到用戶輸入的關鍵字之後，根據一 定的演算法’找到一定數量的與該關鍵字相關的詞，然後 在返回關鍵字匹配資訊的同時，也將這些相關詞提供給用 戶。當用戶點擊這些相關詞後，搜尋引擎就會以用戶所點 擊的相關詞作爲關鍵字，執行另一次搜尋操作。 通過對現有技術的硏究，.發明人發現：在相關搜尋的 實際使用中，很多用戶往往只是試探性地點擊某個相關詞 201128416 進行搜尋，當對使用相關詞進行搜尋的結果不滿意時’用 戶可能希望返回到原始關鍵字的搜尋結果、或者使用原始 關鍵字的其他相關詞進行搜尋。但是，此時用戶會發現： 原始關鍵字（或原始關鍵字的其他相關詞）並不在當前關 鍵字的相關詞之列，因此需要重新鍵入原始關鍵字、重新 執行搜尋，造成搜尋效率的下降，並且用戶的重複搜尋操 作也會爲搜尋伺服器造成很大的負擔。雖然用戶也可以通 過使用流覽器的“回退”功能達到類似的目的，但是考慮到 用戶可能會在查看相關搜尋結果的時候做了翻頁操作、甚 至會進一步執行二次相關搜尋，因此需要多次使用“回退” 操作才能找回之前的搜尋結果，不僅操作繁瑣，而且依然 存在搜尋效率低下的問題。 【發明內容】 爲解決上述技術問題，本申請案實施例提供一種搜尋 結果產生方法及資訊搜尋系統，以簡化用戶的相關搜尋操 作、提高搜尋效率、減輕搜尋伺服器的負擔，的技術方案 如下： 本申請案實施例提供一種搜尋結果產生方法，包括： 資訊搜尋系統接收搜尋關鍵字A ; 利用該關鍵字A進行搜尋並獲得該關鍵字A的相關 詞； 在第一區域顯示該關鍵字A的匹配資訊、在第二區 域顯示該關鍵字A和該關鍵字A的至少一個相關詞； -6- 201128416 當用戶選擇該關鍵字A的某個相關詞A1後，在第~ 區域顯示該相關詞A1的匹配資訊、維持第二顯示區域的 顯示內容。 本申請案實施例還提供一種資訊搜尋系統，包括： 搜尋單元，用於接收搜尋關鍵字A;利用該關鍵字a 進行搜尋並獲得該關鍵字A的相關詞； 第一區域處理單元，用於在第一區域顯示該關鍵字A 的匹配資訊、 第二區域處理單元，用於在第二區域顯示該關鍵字A 和該關鍵字A的至少一個相關詞； 當用戶選擇該關鍵字A的某個相關詞A1後， 該第一區域處理單元，用於在第一區域顯示該相關詞 A 1的匹配資訊、 該第二區域處理單元，用於維持第二顯示區域的顯示 內容。 應用本申請案實施例所提供的技術方案，能夠簡化相 關搜尋操作’用戶可以在搜尋關鍵字及其相關詞的搜尋結 果中自由切換，以便更快捷地找到滿意的搜尋結果，提高 搜尋效率。同時，對於系統側而言，也可以有效減少需要 處理的搜尋請求數量，減輕搜尋伺服器的負擔。 【實施方式】 通過對現有相關搜尋技術的硏究，發明人發現導致前 述現有技術問題的原因如下： 201128416 目前，在相關搜尋的內部實現方面，儘管已經存在多 種處理相關詞的演算法，但是使用這些演算法所得到的相 關詞計算結果中，各個詞語之間的“相關”並不保證具有對 稱性和傳遞性。舉例說明，如果輸入關鍵字A，系統可以 計算出A的相關詞包括A ]、A2、A3……並顯示給用戶， 那麼，不具有對稱性是指··如果輸入關鍵字A1，系統所 計算出的A 1的相關詞不一定包括A ;不具有傳遞性是指 :如果輸入關鍵字A 1，系統所計算出的A 1的相關詞不一 定包括A2或A3。 特別是，在實際使用過程中，受頁面顯示空間的限制 ，在計算出一組相關詞之後，系統首先會按照一定的規則 對所有相關詞進行排序，然後僅將排序靠前的幾個相關詞 顯示給用戶。這就進一步減小了用戶看到原始關鍵字或原 始關鍵字的其他相關詞的可能。仍以上面的例子進行說明 :當用戶輸入關鍵字A1時，即便系統所計算出的A1的 相關詞中包括了 A、A2或A3,也可能因爲其中的一個或 多個詞的排序分値較低而不將其顯示給用戶。 根據現有的相關搜尋實現方法，用戶一旦點擊了相關 詞，相當於以該相關詞爲關鍵字進行一次新的搜尋。仍以 上面的例子進行說明：用戶使用關鍵字A進行搜尋後， 根據系統提供的相關詞，選擇A 1再次進行搜尋，此時， 如果用戶對於以A 1爲關鍵字的搜尋結果不滿意，希望返 回以A爲關鍵字的搜尋結果時，則只能重新輸入關鍵字A (假設系統所計算出的A 1的相關詞不包括A)進行搜尋 201128416 ，不僅搜尋效率低下，而且爲用戶帶來操作上的麻煩。 另一方面，考慮到用戶實際上並不會去記憶A2、A3 等其他A的相關詞的具體形式，因此’如果用戶在看到 以A 1爲關鍵字的搜尋結果後，希望看到以A的其他相關 詞爲關鍵字的搜尋結果，則需要重新輸入關鍵字A進行 搜尋，再選擇A的其他相關詞，在實際操作上將非常複 雜，而且重複的搜尋操作也會爲搜尋伺服器造成很大的負 擔。 爲解決以上問題，本申請案提供一種搜尋結果產生方 法，參見圖1所示，包括以下步驟： s 1 〇 1，資訊搜尋系統接收搜尋關鍵字A ; S 1 02，利用關鍵字A進行搜尋並獲得該關鍵字A的 相關詞； S103，在第一區域顯示該關鍵字A的匹配資訊、在 第二區域顯示該關鍵字A和該關鍵字A的至少一個相關 詞；標識該關鍵字A ; S104，當用戶選擇該關鍵字A的某個相關詞A1後， 在第一區域顯示該相關詞A1的匹配資訊、維持第二顯示 區域的顯示內容並在第二顯示區域中標識該相關詞A1。 其中’根據搜尋關鍵字計算其相關詞的方法，現有技 術中已經有多種實現方式，例如以原關鍵字爲詞根或詞綴 進行擴展、或者查詢用戶的搜尋歷史記錄，找出與原關鍵 字共現度較高的詞等等。爲了便於用戶選擇，系統還會根 據一定的規則’選取與原關鍵字“相關度”最高的幾個詞（ 201128416 例如5個、10個）用於顯示輸出。需要說明的是，針對 不同的相關詞演算法與排序規則，其對於“相關度”的定義 也不盡相同，在本申請案的實施例中，並不需要關注得到 相關詞的具體演算法與排序規則。對於基於任何相關詞演 算法以及排序規則所實現的相關搜尋，均可以應用本申請 案技術方案以實現相應的技術效果。 現有技術中實現相關搜尋的方法是：當用戶選擇了關 鍵字A的某個的相關詞A1後，系統將以A1爲關鍵字重 新進行搜尋，同時重新計算A1的相關詞，此時用戶可能 已經無法在A 1的搜尋結果中找到A，帶來操作上的麻煩 。而在本申請案實施例中，用戶選擇了關鍵字A的某個 的相關詞A 1後，系統僅改變相應的搜尋結果（第一區域 )，而維持原先顯示的關鍵字A和A的相關詞內容不變 ’只對A 1進行標識，表示A1爲當前所選擇的搜尋關鍵 字。該標識是指對當前進行搜尋的關鍵字進行突出顯示， 如採用下劃線、黑體字或高亮狀態等形式對關鍵字進行突 出顯示。這樣，當用戶希望返回 A的搜尋結果，或者希 望查看其他相關詞的搜尋結果時，可以在不改變當前顯示 頁面的情況下，方便地進行切換。而且，由於一般的流覽 器都具有本地快取功能，因此，在不改變當前顯示頁面的 情況下切換回之前的搜尋結果，也無需向伺服器端重複提 交搜尋請求，從而減輕了搜尋伺服器的負擔。 下面將結合幾個具體的應用實例，對本申請案所提供 的搜尋結果產生方法進行說明。 -10- 201128416 實施例一： 假設用戶以“西湖”爲關鍵字進行搜尋’系統根據一定 的演算法及排序規則，得到與“西湖”的相關度最高的5個 詞分別爲“西湖地圖，，、“西湖詩句”、“西湖美景”、“西湖 十景，，、“西湖門票”，則系統針對“西湖”這一搜尋請求， 主要將做兩方面的輸出顯示： 1 )在搜尋結果顯示區域，顯示與“西湖”對應的匹配 搜尋結果； 2 )在相關詞顯示區域，顯示“西湖”以及上述5個相 關詞。 如圖2所示，區域1 00爲搜尋結果顯示區域（圖2僅 用於示意性說明，其中並未包含所有的搜尋結果）、區域 200爲相關詞顯示區域。需要注意的是，在區域2〇〇中顯 示的“所有結果”，實際上即對應“西湖”這一關鍵字，而區 域200上面的搜尋框中已經顯示出了當前的搜尋關鍵字“ 西湖”，因此，這裏顯示“所有結果”其實質作用即相當於 顯示“西湖”。當然，本領域技術人員也可以對此處的顯示 做其他形式的修改，例如顯示“全部結果”等等，本申請案 實施例對此不需進行限定。 在本實施例中，相關詞顯示區域位於搜尋結果顯示區 域的上方，在搜尋結果顯示區域，關鍵字與每個相關詞以 Tab (標籤）的形式並列顯示。由圖2可以看出，在相關 詞顯示區域200中，“所有結果”的標籤以高亮狀態標識， -11 - 201128416 其顯示外觀區別於其他幾個相關詞的標籤 的是原始關鍵字“西湖”的搜尋結果。當用 相關詞的搜尋結果時，可以通過點擊對應 關詞，例如，用戶點擊了 “西湖美景”，則 3所示搜尋結果。 在圖3中，搜尋結果顯示區域100中 了與“西湖美景”相對應的匹配搜尋結果， 區域200中顯示的詞語沒有發生改變，只 標籤以高亮狀態標識（同時清除“所有結I 態），表明當前顯示的是該詞的搜尋結果 戶希望返回“西湖”的搜尋結果，或者希望 、“西湖詩句”等其他相關詞的搜尋結果， 各個標籤，方便地實現對關鍵字及相關詞 杳看。較佳的是，系統可以對“西湖美景” 保存，結果可以存放在伺服器端，也可以 這樣，當用戶選擇了其他的相關詞之後， 西湖美景”的搜尋結果時，可以直接顯示 尋結果，避免重複進行搜尋操作。 實施例二： 上述的實施例一，與現有的相關搜尋 在於：當用戶選擇某一個相關詞後，保持 域的內容不變，以便用戶能夠方便地在原 相關詞的搜尋結果之間進行切換。但是， ，表明當前顯示 戶希望查看某個 的標籤來選擇相 系統將產生如圖 顯示的內容變成 但是相關詞顯示 是對“西湖美景” I ”標籤的高亮狀 。此時，如果用 轉到“西湖地圖” 則可以通過點擊 搜尋結果的切換 的搜尋結果予以 存放在用戶端。 需要再次查看“ 之前所保存的搜 實現方法的區別 在相關詞顯不區 關鍵字及其各個 在某些情況下， -12- 201128416 用戶可能確實希望看到某個相關詞的相關詞，以便進一步 搜尋。針對這一用戶需求，本實施例在前述技術方案的基 礎上，提出如下改進方案： 當用戶選擇該關鍵字A的某個的相關詞A1後，計算 得到A 1的相關詞；然後在維持原相關詞顯示區域200顯 示內容不變的情況下，在相關詞顯示區域200進一步顯示 A 1的至少一個相關詞。 仍以實施例一中的例子進行說明，當用戶在圖2所示 搜尋結果的基礎上，進一步點擊了“西湖美景，，標籤之後， 系統除了完成： 1)將搜尋結果顯示區域100中顯示的內容變成“西湖 美景”的搜尋結果； 2 )將“西湖美景”標籤以高亮狀態標識。 之外’還需要進一步計算“西湖美景，，的相關詞，這裏 仍然不考慮具體的演算法及排列規則，假設得到與“西湖 美景”的相關度最高的4個詞分別爲“西湖美景圖片”、“西 湖十大美景”、“西湖美景介紹”、“西湖美景三月天”。 爲描述方便’以下對於“西湖地圖”、“西湖詩句”、“ 西湖美景”、“西湖十景”、“西湖門票”5個詞稱爲原始關鍵 字“西湖”的一級相關詞，而對於4個“西湖美景，，的相關詞 ’稱爲原始關鍵字“西湖”的二級相關詞。可以理解的是， 根據相關詞具體演算法的不同，一個關鍵字的二級（或二 級以上）相關詞也可能是其本身。而本申請案方案的實現 ’與具體的相關詞演算法無關，這裏所定義的“ 一級’，'“ -13- 201128416 二級”……僅表示詞與詞之間的相對關係。 當用戶選擇一級相關詞“西湖美景”之後’系統需要將 4個“西湖美景”的相關詞進一步顯示在相關詞顯示區域 200，同時還應該與“西湖地圖”、“西湖詩句”等其他“西湖 ”的一級相關詞區分開來。這裏可以採用的一種方法是擴 展顯示，例如，以“西湖美景”標籤爲基礎’創建一個擴展 功能表，在功能表中顯示4個“西湖美景”的相關詞，如圖 4所示。 進一步地，用戶就可以直接選擇某個二級相關詞進行 搜尋，相應地，系統將在搜尋結果顯示區域1 00中顯示該 二級相關詞所對應的搜尋結果。而此時相關詞顯示區域 2 00中顯示的內容包括：原始關鍵字、原始關鍵字的所有 一級相關詞、以及以擴展功能表形式顯示的“西湖美景”的 相關詞。其中，對於用戶本次所選擇的二級相關詞’也應 該予以標識，以便與其他二級相關詞區分開來。 較佳的是，系統還可以對“西湖美景”的相關詞計算結 果予以保存，結果可以存放在伺服器端’也可以存放在用 戶端。這樣，用戶選擇了其他的一級相關詞之後，又再次 選擇了 “西湖美景”，系統就可以直接顯示之前所保存的相 關詞計算結果’避免重複進行相關詞計算操作。 本實施例充分考慮到了一部分用戶需要進行二次相關 搜尋的需求，在實施例—的基礎上進行了改進，使用戶可 以在不改變當前顯示頁面的情況下’方便地在原始關鍵字 、一級相關詞、二級相關詞的搜尋結果之間進行切換。 -14- 201128416 實施例三： 在前面的實施例中，原始關鍵字與其相關詞都是以並 列的方式進行顯示，而根據實施例二的分析可知’詞與言司 之間是可以建立起一定的分級關係的，根據這種關係’可 以將關鍵字與其相關詞以樹形的結構進行顯示。 如圖5所示，原始的關鍵字“西湖”作爲樹形結構的根 節點，一級相關詞“西湖地圖”、“西湖詩句”、“西湖美景” 、“西湖十景”、“西湖門票”作爲根節點“西湖”的分支節點 、而二級相關詞“西湖美景.圖片”、“西湖十大美景”、“西 湖美景介紹”、“西湖美景三月天”作爲“西湖美景”的分支 節點。 可見，這種結構，能夠將各個詞之間的相關關係更爲 清晰地表現出來，用戶可以很方便地在原始關鍵字、一級 相關詞、二級相關詞的搜尋結果之間進行切換。如果有需 要的話，還可以進一步進行三級、四級……搜尋操作，每 一級的相關詞計算結果只需以分支節點的形式添加至原始 的樹形結構中即可。 根據樹形結構的特點，在實際顯示輸出時，可以將相 關詞顯示區域置於搜尋結果顯示區域的左側。用戶還可以 根據實際的需求，對任意一個分支進行展開或收起。較佳 的是，當用戶首次使用原始關鍵字A進行搜尋時，在相 關詞顯示區域中，僅顯示該相關詞A。當用戶點擊選擇該 相關詞A時，說明用戶有相關搜尋的需求，此時系統再 •15- 201128416 進行相關詞的計算即排序’得到A的至少一個相關詞， 例如A 1〜A 5，同時在相關詞顯示區域中，以A的分支形 式顯示A1-A5。對於A1〜A5，也可以採用同樣的相關詞 計算觸發機制，這樣做的好處是：避免系統在用戶沒有相 關搜尋需求的時候，進行無意義的相關詞計算，降低搜尋 伺服器的負擔。 與實施例一及實施例二類似的是，當用戶選擇過某一 個分支節點後，系統也可以對該分支節點對應的搜尋結果 以及相關詞計算結果進行保存，以避免系統重複進行搜尋 操作以及相關詞計算操作。 需要說明的是，上述幾個實施例中，對於相關詞的具 體計算方法都沒有具體進行限定。然而，結合本申請案所 提供的搜尋結果產生方法，較佳的計算相關詞的方法應該 是擴展計算法。使用擴展計算法所計算出的相關詞中，都 包含有原關鍵字，計算得到的相關詞稱之爲擴展相關詞。 例如，在西湖的相關詞“西湖地圖”、“西湖詩句”、“西湖 美景”、“西湖十景” '“西湖門票”都是“西湖”的擴展相關 詞，而“杭州”就不屬於“西湖”的擴展相關詞。 在實際的計算過程中，可以將原關鍵字作爲詞根或詞 綴，擴展得到新的相關詞，也可以首先用分詞法對原關鍵 字進行拆分，增加新的部分之後再重新組合，得到新的相 關詞’例如“西湖美景西湖十大美景”。 相應地，在搜尋結果方面，每個擴展相關詞的匹配資 訊的集合，實際上相當於關鍵字的匹配資訊的集合的子集 -16- 201128416 。也就是說，應用擴展法計算得到的相關詞，用戶每次選 擇相關詞的時候，都相當於對當前搜尋結果的細化搜尋。 這樣可以降低相關搜尋時需要處理的資料量，從而提高搜 尋的速度。從樹形結構的角度來看，每個分支節點所對應 的匹配資訊都是其父節點所對應匹配資訊的細化，也可以 避免樹形結構中出現重複節點，使得樹形結構更爲合理。 當然，在實際應用時，也可以更爲靈活地使用擴展計 算法，例如，在計算一級相關詞時，可以採用任意的計算 方法，使得用戶能夠看到更爲全面的一級相關詞；而從計 算二級相關詞開始，再採用擴展計算法，以實現細化搜尋 結果的效果。 相應於上面的方法實施例，本申請案還提供一種資訊 搜尋系統，參見圖6所示，包括： 搜尋單元610，用於接收搜尋關鍵字A ; 第一區域處理單元620，用於在第一區域顯示該關鍵 字A的匹配資訊、 第二區域處理單元63 0，用於在第二區域顯示該關鍵 字A和該關鍵字A的至少一個相關詞；標識該關鍵字A » 當用戶選擇該關鍵字A的某個相關詞A1後， 該第一區域處理單元620，用於在第一區域顯示該相 關詞A1的匹配資訊、 該第二區域處理單元630，用於維持第二顯示區域的 顯示內容並在第二顯示區域中標識該相關詞A 1。 -17- 201128416 其中，該第二區域處理單元，可以用於將該關鍵字A 和該關鍵字A的相關詞並列顯示；還可以用於將該關鍵 字A和該關鍵字A的相關詞以樹形結構顯示，其中，該 關鍵字A的相關詞爲該關鍵字A的分支。 參見圖7所示，該第二區域處理單元630，具體可以 包括： 關鍵字顯示子單元631，用於在第二區域顯示該關鍵 字A ; 第一相關詞計算子單元6 3 2，用於當用戶在第二區域 選擇該關鍵字A時，計算得到A的相關詞； 第一相關詞顯示子單元63 3，用於在第二區域以A的 分支形式顯示該A的至少一個相關詞。 該第二區域處理單元，還可以包括： 第二相關詞計算子單元634，用於當用戶選擇該關鍵 字A的某個的相關詞A 1後，計算得到A 1的相關詞； 第二相關詞顯示子單元63 5，用於在第二區域進一步 顯示A1的至少一個相關詞。 其中，該第二相關詞顯示子單元635，可以用於創建 A1的擴展功能表，在該擴展功能表中顯示A1的至少一個 相關詞，也可以，用於將該A1的關鍵字作爲A1的分支 顯示。 爲了描述的方便，描述以上裝置時以功能分爲各種單 元分別描述。當然，在實施本申請案時可以把各單元的功 能在同一個或多個軟體和/或硬體中實現。 -18- 201128416 通過以上的實施方式的描述可知，本領域的技術人員 可以清楚地瞭解到本申請案可借助軟體加必需的通用硬體 平臺的方式來實現。基於這樣的理解，本申請案的技術方 案本質上或者說對現有技術做出貢獻的部分可以以軟體產 品的形式體現出來，該電腦軟體產品可以儲存在儲存介質 中，如ROM/RAM、磁碟、光碟等，包括若干指令用以使 得一台電腦設備（可以是個人電腦，伺服器，或者網路設 備等）執行本申請案各個實施例或者實施例的某些部分該 方法。 本說明書中的各個實施例均採用遞進的方式描述，各 個實施例之間相同相似的部分互相參見即可，每個實施例 重點說明的都是與其他實施例的不同之處。尤其，對於裝 置實施例而言，由於其基本相似於方法實施例，所以描述 得比較簡單，相關之處參見方法實施例的部分說明即可。 以上所描述的裝置實施例僅僅是示意性的，其中該作爲分 離部件說明的單元可以是或者也可以不是物理上分開的， 作爲單元顯示的部件可以是或者也可以不是物理單元，即 可以位於一個地方，或者也可以分佈到多個網路單元上。 可以根據實際的需要選擇其中的部分或者全部模組來實現 本實施例方案的目的》本領域普通技術人員在不付出創造 性勞動的情況下，即可以理解並實施。 本申請案可用於眾多通用或專用的計算系統環境或配 置中。例如：個人電腦、伺服器電腦、手持設備或可檇式 設備、平板型設備、多處理器系統、基於微處理器的系統 -19- 201128416 、置頂盒、可編程的消費電子設備、網路p c、小型電腦 、大型電腦、包括以上任何系統或設備的分散式計算環境 等等。 本申請案可以在由電腦執行的電腦可執行指令的一般 上下文中描述，例如程式模組。一般地，程式模組包括執 行特定任務或實現特定抽象資料類型的常式、程式、物件 、元件 '資料結構等等。也可以在分散式計算環境中實踐 本申請案，在這些分散式計算環境中，由通過通信網路而 被連接的遠端處理設備來執行任務。在分散式計算環境中 ，程式模組可以位於包括儲存設備在內的本地和遠端電腦 儲存介質中。 以上所述僅是本申請案的具體實施方式，應當指出， 對於本技術領域的普通技術人員來說，在不脫離本申請案 原理的前提下，還可以做出若干改進和潤飾，這些改進和 潤飾也應視爲本申請案的保護範圍。 【圖式簡單說明】 爲了更清楚地說明本申請案實施例或現有技術中的技 術方案，下面將對實施例或現有技術描述中所需要使用的 附圖作簡單地介紹，顯而易見地，下面描述中的附圖僅僅 是本申請案中記載的一些實施例，對於本領域普通技術人 員來講，在不付出創造性勞動的前提下，還可以根據這些 附圖獲得其他的附圖。 圖1爲本申請案實施例一種搜尋結果產生方法的流程 -20- 201128416 圖； 圖2爲本申請案實施例所產生的搜尋結果的第一種示 意圖> 圖3爲本申請案實施例所產生的搜尋結果的第二種示 杳回 ♦ 恵圖》 圖4爲本申請案實施例所產生的搜尋結果的第三種示 回 · 思圖， 圖5爲本申請案實施例三中的關鍵字與相關詞的樹形 結構示意圖； 圖6爲本申請案實施例的資訊搜尋系統的結構示;* ® » 圖7爲本申請案實施例的第二區域處理單元的結 意圖。 【主要元件符號說明】 1 0 0 .顯不區域 200 :區域 610 :搜尋單元 620:第一區域處理單元 63 0 :第二區域處理單元 631:關鍵字顯示子單元 63 2 :第一相關詞計算子單元 63 3 :第一相關詞顯示子單元 63 4 :第二相關詞計算子單元 -21 - 201128416 63 5 ： 第二相關詞顯示子單元 -22-201128416 VI. Description of the Invention: [Technical Field] The present application relates to the field of computer application technology, and more particularly to a search result generation method and an information search system. [Prior Art] The information search system is a system that can provide users with information retrieval services. Taking the search engine commonly used in the Internet as an example, as a search system applied in the Internet domain, the search engine has become a must for users to access the Internet. One of the essential tools. From the user's point of view, the search engine generally provides an interface containing a search box. The user searches for the search keyword in the search box and submits it to the search engine through the browser. The search engine returns the keyword entered by the user. Information that matches the content. In practical applications, the user has a large subjective randomness for the selection of search keywords. Therefore, when the keywords selected by the user are not appropriate, the search results are often not satisfactory. In order to solve this problem, many search engines have provided the function of "related search". The basic implementation method is: after receiving the keyword input by the user, the search engine finds a certain number of words related to the keyword according to a certain algorithm, and then returns the keyword matching information, and also relates these. The word is provided to the user. When the user clicks on these related words, the search engine performs another search operation with the related words clicked by the user as keywords. Through the study of the prior art, the inventor found that in the actual use of the relevant search, many users often only tentatively click on a related word 201128416 to search, when the result of searching using related words is not satisfied' The user may wish to return to the search results of the original keyword or search using other related words of the original keyword. However, at this time, the user will find that: the original keyword (or other related words of the original keyword) is not among the related words of the current keyword, so the original keyword needs to be re-typed and the search is re-executed, resulting in a decrease in search efficiency. And the user's repeated search operation will also impose a great burden on the search server. Although the user can achieve similar purposes by using the "return" function of the browser, but considering that the user may perform a page turning operation while viewing the relevant search results, or even perform a second related search, it is required The "return" operation is used multiple times to retrieve the previous search results, which is not only cumbersome, but also has low search efficiency. SUMMARY OF THE INVENTION In order to solve the above technical problem, the embodiment of the present application provides a search result generation method and an information search system, so as to simplify user related search operations, improve search efficiency, and reduce the burden on the search server, the technical solutions are as follows: The embodiment of the present application provides a search result generating method, including: the information search system receives the search keyword A; searches for the keyword A and obtains the related word of the keyword A; and displays the keyword A in the first area. Matching information, displaying the keyword A and at least one related word of the keyword A in the second area; -6- 201128416 When the user selects a related word A1 of the keyword A, the related word is displayed in the ~ region The matching information of A1 maintains the display content of the second display area. The embodiment of the present application further provides an information searching system, including: a searching unit, configured to receive a search keyword A; use the keyword a to search for and obtain related words of the keyword A; and a first area processing unit, configured to: Displaying, in the first area, matching information of the keyword A, a second area processing unit, configured to display the keyword A and at least one related word of the keyword A in the second area; when the user selects the keyword A After the related word A1, the first area processing unit is configured to display the matching information of the related word A 1 in the first area, and the second area processing unit is configured to maintain the display content of the second display area. By applying the technical solution provided by the embodiment of the present application, the related search operation can be simplified. The user can freely switch between the search results of the search keyword and its related words, so as to find the satisfactory search result more quickly and improve the search efficiency. At the same time, for the system side, it is also possible to effectively reduce the number of search requests that need to be processed, and reduce the burden on the search server. [Embodiment] By investigating existing related search techniques, the inventors have found that the causes of the aforementioned prior art problems are as follows: 201128416 At present, in the internal implementation of related searches, although there are already many algorithms for processing related words, they are used. In the calculation results of related words obtained by these algorithms, the "correlation" between the various words does not guarantee symmetry and transitivity. For example, if the keyword A is input, the system can calculate that the related words of A include A], A2, A3, ... and display them to the user. Then, if there is no symmetry, it means that if the keyword A1 is input, the system calculates The related words of A 1 do not necessarily include A; the non-transitive means that if the keyword A 1 is input, the related words of A 1 calculated by the system do not necessarily include A2 or A3. In particular, in actual use, due to the limitation of the page display space, after calculating a set of related words, the system first sorts all related words according to certain rules, and then only sorts the related words in the top. Displayed to the user. This further reduces the likelihood that the user will see the original keyword or other related words of the original keyword. Still using the above example to illustrate: when the user enters the keyword A1, even if the system calculates the A1 related words including A, A2 or A3, it may be because one or more of the words are sorted. Low without displaying it to the user. According to the existing related search implementation method, once the user clicks on the related word, it is equivalent to performing a new search by using the related word as a keyword. Still using the above example to illustrate: after the user searches by keyword A, according to the related words provided by the system, select A 1 to search again. At this time, if the user is not satisfied with the search result with A 1 as a keyword, hope When returning the search result with A as the keyword, you can only re-enter the keyword A (assuming that the related words of A 1 calculated by the system do not include A) to search 201128416, which not only searches inefficiently, but also brings operation to the user. The trouble. On the other hand, considering that the user does not actually remember the specific form of the related words of A2, A3, etc., so if the user sees the search result with A1 as the keyword, he wants to see A. The other related words are keyword search results, you need to re-enter keyword A to search, and then select other related words of A, the actual operation will be very complicated, and the repeated search operation will also cause very much for the search server. Big burden. To solve the above problem, the present application provides a method for generating a search result. As shown in FIG. 1, the method includes the following steps: s 1 〇1, the information search system receives the search keyword A; S 1 02, searches by using the keyword A. Obtaining a related word of the keyword A; S103, displaying matching information of the keyword A in the first area, displaying the keyword A and at least one related word of the keyword A in the second area; identifying the keyword A; S104. After the user selects a related word A1 of the keyword A, the matching information of the related word A1 is displayed in the first area, the display content of the second display area is maintained, and the related word A1 is identified in the second display area. . There are various implementation methods in the prior art, such as expanding the original keyword as a root or an affix, or querying the user's search history to find out that the original keyword is co-occurring. Higher words and so on. In order to facilitate the user's choice, the system will also select the words with the highest relevance (original degree) (201128416, for example, 5, 10) according to certain rules' for display output. It should be noted that, for different related word algorithms and sorting rules, the definition of “correlation degree” is also different. In the embodiment of the present application, it is not necessary to pay attention to obtaining a specific algorithm of related words and Sorting rules. For the related search based on any related word algorithm and collation, the technical solution of the present application can be applied to achieve the corresponding technical effect. The method for implementing the related search in the prior art is: after the user selects a certain related word A1 of the keyword A, the system will re-search with A1 as a keyword, and recalculate the related words of A1, at which time the user may have already Unable to find A in the search result of A 1 brings trouble in operation. In the embodiment of the present application, after the user selects a certain related word A 1 of the keyword A, the system only changes the corresponding search result (the first region), and maintains the correlation between the originally displayed keywords A and A. The word content is unchanged 'only A 1 is identified, indicating that A1 is the currently selected search key. The identifier is to highlight the keyword currently being searched, such as underline, boldface or highlighting. Thus, when the user wishes to return the search result of A, or wants to view the search results of other related words, it is convenient to switch without changing the currently displayed page. Moreover, since the general browser has a local cache function, switching back to the previous search result without changing the current display page, and eliminating the need to repeatedly submit a search request to the server side, thereby reducing the search server. The burden. The search result generation method provided in the present application will be described below in combination with several specific application examples. -10- 201128416 Example 1: Assume that the user searches for “West Lake” as the key word. According to certain algorithms and sorting rules, the five words with the highest correlation with “West Lake” are “West Lake Map,” , "West Lake Poetry", "West Lake Beauty", "West Lake Ten Scenes,", "West Lake Tickets", the system for the "West Lake" search request, mainly to do two aspects of the output display: 1) in the search results display area , showing the matching search result corresponding to "West Lake"; 2) displaying "West Lake" and the above five related words in the related word display area. As shown in Fig. 2, the area 100 is a search result display area (Fig. 2 is for illustrative purposes only, and does not include all search results), and the area 200 is a related word display area. It should be noted that the “all results” displayed in the area 2〇〇 actually correspond to the keyword “West Lake”, and the search box above the area 200 has already displayed the current search keyword “West Lake”. Therefore, the "all results" shown here have the essential effect of displaying "West Lake". Of course, those skilled in the art can also make other forms of modification to the display here, such as displaying "all results" and the like, and the embodiment of the present application does not need to be limited thereto. In this embodiment, the related word display area is located above the search result display area, and in the search result display area, the keyword and each related word are displayed side by side in the form of a Tab. As can be seen from FIG. 2, in the related word display area 200, the label of "all results" is highlighted, -11 - 201128416. The label whose appearance is different from the other related words is the original keyword "West Lake" "Search results." When using the search results of related words, you can click on the corresponding words, for example, the user clicks on "West Lake View", and the search results are shown in 3. In FIG. 3, in the search result display area 100, the matching search result corresponding to "West Lake Scenery" is displayed, and the words displayed in the area 200 are not changed, and only the label is highlighted (and all the states are cleared at the same time). , indicating that the current search result of the word is intended to return to the "West Lake" search results, or hopes, "West Lake Poetry" and other related words search results, each label, easy to achieve the keyword and related words Preferably, the system can save the "West Lake View", and the result can be stored on the server side. Alternatively, when the user selects other related words, the search result of the West Lake View can directly display the search result. To avoid repeated search operations. Embodiment 2: In the first embodiment, the related search is as follows: after the user selects a related word, the content of the domain remains unchanged, so that the user can conveniently switch between the search results of the original related words. However, it indicates that the current display user wants to view a certain label to select the phase system will produce the content as shown in the figure but the related word display is the highlight of the "West Lake View" I ” label. At this time, if you use the go “West Lake Map” can be stored on the user side by clicking the search result of the search result. You need to check again. “The difference between the previously saved search implementation methods in the related words and their keywords in some cases. , -12- 201128416 Users may indeed want to see related words for a related word for further searching. In response to the needs of the user, the present embodiment proposes the following improvement on the basis of the foregoing technical solutions: After the user selects a certain related word A1 of the keyword A, the related word of A 1 is calculated; In the case where the related word display area 200 does not change the content, at least one related word of A 1 is further displayed in the related word display area 200. Still speaking, the example in the first embodiment is used. When the user further clicks on the "West Lake view, after the label, the system is completed: 1), the search result display area 100 is displayed. The content becomes the search results of “West Lake Beauty”; 2) The “West Lake Beauty” label is highlighted. In addition, “there is a need to further calculate the relevant words of West Lake,” and the specific algorithms and arrangements are still not considered here. The rules, suppose that the four words with the highest correlation with the "West Lake Scenery" are "West Lake Scenic Pictures", "West Lake Top Ten Beauty", "West Lake Beauty Introduction", "West Lake Beauty March Day". For the convenience of description, the following five words related to "West Lake Map", "West Lake Poetry", "West Lake Scenery", "West Lake Ten Scenes" and "West Lake Tickets" are called the first-level related words of the original keyword "West Lake", but for 4 The "West Lake Beauty, the related words" is called the second-level related words of the original keyword "West Lake." It can be understood that, according to the specific algorithm of the relevant words, the second level (or above) of a keyword. The related words may also be their own. The implementation of the solution of this application has nothing to do with the specific related word algorithm. The “level one”, “-13-201128416 level two” defined here... only represents words and words. The relative relationship between the two. After the user selects the first-level related word “West Lake View”, the system needs to display the related words of the four “West Lake Views” in the related word display area 200, and also should be related to “West Lake Map”, “West Lake Poetry” and other “West Lake”. The first-level related words are distinguished. One method that can be used here is to expand the display. For example, based on the “West Lake View” tab, create an extended function table and display the related words of the four “West Lake Views” in the function table, as shown in Figure 4. Further, the user can directly select a second-level related word to search, and accordingly, the system displays the search result corresponding to the second-level related word in the search result display area 100. At this time, the content displayed in the related word display area 200 includes: the original keyword, all the first-level related words of the original keyword, and the related words of the "West Lake Scenery" displayed in the form of an extended function table. Among them, the second-level related words selected by the user this time should also be marked so as to be distinguished from other secondary related words. Preferably, the system can also save the results of the related words of "West Lake View", and the result can be stored on the server side or stored on the user side. In this way, after the user selects other first-level related words, and then selects “West Lake Beauty” again, the system can directly display the previously saved related word calculation results' to avoid repeated calculation of related words. This embodiment fully considers the need for a part of users to perform secondary correlation search, and improves on the basis of the embodiment, so that the user can conveniently 'in the original keyword, the first level correlation without changing the current display page. Switch between search results for words and secondary related words. -14-201128416 Embodiment 3: In the foregoing embodiment, the original keyword and its related words are displayed in a side by side manner, and according to the analysis of the second embodiment, it can be known that the word between the word and the word can be established. According to this relationship, the keyword and its related words can be displayed in a tree structure. As shown in Figure 5, the original keyword "West Lake" is the root node of the tree structure, and the first-level related words "West Lake Map", "West Lake Poetry", "West Lake Scenery", "West Lake Ten Scenes", and "West Lake Tickets" are taken as The branch node of the root node "West Lake", and the secondary related words "West Lake Scenic. Picture", "West Lake Ten Great Scenery", "West Lake Beauty Introduction", "West Lake Beauty March Day" as the branch node of "West Lake Beauty". It can be seen that this structure can clearly express the correlation between the various words, and the user can conveniently switch between the search results of the original keyword, the first-level related word, and the second-level related word. If necessary, you can further perform the three-level, four-level... search operations, and the results of the related words at each level can be added to the original tree structure in the form of branch nodes. According to the characteristics of the tree structure, when the output is actually displayed, the related word display area can be placed on the left side of the search result display area. Users can also expand or collapse any branch according to actual needs. Preferably, when the user searches for the original keyword A for the first time, only the related word A is displayed in the related word display area. When the user clicks to select the related word A, it indicates that the user has the requirement of relevant search. At this time, the system performs the calculation of the related words, that is, the sorting 'gets at least one related word of A, for example, A 1~A 5 , at the same time, In the related word display area, A1-A5 is displayed in the form of a branch of A. For A1~A5, the same related words can also be used to calculate the trigger mechanism. The advantage of this is to avoid the system from calculating meaningless related words when the user has no relevant search requirements, and reducing the burden on the search server. Similar to the first embodiment and the second embodiment, after the user selects a certain branch node, the system may also save the search result corresponding to the branch node and the calculation result of the related word to avoid the system repeatedly performing the search operation and related. Word calculation operation. It should be noted that, in the above several embodiments, the specific calculation methods of related words are not specifically limited. However, in conjunction with the search result generation method provided by the present application, the preferred method for calculating related words should be an extended calculation method. The relevant words calculated by the extended calculation method contain the original keywords, and the calculated related words are called extended related words. For example, the related words "West Lake Map", "West Lake Poetry", "West Lake Scenery", "West Lake Ten Scenes" and "West Lake Tickets" in West Lake are all related words of "West Lake", while "Hangzhou" does not belong to " The extension of the West Lake. In the actual calculation process, the original keyword can be extended as a root or affix to obtain a new related word. Alternatively, the original keyword can be split by the word segmentation method, and the new part is added and then recombined to obtain a new one. Related words 'such as "West Lake Ten Wonders of the West Lake". Accordingly, in terms of search results, the set of matching information for each extended related word is actually equivalent to a subset of the set of matching information for the keyword -16-201128416. That is to say, the relevant words calculated by the application expansion method are equivalent to the detailed search for the current search results each time the user selects the related words. This will reduce the amount of data that needs to be processed during the relevant search, thus increasing the speed of the search. From the perspective of the tree structure, the matching information corresponding to each branch node is the refinement of the matching information corresponding to its parent node, and the repeated nodes in the tree structure can be avoided, which makes the tree structure more reasonable. Of course, in practical applications, the extended calculation method can also be used more flexibly. For example, when calculating the first-level related words, any calculation method can be adopted, so that the user can see a more comprehensive first-level related word; Start with the second-level related words and then use the extended calculation method to achieve the effect of refining the search results. Corresponding to the above method embodiment, the application further provides an information searching system, as shown in FIG. 6, comprising: a searching unit 610, configured to receive a search keyword A; a first area processing unit 620, configured to be in the first The area displays the matching information of the keyword A, and the second area processing unit 63 0 is configured to display the keyword A and at least one related word of the keyword A in the second area; identify the keyword A » when the user selects the After the related word A1 of the keyword A, the first area processing unit 620 is configured to display the matching information of the related word A1 in the first area, and the second area processing unit 630 is configured to maintain the second display area. The content is displayed and the related word A 1 is identified in the second display area. -17- 201128416 The second area processing unit may be configured to display the keyword A and the related words of the keyword A in parallel; and may also be used to use the keyword A and the related words of the keyword A The tree structure shows that the related word of the keyword A is the branch of the keyword A. Referring to FIG. 7, the second area processing unit 630 may specifically include: a keyword display subunit 631 for displaying the keyword A in the second area; and a first related word calculation subunit 6 3 2 for When the user selects the keyword A in the second region, the related word of A is calculated; the first related word display sub-unit 63 3 is configured to display at least one related word of the A in the branch form of A in the second region. The second area processing unit may further include: a second related word calculation sub-unit 634, configured to: after the user selects a certain related word A1 of the keyword A, calculate a related word of A1; The word display sub-unit 63 5 is for further displaying at least one related word of A1 in the second area. The second related word display sub-unit 635 can be used to create an extended function table of A1, and display at least one related word of A1 in the extended function table, or can be used to use the keyword of A1 as A1. The branch is displayed. For the convenience of description, the above devices are described in terms of functions and are divided into various units for description. Of course, the functions of each unit can be implemented in the same software or software and/or hardware in the implementation of the present application. -18- 201128416 As apparent from the above description of the embodiments, those skilled in the art can clearly understand that the present application can be implemented by means of a software plus a necessary general hardware platform. Based on such understanding, the technical solution of the present application may be embodied in the form of a software product in essence or in the form of a software product, which may be stored in a storage medium such as a ROM/RAM or a disk. , a disc, etc., including instructions for causing a computer device (which may be a personal computer, server, or network device, etc.) to perform the method of various embodiments of the present application or portions of the embodiments. The various embodiments in the specification are described in a progressive manner, and the same or similar parts between the various embodiments may be referred to each other, and each embodiment focuses on differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment. The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, ie may be located in one Places, or they can be distributed to multiple network units. The purpose of the solution of the present embodiment can be achieved by selecting some or all of the modules according to actual needs. Those skilled in the art can understand and implement without any creative work. This application can be used in a variety of general purpose or special purpose computing system environments or configurations. For example: PC, server computer, handheld or portable device, tablet device, multiprocessor system, microprocessor based system-19-201128416, set-top box, programmable consumer electronics, network pc , small computers, large computers, decentralized computing environments including any of the above systems or devices, and so on. This application can be described in the general context of computer-executable instructions executed by a computer, such as a program module. Generally, program modules include routines, programs, objects, component 'data structures, and the like that perform specific tasks or implement specific abstract data types. The present application can also be practiced in a decentralized computing environment where tasks are performed by remote processing devices that are connected through a communications network. In a decentralized computing environment, program modules can be located in both local and remote computer storage media, including storage devices. The above description is only a specific embodiment of the present application, and it should be noted that those skilled in the art can make some improvements and refinements without departing from the principle of the present application. Retouching should also be considered as the scope of protection of this application. BRIEF DESCRIPTION OF THE DRAWINGS In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the embodiments or the prior art description will be briefly described below. Obviously, the following description The drawings in the drawings are only some of the embodiments described in the present application, and those skilled in the art can obtain other drawings based on these drawings without any creative work. 1 is a flow chart of a method for generating search results according to an embodiment of the present application -20- 201128416; FIG. 2 is a first schematic diagram of search results generated by an embodiment of the present application. FIG. 3 is an embodiment of the present application. The second type of search results of the search results are shown in FIG. 4 . FIG. 4 is a third representation of the search results generated by the embodiment of the present application. FIG. 5 is a key point in the third embodiment of the present application. FIG. 6 is a schematic diagram showing the structure of an information search system according to an embodiment of the present application; FIG. 7 is a schematic diagram of a second area processing unit according to an embodiment of the present application. [Description of main component symbols] 1 0 0 . Display area 200 : Area 610 : Search unit 620 : First area processing unit 63 0 : Second area processing unit 631 : Key display sub-unit 63 2 : First related word calculation Sub-unit 63 3 : first related word display sub-unit 63 4 : second related word calculation sub-unit-21 - 201128416 63 5 : second related word display sub-unit-22-