# Search candidates for a job

You may search for specific candidates for a job by using the *search candidates input* box.

![](/files/EGzK8sVBULZ3GrG5gmci)

## Search tips

* By **default** all words must be present in the candidate's resume. For example a search for *web developer* will return results that contain web and developer.
* You may search for **either words** using the OR operator. For example *php OR java* will return results that contain either php or java.&#x20;
* You may **exclude specific words** by using the - operator. For example *shipping -sales* will return results that contain the word shipping but do not include the word sales.
* You may use **complex boolean expressions** like software AND (developer OR engineer) which will return results that contain the word software and also either developer or engineer.
* You may search for a **phrase** by using quotation marks. For example *"web developer"* will return results that contain this exact phrase.
* You may alse search for **words that are near each other**. For example *"board member"\~3* will return results that contain both words but at a maximum distance of 3 words. This is very handy because it will return documents that for example may contain *board member* or *member of the board*.


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://help.smartcv.co/manage-candidates/search-candidates-for-a-job.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.
