n2-qln 3.3.4 → 3.4.1

package/.github/FUNDING.yml

@@ -0,0 +1,3 @@
+# QLN MCP — Funding configuration
+# This enables the 💖 Sponsor button on the GitHub repository
+github: [choihyunsus]

package/LICENSE

@@ -1,191 +1,53 @@
+# Dual License
 
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
+Copyright 2026 N2 (Hyunsoo Choi)
 
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+This software is licensed under a **dual license** model:
 
-   1. Definitions.
+## 1. Open Source License — Apache License 2.0
 
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
+For **non-commercial**, **personal**, **educational**, and **open-source** use,
+this software is licensed under the Apache License, Version 2.0.
 
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
+You may obtain a copy of the Apache License at:
+    http://www.apache.org/licenses/LICENSE-2.0
 
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
+The full text of the Apache License 2.0 is available in [LICENSE-APACHE](./LICENSE-APACHE).
 
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
+### What you CAN do under Apache 2.0:
+- Use in personal and educational projects
+- Use in open-source projects (non-commercial)
+- Modify and distribute (with attribution)
+- Study and learn from the code
 
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
+## 2. Commercial License
 
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
+For **commercial use** — including but not limited to:
+- Incorporating this software into commercial products or services
+- Using this software to generate revenue (directly or indirectly)
+- Deploying this software in a commercial/enterprise environment
+- Offering this software as part of a paid service (SaaS, PaaS, etc.)
 
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
+You **must** obtain a separate commercial license.
 
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
+### Contact for Commercial Licensing:
+- Email: lagi0730@gmail.com
+- GitHub: https://github.com/choihyunsus
 
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to the Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
+## Summary
 
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by the Licensor and
-      subsequently incorporated within the Work.
+| Use Case | License | Cost |
+|----------|---------|------|
+| Personal / Educational | Apache 2.0 | Free |
+| Open-source (non-commercial) | Apache 2.0 | Free |
+| Commercial / Enterprise | Commercial License | Contact us |
 
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
+## Disclaimer
 
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding any notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   Copyright 2026 N2
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/LICENSE-APACHE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by the Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding any notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 N2
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.ko.md

@@ -29,7 +29,9 @@
 
 🔍 **하나의 도구로 모든 것을** — AI는 `n2_qln_call` (~200 토큰)만 봅니다. 1,000개의 개별 도구가 아닙니다. 99.6% 컨텍스트 절감.
 
-⚡ **5ms 이하 검색** — 3단계 검색 엔진 (트리거 + 키워드 + 시맨틱)이 1,000개 이상의 도구에서도 5ms 이내에 최적 도구를 찾습니다.
+⚡ **5ms 이하 검색** — 3단계 검색 엔진 (트리거 + BM25 키워드 + 시맨틱)이 1,000개 이상의 도구에서도 5ms 이내에 최적 도구를 찾습니다.
+
+🎯 **BM25 키워드 랭킹** *(v3.4)* — Stage 2에 [Okapi BM25](https://en.wikipedia.org/wiki/Okapi_BM25) 알고리즘 적용. 희귀한 단어일수록 높은 점수, 문서 길이 정규화. Google, Elasticsearch, Wikipedia 검색의 핵심 알고리즘.
 
 📈 **자동 학습 랭킹** — 많이 사용되고 성공률이 높은 도구는 자동으로 상위에 랭크됩니다. 수동 튜닝 불필요.
 
@@ -184,14 +186,14 @@ QLN은 세 단계의 검색으로 적합한 도구를 찾습니다:
 | 단계 | 방식 | 속도 | 작동 원리 |
 |:---:|--------|:---:|---------|
 | **1** | 트리거 매칭 | ⚡ <1ms | 도구 이름과 트리거 키워드 정확 매칭 |
-| **2** | 키워드 검색 | ⚡ 1-3ms | 설명, 태그, 예제 전문 검색 |
+| **2** | BM25 키워드 | ⚡ 1-3ms | [Okapi BM25](https://en.wikipedia.org/wiki/Okapi_BM25) 랭킹 검색 — IDF 가중치 + 문서 길이 정규화 *(v3.4)* |
 | **3** | 시맨틱 검색 | 🧠 5-15ms | 임베딩 벡터 유사도 검색 *(선택, Ollama 필요)* |
 
 모든 단계의 결과를 병합 후 랭킹:
 
 ```
 final_score = trigger_score × 3.0
-            + keyword_score × 1.0
+            + bm25_keyword_score × 1.0
             + semantic_score × 2.0
             + log2(usage_count + 1) × 0.5
             + success_rate × 1.0
@@ -397,7 +399,7 @@ n2-qln/
 │   ├── schema.js       # 도구 스키마 정규화 + 검색 텍스트 빌더
 │   ├── validator.js    # 강제 검증 (이름, 설명, 카테고리)
 │   ├── registry.js     # 도구 CRUD + 사용량 추적 + 임베딩 캐시
-│   ├── router.js       # 3단계 검색 엔진
+│   ├── router.js       # 3단계 검색 엔진 (BM25 v3.4)
 │   ├── vector-index.js # Float32 벡터 인덱스 (centroid hierarchy)
 │   ├── embedding.js    # Ollama 임베딩 클라이언트 (nomic-embed-text)
 │   ├── executor.js     # HTTP/함수 도구 실행기

package/README.md

@@ -29,7 +29,9 @@
 
 🔍 **One tool to rule them all** — Your AI sees `n2_qln_call` (~200 tokens), not 1,000 individual tools. 99.6% context reduction.
 
-⚡ **Sub-5ms search** — 3-stage search engine (trigger + keyword + semantic) finds the right tool in under 5ms, even with 1,000+ tools indexed.
+⚡ **Sub-5ms search** — 3-stage search engine (trigger + BM25 keyword + semantic) finds the right tool in under 5ms, even with 1,000+ tools indexed.
+
+🎯 **BM25 keyword ranking** *(v3.4)* — Stage 2 uses [Okapi BM25](https://en.wikipedia.org/wiki/Okapi_BM25) for keyword search. Rare terms score higher, document length is normalized. The same algorithm behind Google, Elasticsearch, and Wikipedia search.
 
 📈 **Self-learning ranking** — Tools that get used more and succeed more are automatically ranked higher over time. No manual tuning needed.
 
@@ -184,14 +186,14 @@ QLN finds the right tool using three parallel search stages:
 | Stage | Method | Speed | How it works |
 |:---:|--------|:---:|------|
 | **1** | Trigger Match | ⚡ <1ms | Matches exact words in tool names and trigger keywords |
-| **2** | Keyword Search | ⚡ 1-3ms | Full-text search across descriptions, tags, and examples |
+| **2** | BM25 Keyword | ⚡ 1-3ms | [Okapi BM25](https://en.wikipedia.org/wiki/Okapi_BM25) ranked search — IDF weighting + document length normalization *(v3.4)* |
 | **3** | Semantic Search | 🧠 5-15ms | Vector similarity using embeddings *(optional, requires Ollama)* |
 
 Results from all stages are merged and ranked:
 
 ```
 final_score = trigger_score × 3.0
-            + keyword_score × 1.0
+            + bm25_keyword_score × 1.0
             + semantic_score × 2.0
             + log2(usage_count + 1) × 0.5
             + success_rate × 1.0
@@ -417,7 +419,7 @@ n2-qln/
 │   ├── schema.js       # Tool schema normalization + search text builder
 │   ├── validator.js    # Enforced validation (name, description, category)
 │   ├── registry.js       # Tool CRUD + usage tracking + embedding cache
-│   ├── router.js         # 3-stage parallel search engine
+│   ├── router.js         # 3-stage parallel search engine (BM25 v3.4)
 │   ├── vector-index.js   # Float32 vector index with centroid hierarchy
 │   ├── embedding.js      # Ollama embedding client (nomic-embed-text)
 │   ├── executor.js       # HTTP/function tool executor

package/lib/router.js

@@ -1,12 +1,12 @@
 // QLN — L1 Router (3-Stage parallel search engine)
-// Query → Stage1(Trigger) + Stage2(Keyword) + Stage3(Semantic) → Merge → Top-K
+// Query → Stage1(Trigger) + Stage2(BM25 Keyword) + Stage3(Semantic) → Merge → Top-K
 const { buildSearchText } = require('./schema');
 
 /**
  * 3-Stage search engine.
  *
  * Score formula:
- *   final = trigger×3.0 + keyword×1.0 + semantic×2.0
+ *   final = trigger×3.0 + bm25_keyword×1.0 + semantic×2.0
  *         + log2(usageCount+1)×0.5 + successRate×1.0
  */
 class Router {
@@ -19,6 +19,15 @@ class Router {
         this._registry = registry;
         this._vectorIndex = vectorIndex;
         this._embedding = embedding;
+
+        // BM25 parameters (standard Okapi BM25 defaults)
+        this._k1 = 1.2;   // Term frequency saturation
+        this._b = 0.75;    // Document length normalization
+
+        // IDF cache (rebuilt when tools change)
+        this._idfCache = new Map();
+        this._avgDocLen = 0;
+        this._idfDirty = true;
     }
 
     /**
@@ -34,14 +43,17 @@ class Router {
         const timing = { stage1: 0, stage2: 0, stage3: 0, merge: 0, total: 0 };
         const t0 = Date.now();
 
+        // Rebuild IDF if registry changed
+        if (this._idfDirty) this._buildIDF();
+
         // Stage 1: Trigger exact match (fastest)
         const t1 = Date.now();
         this._stage1TriggerMatch(query, scores);
         timing.stage1 = Date.now() - t1;
 
-        // Stage 2: Keyword match (search_text LIKE)
+        // Stage 2: BM25 keyword search
         const t2 = Date.now();
-        this._stage2KeywordMatch(query, scores);
+        this._stage2BM25(query, scores);
         timing.stage2 = Date.now() - t2;
 
         // Stage 3: Semantic vector search (when embedding available)
@@ -73,20 +85,101 @@ class Router {
         }
     }
 
-    /** Stage 2: search_text keyword match. Weight: 1.0 */
-    _stage2KeywordMatch(query, scores) {
-        const queryWords = query.toLowerCase().split(/\s+/).filter(w => w.length > 2);
+    /** Stage 2: BM25 keyword search. Weight: 1.0 */
+    _stage2BM25(query, scores) {
+        const queryTerms = this._tokenize(query);
+        if (queryTerms.length === 0) return;
+
         for (const tool of this._registry.getAll()) {
             const text = (tool.searchText || buildSearchText(tool)).toLowerCase();
-            let matchCount = 0;
-            for (const word of queryWords) {
-                if (text.includes(word)) matchCount++;
+            const bm25 = this._bm25Score(queryTerms, text);
+            if (bm25 > 0) {
+                this._getOrCreate(scores, tool.name).stage2 = bm25 * 1.0;
             }
-            if (matchCount > 0) {
-                this._getOrCreate(scores, tool.name).stage2 =
-                    (matchCount / Math.max(queryWords.length, 1)) * 1.0;
+        }
+    }
+
+    /**
+     * Calculate BM25 score for a query against a document.
+     * @param {string[]} queryTerms - Tokenized query terms
+     * @param {string} docText - Document text (lowercased)
+     * @returns {number} BM25 score
+     */
+    _bm25Score(queryTerms, docText) {
+        const docTerms = docText.split(/[\s_\-./]+/).filter(w => w.length > 1);
+        const docLen = docTerms.length;
+        if (docLen === 0) return 0;
+
+        // Build term frequency map for this document
+        const tf = new Map();
+        for (const term of docTerms) {
+            tf.set(term, (tf.get(term) || 0) + 1);
+        }
+
+        let score = 0;
+        for (const term of queryTerms) {
+            const idf = this._idfCache.get(term) || 0;
+            const freq = tf.get(term) || 0;
+            if (freq === 0) continue;
+
+            // BM25 formula: IDF × (f × (k1+1)) / (f + k1 × (1 - b + b × |d|/avgDL))
+            const numerator = freq * (this._k1 + 1);
+            const denominator = freq + this._k1 * (1 - this._b + this._b * (docLen / this._avgDocLen));
+            score += idf * (numerator / denominator);
+        }
+
+        return score;
+    }
+
+    /**
+     * Build IDF cache from all registered tools.
+     * IDF(term) = ln((N - n(t) + 0.5) / (n(t) + 0.5) + 1)
+     * where N = total docs, n(t) = docs containing term
+     */
+    _buildIDF() {
+        const tools = this._registry.getAll();
+        const N = tools.length;
+        if (N === 0) {
+            this._idfDirty = false;
+            return;
+        }
+
+        // Tokenize all documents and count document frequencies
+        const docFreq = new Map();
+        let totalLen = 0;
+
+        for (const tool of tools) {
+            const text = (tool.searchText || buildSearchText(tool)).toLowerCase();
+            const terms = text.split(/[\s_\-./]+/).filter(w => w.length > 1);
+            totalLen += terms.length;
+
+            // Unique terms per document
+            const uniqueTerms = new Set(terms);
+            for (const term of uniqueTerms) {
+                docFreq.set(term, (docFreq.get(term) || 0) + 1);
             }
         }
+
+        this._avgDocLen = totalLen / N;
+
+        // Calculate IDF for each term
+        this._idfCache.clear();
+        for (const [term, df] of docFreq) {
+            // BM25 IDF: ln((N - df + 0.5) / (df + 0.5) + 1)
+            const idf = Math.log((N - df + 0.5) / (df + 0.5) + 1);
+            this._idfCache.set(term, idf);
+        }
+
+        this._idfDirty = false;
+    }
+
+    /**
+     * Tokenize query string into search terms.
+     * @param {string} query
+     * @returns {string[]}
+     */
+    _tokenize(query) {
+        return query.toLowerCase().split(/[\s_\-./]+/).filter(w => w.length > 2);
     }
 
     /** Stage 3: Semantic vector search. Weight: 2.0 */
@@ -167,11 +260,17 @@ class Router {
         return ranked;
     }
 
-    /** Build vector index */
+    /** Build vector index and refresh IDF cache */
     buildIndex() {
+        this._idfDirty = true;
         return this._vectorIndex.build(this._registry.getAll());
     }
 
+    /** Mark IDF cache as dirty (call after tool registration changes) */
+    invalidateIDF() {
+        this._idfDirty = true;
+    }
+
     /** @private */
     _getOrCreate(scores, name) {
         if (!scores.has(name)) scores.set(name, { stage1: 0, stage2: 0, stage3: 0 });
@@ -184,8 +283,15 @@ class Router {
             registrySize: this._registry.size,
             vectorIndex: this._vectorIndex.stats(),
             embeddingAvailable: !!this._embedding,
+            bm25: {
+                idfTerms: this._idfCache.size,
+                avgDocLen: Math.round(this._avgDocLen * 10) / 10,
+                k1: this._k1,
+                b: this._b,
+            },
         };
     }
 }
 
 module.exports = { Router };
+

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "n2-qln",
-    "version": "3.3.4",
+    "version": "3.4.1",
     "description": "Query Layer Network — Semantic tool dispatcher for MCP. Route 1000 tools through 1 router.",
     "main": "index.js",
     "bin": {
@@ -23,7 +23,7 @@
         "llm"
     ],
     "author": "N2",
-    "license": "Apache-2.0",
+    "license": "SEE LICENSE IN LICENSE",
     "repository": {
         "type": "git",
         "url": "git+https://github.com/choihyunsus/n2-QLN.git"