Skip to content

Commit ef48788

Browse files
Merge pull request #636 from wjohnsto/master
correcting spelling
2 parents 4c8b4bc + b491a7d commit ef48788

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

Diff for: docs/howtos/solutions/vector/video-qa/index-video-qa.mdx

+5-5
Original file line numberDiff line numberDiff line change
@@ -227,7 +227,7 @@ You should be up and running now! The rest of this tutorial is focused on how th
227227

228228
### Video uploading and processing
229229

230-
#### Handling video uploads and retreiving video transcripts and metadata
230+
#### Handling video uploads and retrieving video transcripts and metadata
231231

232232
The backend is set up to handle YouTube video links or IDs. The relevant code snippet from the project demonstrates how these inputs are processed.
233233

@@ -246,7 +246,7 @@ export async function load(videos: string[] = config.youtube.VIDEOS) {
246246
return typeof video === 'string';
247247
}) as string[];
248248

249-
// Get video title, description, and thumbail from YouTube API v3
249+
// Get video title, description, and thumbnail from YouTube API v3
250250
const videoInfo = await getVideoInfo(videosToLoad);
251251

252252
// Get video transcripts from SearchAPI.io, join the video info
@@ -523,7 +523,7 @@ async function storeVideoVectors(documents: VideoDocument[]) {
523523

524524
Notice that we first check if we have already generated a vector using the Redis Set `VECTOR_SET`. If we have, we skip the LLM and use the existing vector. This avoids unnecessary API calls and can speed things up.
525525

526-
### Redis vector search funcationality and AI integration for video Q&A
526+
### Redis vector search functionality and AI integration for video Q&A
527527

528528
One of the key features of our application is the ability to search through video content using AI-generated queries. This section will cover how the backend handles search requests and interacts with the AI models.
529529

@@ -661,7 +661,7 @@ You might ask why store the question as a vector? Why not just store the questio
661661

662662
### How to implement semantic vector caching in Redis
663663

664-
If you're already familiar with storing vectors in Redis, which we have covered in this tutorial, semantic vector caching is an extenson of that and operates in essentially the same way. The only difference is that we are storing the question as a vector, rather than the video summary. We are also using the [cache aside](https://www.youtube.com/watch?v=AJhTduDOVCs) pattern. The process is as follows:
664+
If you're already familiar with storing vectors in Redis, which we have covered in this tutorial, semantic vector caching is an extension of that and operates in essentially the same way. The only difference is that we are storing the question as a vector, rather than the video summary. We are also using the [cache aside](https://www.youtube.com/watch?v=AJhTduDOVCs) pattern. The process is as follows:
665665

666666
1. When a user asks a question, we perform a vector similarity search for existing answers to the question.
667667
1. If we find an answer, we return it to the user. Thus, avoiding a call to the LLM.
@@ -682,7 +682,7 @@ const answerVectorStore = new RedisVectorStore(embeddings, {
682682
});
683683
```
684684

685-
The `answerVectorStore` looks nearly identical to the `vectorStore` we defined earlier, but it uses a different [algorithm and disance metric](https://redis.io/docs/interact/search-and-query/advanced-concepts/vectors/). This algorithm is better suited for similarity searches for our questions.
685+
The `answerVectorStore` looks nearly identical to the `vectorStore` we defined earlier, but it uses a different [algorithm and distance metric](https://redis.io/docs/interact/search-and-query/advanced-concepts/vectors/). This algorithm is better suited for similarity searches for our questions.
686686

687687
The following code demonstrates how to use the `answerVectorStore` to check if a similar question has already been answered.
688688

0 commit comments

Comments
 (0)