구문 및 근접 검색
`match_phrase`와 `slop` 매개변수를 사용하여 정확한 구문과 일정한 근접 범위 내의 단어를 검색하는 방법을 알아봅니다.
구문 및 근접 검색은(는) CoddyKit의 무료 Elasticsearch & Full Text Search Systems 강의입니다. 이것은 4개 중 1번째 강의입니다. 아래에서 전체 강의를 무료로 읽을 수 있으며, 내장 코드 에디터와 24/7 AI 튜터와 함께 브라우저에서 직접 실습할 수 있습니다. 이 강의는 Elasticsearch & Full Text Search Systems 학습 경로의 일부이며, 진행 상황이 웹과 CoddyKit 앱에 동기화됩니다. Elasticsearch & Full Text Search Systems 강의에는 총 4개의 강의가 포함되어 있습니다.
이 강의의 일부는 아직 번역되지 않았으며 영어로 표시됩니다.
Beyond Single Words
Welcome! So far, you've learned to search for individual words. But what if you need to find exact phrases like "quick brown fox" or words that appear close together?
This lesson introduces phrase and proximity searches, powerful techniques to make your searches more precise and relevant.
Finding Exact Phrases
Sometimes, the order of words matters. For example, "New York" is different from "York New". To find an exact sequence of words, we use a phrase query.
In Elasticsearch, the match_phrase query is perfect for this. It looks for all terms in your query string, in the exact order, and next to each other.
match_phrase Example
Let's see match_phrase in action. We'll simulate indexing a few documents and then search for the exact phrase "quick brown fox".
public class Main {
public static void main(String[] args) {
System.out.println("Simulating search for exact phrase 'quick brown fox'");
System.out.println("on documents:");
System.out.println("- 'The quick brown fox jumps.'");
System.out.println("- 'A fox brown quick jumps.'");
System.out.println("- 'Quick brown fox is fast.'");
System.out.println("
--- Elasticsearch Query (simulated) ---");
System.out.println("{");
System.out.println(" \"query\": {");
System.out.println(" \"match_phrase\": {");
System.out.println(" \"text_field\": \"quick brown fox\"");
System.out.println(" }");
System.out.println(" }");
System.out.println("}");
System.out.println("
--- Search Results (simulated) ---");
System.out.println("Document: 'The quick brown fox jumps.' (MATCH!)");
System.out.println("Document: 'Quick brown fox is fast.' (MATCH!)");
System.out.println("No match for 'A fox brown quick jumps.'");
}
}Phrase Matching Logic
The match_phrase query requires two conditions:
- All terms present: Every word in your phrase ("quick", "brown", "fox") must exist in the document.
- Exact order: The words must appear in the same sequence.
- Contiguous: By default, the words must be right next to each other.
If any of these conditions aren't met, the document won't be considered a match.
Proximity Search with slop
What if you want to find words that are *close* to each other, but not necessarily an exact, contiguous phrase? This is where proximity search comes in.
Elasticsearch introduces the slop parameter for match_phrase queries. It allows for a certain number of "slops" or "gaps" between the words in your phrase.
Understanding slop
The slop parameter defines the maximum number of positions tokens can be "moved" to match the phrase.
slop: 0(default) means words must be contiguous.slop: 1allows one word to be skipped or reordered slightly.- Higher
slopvalues allow more flexibility in word order and distance.
Think of it as how many "moves" it takes to transform the document's words into your target phrase.
slop=1 Demonstration
Let's modify our previous search. We'll look for "quick fox" but allow for one word in between using "slop": 1.
public class Main {
public static void main(String[] args) {
System.out.println("Simulating search for 'quick fox' with slop: 1");
System.out.println("on documents:");
System.out.println("- 'The quick brown fox jumps.'");
System.out.println("- 'A quick sly fox is here.'");
System.out.println("- 'The quick fox is fast.'");
System.out.println("
--- Elasticsearch Query (simulated) ---");
System.out.println("{");
System.out.println(" \"query\": {");
System.out.println(" \"match_phrase\": {");
System.out.println(" \"text_field\": {");
System.out.println(" \"query\": \"quick fox\",");
System.out.println(" \"slop\": 1");
System.out.println(" }");
System.out.println(" }");
System.out.println(" }");
System.out.println("}");
System.out.println("
--- Search Results (simulated) ---");
System.out.println("Document: 'The quick brown fox jumps.' (MATCH!)");
System.out.println("Document: 'A quick sly fox is here.' (MATCH!)");
System.out.println("Document: 'The quick fox is fast.' (MATCH!)");
}
}slop and Word Order
slop can also help match phrases where words are slightly reordered. For example, to match "brown quick" when searching for "quick brown" with slop: 1.
It measures the minimum number of moves to get the document's tokens into the query's token order. Each move counts as 1 slop unit.
public class Main {
public static void main(String[] args) {
System.out.println("Simulating search for 'quick brown' with slop: 1");
System.out.println("on document:");
System.out.println("- 'The brown quick fox.'"); // 'brown' and 'quick' are swapped
System.out.println("
--- Elasticsearch Query (simulated) ---");
System.out.println("{");
System.out.println(" \"query\": {");
System.out.println(" \"match_phrase\": {");
System.out.println(" \"text_field\": {");
System.out.println(" \"query\": \"quick brown\",");
System.out.println(" \"slop\": 1");
System.out.println(" }");
System.out.println(" }");
System.out.println(" }");
System.out.println("}");
System.out.println("
--- Search Results (simulated) ---");
System.out.println("Document: 'The brown quick fox.' (MATCH!)");
System.out.println("Explanation: To change 'brown quick' to 'quick brown', one move is needed (slop 1).");
}
}match_phrase vs. match
It's important to differentiate match_phrase from the basic match query you've seen before.
matchquery: Finds documents containing *any* of the words, regardless of order or proximity. It's good for general relevancy.match_phrasequery: Requires *all* words in the exact order and, by default, contiguous. Withslop, it allows for controlled proximity. It's for high precision.
Choose match_phrase when the order and closeness of words are critical to your search.
Proximity Check
You want to find documents where "apple" and "pie" appear, with at most one word in between them, in that specific order.
Recap: Precise Searches
Great job! You've learned how to enhance your search precision:
match_phrase: For finding exact sequences of words.slopparameter: To control the allowed distance and reordering between words in a phrase.
These techniques are crucial for building highly accurate and user-friendly search experiences. Keep practicing to master them!
AI 튜터와 함께 Elasticsearch & Full Text Search Systems을(를) 배우세요 — 무료
브라우저에서 실제 코드를 작성하고 실행하며, 24/7 AI 튜터로부터 즉각적인 도움을 받고, 웹이나 앱에서 중단한 부분부터 계속 학습하세요.
- 코스
- 12
- 레슨
- 48
자주 묻는 질문
“구문 및 근접 검색” 강의는 무료인가요?
네 — “구문 및 근접 검색” 전체 내용을 이 웹사이트에서 무료로 읽을 수 있습니다. 인터랙티브하게 실습하려면(내장 코드 에디터와 24/7 AI 튜터), CoddyKit PRO로 업그레이드하면 Elasticsearch & Full Text Search Systems 강의 전체를 잠금 해제할 수 있습니다. Elasticsearch & Full Text Search Systems 강의에는 총 4개의 강의가 포함되어 있습니다.
“구문 및 근접 검색”에서 뭘 배우나요?
`match_phrase`와 `slop` 매개변수를 사용하여 정확한 구문과 일정한 근접 범위 내의 단어를 검색하는 방법을 알아봅니다. 브라우저에서 직접 실행하는 실습 코드로 Elasticsearch & Full Text Search Systems을(를) 배우며, 24/7 AI 튜터가 강의를 진행하면서 질문에 답변해줍니다.
Elasticsearch & Full Text Search Systems을(를) 시작하는 데 경험이 필요한가요?
사전 경험은 필요하지 않습니다. CoddyKit의 Elasticsearch & Full Text Search Systems은(는) 초급자부터 고급 학습자까지를 위해 구성되어 있으므로, 여기서 시작하거나 처음부터 시작할 수 있으며 자신의 속도대로 진행할 수 있습니다. 이것은 4개 중 1번째 강의입니다.
“구문 및 근접 검색” 강의는 얼마나 걸리나요?
대부분의 CoddyKit 강의는 약 5~10분이 소요됩니다. 각 강의는 간결하고 인터랙티브하여 꾸준한 진행이 가능하며, 웹과 앱에서 중단한 부분부터 바로 시작할 수 있습니다.
이 Elasticsearch & Full Text Search Systems 강의에서 코드를 작성하고 실행할 수 있나요?
네. 모든 Elasticsearch & Full Text Search Systems 강의에는 내장 코드 에디터가 포함되어 있으므로, 브라우저에서 바로 실제 코드를 작성하고 실행한 후 즉시 AI 피드백을 받을 수 있습니다 — 로컬 설정이 필요 없습니다.
이 강의의 모든 강의
- 구문 및 근접 검색
- 퍼지 및 와일드카드 쿼리
- 검색 결과 강조 표시
- 패싯 검색을 위한 집계