Completion Suggester - Elasticsearch
I have an issue about the completion suggester.
I have a string dataset with data like :
"paris", "london", "france", "a city in France", "nothing at all", ...
I would like search into my data with for example this input : "an" and have this results : "france", "a city in France", "nothing at all"
is it possible ?
Thanks.
elasticsearch lucene
add a comment |
I have an issue about the completion suggester.
I have a string dataset with data like :
"paris", "london", "france", "a city in France", "nothing at all", ...
I would like search into my data with for example this input : "an" and have this results : "france", "a city in France", "nothing at all"
is it possible ?
Thanks.
elasticsearch lucene
add a comment |
I have an issue about the completion suggester.
I have a string dataset with data like :
"paris", "london", "france", "a city in France", "nothing at all", ...
I would like search into my data with for example this input : "an" and have this results : "france", "a city in France", "nothing at all"
is it possible ?
Thanks.
elasticsearch lucene
I have an issue about the completion suggester.
I have a string dataset with data like :
"paris", "london", "france", "a city in France", "nothing at all", ...
I would like search into my data with for example this input : "an" and have this results : "france", "a city in France", "nothing at all"
is it possible ?
Thanks.
elasticsearch lucene
elasticsearch lucene
asked Nov 23 '18 at 16:46
Pierre MarsotPierre Marsot
1
1
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
It is possible to achieve something similar to what you want by using partial matching with n-grams. In order to do it every word in your dataset should be split into so called n-grams - moving windows of word where n is a length of this window. To not repeat Elasticsearch docs here is the link.
Everything comes with a price. Here the price is an increased size of the index.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53450361%2fcompletion-suggester-elasticsearch%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
It is possible to achieve something similar to what you want by using partial matching with n-grams. In order to do it every word in your dataset should be split into so called n-grams - moving windows of word where n is a length of this window. To not repeat Elasticsearch docs here is the link.
Everything comes with a price. Here the price is an increased size of the index.
add a comment |
It is possible to achieve something similar to what you want by using partial matching with n-grams. In order to do it every word in your dataset should be split into so called n-grams - moving windows of word where n is a length of this window. To not repeat Elasticsearch docs here is the link.
Everything comes with a price. Here the price is an increased size of the index.
add a comment |
It is possible to achieve something similar to what you want by using partial matching with n-grams. In order to do it every word in your dataset should be split into so called n-grams - moving windows of word where n is a length of this window. To not repeat Elasticsearch docs here is the link.
Everything comes with a price. Here the price is an increased size of the index.
It is possible to achieve something similar to what you want by using partial matching with n-grams. In order to do it every word in your dataset should be split into so called n-grams - moving windows of word where n is a length of this window. To not repeat Elasticsearch docs here is the link.
Everything comes with a price. Here the price is an increased size of the index.
answered Nov 25 '18 at 21:16
briarheartbriarheart
1,2571221
1,2571221
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53450361%2fcompletion-suggester-elasticsearch%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown