mirror of
https://github.com/jina-ai/node-DeepResearch.git
synced 2025-12-26 06:28:56 +08:00
fix: improve prompting
This commit is contained in:
parent
8630d607a2
commit
2306bd3a9e
36
README.md
36
README.md
@ -2,19 +2,10 @@
|
||||
|
||||
Keep searching, reading webpages, reasoning until it finds the answer (or exceeding the token budget).
|
||||
|
||||
## Demo
|
||||
Query: `"what is the latest blog post's title from jina ai?"`
|
||||
> 3 steps; answer correct!
|
||||

|
||||
|
||||
Query: `"list all employees from jina ai that u can find, as many as possible"`
|
||||
> 11 steps; partial answer, but incomplete complete, im not in it!
|
||||

|
||||
|
||||
|
||||
## Install
|
||||
|
||||
We use gemini for llm, brave/duckduckgo for search, jina reader for reading a webpage.
|
||||
We use gemini for llm, brave/duckduckgo for search, [jina reader](https://jina.ai/reader) for reading a webpage.
|
||||
|
||||
```bash
|
||||
export GEMINI_API_KEY=... # for gemini api, ask han
|
||||
@ -26,7 +17,30 @@ cd node-DeepResearch
|
||||
npm install
|
||||
```
|
||||
|
||||
## Examples
|
||||
## Demo
|
||||
Query: `"what is the latest blog post's title from jina ai?"`
|
||||
> 3 steps; answer is correct!
|
||||

|
||||
|
||||
Query: `"what is the context length of readerlm-v2?"`
|
||||
> 2 steps; answer is correct!
|
||||

|
||||
|
||||
Query: `"list all employees from jina ai that u can find, as many as possible"`
|
||||
> 11 steps; partially correct, but im not in the list :(
|
||||

|
||||
|
||||
Query: `"who will be the biggest competitor of Jina AI"`
|
||||
> 42 steps; future prediction kind, so it's arguably correct.
|
||||

|
||||
|
||||
|
||||
## Usage
|
||||
|
||||
```bash
|
||||
npm run dev $QUERY
|
||||
```
|
||||
|
||||
```
|
||||
# example: no tool calling
|
||||
npm run dev "1+1="
|
||||
|
||||
@ -14,9 +14,10 @@ const responseSchema = {
|
||||
unique_queries: {
|
||||
type: SchemaType.ARRAY,
|
||||
items: {
|
||||
type: SchemaType.STRING
|
||||
type: SchemaType.STRING,
|
||||
description: "Unique query that passed the deduplication process, must be less than 30 characters"
|
||||
},
|
||||
description: "Array of semantically unique queries from set A"
|
||||
description: "Array of semantically unique queries"
|
||||
}
|
||||
},
|
||||
required: ["think", "unique_queries"]
|
||||
|
||||
@ -16,9 +16,9 @@ const responseSchema = {
|
||||
type: SchemaType.ARRAY,
|
||||
items: {
|
||||
type: SchemaType.STRING,
|
||||
description: "Search query with integrated operators"
|
||||
description: "Search query, must be less than 30 characters"
|
||||
},
|
||||
description: "Array of search queries with appropriate operators",
|
||||
description: "Array of search queries, orthogonal to each other",
|
||||
minItems: 1,
|
||||
maxItems: 3
|
||||
}
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user