Skip to content

Commit 688297e

Browse files
added more content
1 parent def7377 commit 688297e

File tree

4 files changed

+10
-7
lines changed

4 files changed

+10
-7
lines changed

notes/2024/Generative-AI.html

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -58,8 +58,8 @@ <h3 id="chunking-methods">Chunking Methods<a role="anchor" aria-hidden="true" ta
5858
<h3 id="evaluating-chunking-strategies"><strong>Evaluating Chunking Strategies</strong><a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#evaluating-chunking-strategies" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h3>
5959
<p>Recall is a crucial metric for evaluating the effectiveness of a chunking strategy. It measures the proportion of relevant chunks retrieved in response to a query.</p>
6060
<p>A high recall rate indicates that the chunking strategy is effectively capturing and representing the information in a way that allows for accurate retrieval.</p>
61-
<p>Example:
62-
Imagine a document has been chunked, and a query results in three relevant chunks. The retriever returns five chunks, but only two of those are the relevant ones. In this case:</p>
61+
<p>Example:</p>
62+
<p>Imagine a document has been chunked, and a query results in three relevant chunks. The retriever returns five chunks, but only two of those are the relevant ones. In this case:</p>
6363
<ul>
6464
<li>Relevant elements = 3</li>
6565
<li>Retrieved elements that are also relevant = 2</li>
@@ -92,7 +92,6 @@ <h3 id="retrevial-algorithm">Retrevial Algorithm<a role="anchor" aria-hidden="tr
9292
<li><strong>Locality-Sensitive Hashing (LSH)</strong>: This algorithm hashes input vectors so that similar vectors map to the same hash, allowing fast lookup based on hash values rather than full comparison</li>
9393
<li><strong>BM25 (Best Matching 25)</strong> Unlike vector-based search, which relies on embeddings, BM25 is a term-based algorithm that ranks documents based on the presence and frequency of query terms in the documents.</li>
9494
</ul>
95-
<p>BM25,ADA-002</p>
9695
<h3 id="rag-evaluation">RAG Evaluation<a role="anchor" aria-hidden="true" tabindex="-1" data-no-popover="true" href="#rag-evaluation" class="internal"><svg width="18" height="18" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71"></path><path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71"></path></svg></a></h3>
9796
<p>RAG Triad of metrics</p>
9897
<ul>

notes/2024/LLM-Observability-And-Eval.html

Lines changed: 2 additions & 1 deletion
Large diffs are not rendered by default.

notes/2024/LLM-strucuted-output-and-Parser.html

Lines changed: 5 additions & 2 deletions
Large diffs are not rendered by default.

static/contentIndex.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

0 commit comments

Comments
 (0)