[[shingles]]
=== Finding Associated Words
As useful as phrase and proximity queries can be, they still have a downside.
They are overly strict: all terms must be present for a phrase query to match,
even when using `slop`.((("proximity matching", "finding associated words", range="startofrange", id="ix_proxmatchassoc")))
The flexibility in word ordering that you gain with `slop` also comes at a
price, because you lose the association between word pairs. While you can
identify documents in which `sue`, `alligator`, and `ate` occur close together,
you can't tell whether _Sue ate_ or the _alligator ate_.
When words are used in conjunction with each other, they express an idea that
is bigger or more meaningful than each word in isolation. The two clauses
_I'm not happy I'm working_ and _I'm happy I'm not working_ contain the sames words, in
close proximity, but have quite different meanings.
If, instead of indexing each word independently, we were to index pairs of
words, then we could retain more of the context in which the words were used.
For the sentence `Sue ate the alligator`, we would not only index each word
(or _unigram_) as((("unigrams"))) a term
["sue", "ate", "the", "alligator"]
but also each word _and its neighbor_ as single terms:
["sue ate", "ate the", "the alligator"]
These word ((("bigrams")))pairs (or _bigrams_) are ((("shingles")))known as _shingles_.
[TIP]
==================================================
Shingles are not restricted to being pairs of words; you could index word
triplets (_trigrams_) as ((("trigrams")))well:
["sue ate the", "ate the alligator"]
Trigrams give you a higher degree of precision, but greatly increase the
number of unique terms in the index. Bigrams are sufficient for most use
cases.
==================================================
Of course, shingles are useful only if the user enters the query in the same
order as in the original document; a query for `sue alligator` would match
the individual words but none of our shingles.
Fortunately, users tend to express themselves using constructs similar to
those that appear in the data they are searching. But this point is an
important one: it is not enough to index just bigrams; we still need unigrams,
but we can use matching bigrams as a signal to increase the relevance score.
==== Producing Shingles
Shingles need to be created at index time as part of the analysis process.((("shingles", "producing at index time"))) We
could index both unigrams and bigrams into a single field, but it is cleaner
to keep unigrams and bigrams in separate fields that can be queried
independently. The unigram field would form the basis of our search, with the
bigram field being used to boost relevance.
First, we need to create an analyzer that uses the `shingle` token filter:
[source,js]
--------------------------------------------------
DELETE /my_index
PUT /my_index
{
"settings": {
"number_of_shards": 1, <1>
"analysis": {
"filter": {
"my_shingle_filter": {
"type": "shingle",
"min_shingle_size": 2, <2>
"max_shingle_size": 2, <2>
"output_unigrams": false <3>
}
},
"analyzer": {
"my_shingle_analyzer": {
"type": "custom",
"tokenizer": "standard",
"filter": [
"lowercase",
"my_shingle_filter" <4>
]
}
}
}
}
}
--------------------------------------------------
// SENSE: 120_Proximity_Matching/35_Shingles.json
<1> See <<relevance-is-broken>>.
<2> The default min/max shingle size is `2` so we don't really need to set
these.
<3> The `shingle` token filter outputs unigrams by default, but we want to
keep unigrams and bigrams separate.
<4> The `my_shingle_analyzer` uses our custom `my_shingles_filter` token
filter.
First, let's test that our analyzer is working as expected with the `analyze`
API:
[source,js]
--------------------------------------------------
GET /my_index/_analyze?analyzer=my_shingle_analyzer
Sue ate the alligator
--------------------------------------------------
Sure enough, we get back three terms:
* `sue ate`
* `ate the`
* `the alligator`
Now we can proceed to setting up a field to use the new analyzer.
==== Multifields
We said that it is cleaner to index unigrams and bigrams separately, so we
will create the `title` field ((("multifields")))as a multifield (see <<multi-fields>>):
[source,js]
--------------------------------------------------
PUT /my_index/_mapping/my_type
{
"my_type": {
"properties": {
"title": {
"type": "string",
"fields": {
"shingles": {
"type": "string",
"analyzer": "my_shingle_analyzer"
}
}
}
}
}
}
--------------------------------------------------
With this mapping, values from our JSON document in the field `title` will be
indexed both as unigrams (`title`) and as bigrams (`title.shingles`), meaning
that we can query these fields independently.
And finally, we can index our example documents:
[source,js]
--------------------------------------------------
POST /my_index/my_type/_bulk
{ "index": { "_id": 1 }}
{ "title": "Sue ate the alligator" }
{ "index": { "_id": 2 }}
{ "title": "The alligator ate Sue" }
{ "index": { "_id": 3 }}
{ "title": "Sue never goes anywhere without her alligator skin purse" }
--------------------------------------------------
==== Searching for Shingles
To understand the benefit ((("shingles", "searching for")))that the `shingles` field adds, let's first look at
the results from a simple `match` query for ``The hungry alligator ate Sue'':
[source,js]
--------------------------------------------------
GET /my_index/my_type/_search
{
"query": {
"match": {
"title": "the hungry alligator ate sue"
}
}
}
--------------------------------------------------
This query returns all three documents, but note that documents 1 and 2
have the same relevance score because they contain the same words:
[source,js]
--------------------------------------------------
{
"hits": [
{
"_id": "1",
"_score": 0.44273707, <1>
"_source": {
"title": "Sue ate the alligator"
}
},
{
"_id": "2",
"_score": 0.44273707, <1>
"_source": {
"title": "The alligator ate Sue"
}
},
{
"_id": "3", <2>
"_score": 0.046571054,
"_source": {
"title": "Sue never goes anywhere without her alligator skin purse"
}
}
]
}
--------------------------------------------------
<1> Both documents contain `the`, `alligator`, and `ate` and so have the
same score.
<2> We could have excluded document 3 by setting the `minimum_should_match`
parameter. See <<match-precision>>.
Now let's add the `shingles` field into the query. Remember that we want
matches on the `shingles` field to act as a signal--to increase the
relevance score--so we still need to include the query on the main `title`
field:
[source,js]
--------------------------------------------------
GET /my_index/my_type/_search
{
"query": {
"bool": {
"must": {
"match": {
"title": "the hungry alligator ate sue"
}
},
"should": {
"match": {
"title.shingles": "the hungry alligator ate sue"
}
}
}
}
}
--------------------------------------------------
We still match all three documents, but document 2 has now been bumped into
first place because it matched the shingled term `ate sue`.
[source,js]
--------------------------------------------------
{
"hits": [
{
"_id": "2",
"_score": 0.4883322,
"_source": {
"title": "The alligator ate Sue"
}
},
{
"_id": "1",
"_score": 0.13422975,
"_source": {
"title": "Sue ate the alligator"
}
},
{
"_id": "3",
"_score": 0.014119488,
"_source": {
"title": "Sue never goes anywhere without her alligator skin purse"
}
}
]
}
--------------------------------------------------
Even though our query included the word `hungry`, which doesn't appear in
any of our documents, we still managed to use word proximity to return the
most relevant document first.
==== Performance
Not only are shingles more flexible than phrase queries,((("shingles", "better performance than phrase queries"))) but they perform better
as well. Instead of paying the price of a phrase query every time you search,
queries for shingles are just as efficient as a simple `match` query. A small price is paid at index time, because more terms need to
be indexed, which also means that fields with shingles use more disk space.
However, most applications write once and read many times, so it makes sense
to optimize for fast queries.
This is a theme that you will encounter frequently in Elasticsearch: enables you to achieve a lot at search time, without requiring any up-front
setup. Once you understand your requirements more clearly, you can achieve better results with better performance by modeling your data correctly at index time.
((("proximity matching", "finding associated words", range="endofrange", startref ="ix_proxmatchassoc")))
- Introduction
- 入门
- 是什么
- 安装
- API
- 文档
- 索引
- 搜索
- 聚合
- 小结
- 分布式
- 结语
- 分布式集群
- 空集群
- 集群健康
- 添加索引
- 故障转移
- 横向扩展
- 更多扩展
- 应对故障
- 数据
- 文档
- 索引
- 获取
- 存在
- 更新
- 创建
- 删除
- 版本控制
- 局部更新
- Mget
- 批量
- 结语
- 分布式增删改查
- 路由
- 分片交互
- 新建、索引和删除
- 检索
- 局部更新
- 批量请求
- 批量格式
- 搜索
- 空搜索
- 多索引和多类型
- 分页
- 查询字符串
- 映射和分析
- 数据类型差异
- 确切值对决全文
- 倒排索引
- 分析
- 映射
- 复合类型
- 结构化查询
- 请求体查询
- 结构化查询
- 查询与过滤
- 重要的查询子句
- 过滤查询
- 验证查询
- 结语
- 排序
- 排序
- 字符串排序
- 相关性
- 字段数据
- 分布式搜索
- 查询阶段
- 取回阶段
- 搜索选项
- 扫描和滚屏
- 索引管理
- 创建删除
- 设置
- 配置分析器
- 自定义分析器
- 映射
- 根对象
- 元数据中的source字段
- 元数据中的all字段
- 元数据中的ID字段
- 动态映射
- 自定义动态映射
- 默认映射
- 重建索引
- 别名
- 深入分片
- 使文本可以被搜索
- 动态索引
- 近实时搜索
- 持久化变更
- 合并段
- 结构化搜索
- 查询准确值
- 组合过滤
- 查询多个准确值
- 包含,而不是相等
- 范围
- 处理 Null 值
- 缓存
- 过滤顺序
- 全文搜索
- 匹配查询
- 多词查询
- 组合查询
- 布尔匹配
- 增加子句
- 控制分析
- 关联失效
- 多字段搜索
- 多重查询字符串
- 单一查询字符串
- 最佳字段
- 最佳字段查询调优
- 多重匹配查询
- 最多字段查询
- 跨字段对象查询
- 以字段为中心查询
- 全字段查询
- 跨字段查询
- 精确查询
- 模糊匹配
- Phrase matching
- Slop
- Multi value fields
- Scoring
- Relevance
- Performance
- Shingles
- Partial_Matching
- Postcodes
- Prefix query
- Wildcard Regexp
- Match phrase prefix
- Index time
- Ngram intro
- Search as you type
- Compound words
- Relevance
- Scoring theory
- Practical scoring
- Query time boosting
- Query scoring
- Not quite not
- Ignoring TFIDF
- Function score query
- Popularity
- Boosting filtered subsets
- Random scoring
- Decay functions
- Pluggable similarities
- Conclusion
- Language intro
- Intro
- Using
- Configuring
- Language pitfalls
- One language per doc
- One language per field
- Mixed language fields
- Conclusion
- Identifying words
- Intro
- Standard analyzer
- Standard tokenizer
- ICU plugin
- ICU tokenizer
- Tidying text
- Token normalization
- Intro
- Lowercasing
- Removing diacritics
- Unicode world
- Case folding
- Character folding
- Sorting and collations
- Stemming
- Intro
- Algorithmic stemmers
- Dictionary stemmers
- Hunspell stemmer
- Choosing a stemmer
- Controlling stemming
- Stemming in situ
- Stopwords
- Intro
- Using stopwords
- Stopwords and performance
- Divide and conquer
- Phrase queries
- Common grams
- Relevance
- Synonyms
- Intro
- Using synonyms
- Synonym formats
- Expand contract
- Analysis chain
- Multi word synonyms
- Symbol synonyms
- Fuzzy matching
- Intro
- Fuzziness
- Fuzzy query
- Fuzzy match query
- Scoring fuzziness
- Phonetic matching
- Aggregations
- overview
- circuit breaker fd settings
- filtering
- facets
- docvalues
- eager
- breadth vs depth
- Conclusion
- concepts buckets
- basic example
- add metric
- nested bucket
- extra metrics
- bucket metric list
- histogram
- date histogram
- scope
- filtering
- sorting ordering
- approx intro
- cardinality
- percentiles
- sigterms intro
- sigterms
- fielddata
- analyzed vs not
- 地理坐标点
- 地理坐标点
- 通过地理坐标点过滤
- 地理坐标盒模型过滤器
- 地理距离过滤器
- 缓存地理位置过滤器
- 减少内存占用
- 按距离排序
- Geohashe
- Geohashe
- Geohashe映射
- Geohash单元过滤器
- 地理位置聚合
- 地理位置聚合
- 按距离聚合
- Geohash单元聚合器
- 范围(边界)聚合器
- 地理形状
- 地理形状
- 映射地理形状
- 索引地理形状
- 查询地理形状
- 在查询中使用已索引的形状
- 地理形状的过滤与缓存
- 关系
- 关系
- 应用级别的Join操作
- 扁平化你的数据
- Top hits
- Concurrency
- Concurrency solutions
- 嵌套
- 嵌套对象
- 嵌套映射
- 嵌套查询
- 嵌套排序
- 嵌套集合
- Parent Child
- Parent child
- Indexing parent child
- Has child
- Has parent
- Children agg
- Grandparents
- Practical considerations
- Scaling
- Shard
- Overallocation
- Kagillion shards
- Capacity planning
- Replica shards
- Multiple indices
- Index per timeframe
- Index templates
- Retiring data
- Index per user
- Shared index
- Faking it
- One big user
- Scale is not infinite
- Cluster Admin
- Marvel
- Health
- Node stats
- Other stats
- Deployment
- hardware
- other
- config
- dont touch
- heap
- file descriptors
- conclusion
- cluster settings
- Post Deployment
- dynamic settings
- logging
- indexing perf
- rolling restart
- backup
- restore
- conclusion