R - Find all possible combinations splitted word
I have a function which extracts all meaningful words from a string. After this, I would like to create all possible sentences from these words.
For example:
MyString <- "temelproblem"
After splitting with my function I get a dataframe like this;
Data <- data.frame(
myword = c("te","tem","teme","temel","em","eme","emel","me","mel","el","pr","problem","em"),
start = c(1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 11),
finish = c(2, 3, 4, 5, 3, 4, 5, 4, 5, 5, 7, 12, 12)
)
> Data
myword start finish
1 te 1 2
2 tem 1 3
3 teme 1 4
4 temel 1 5
5 em 2 3
6 eme 2 4
7 emel 2 5
8 me 3 4
9 mel 3 5
10 el 4 5
11 pr 6 7
12 problem 6 12
13 em 11 12
I need all possible combinations and the rule is; next word should start after previous word finish. From this sample I sould get;
"tem" "el" "problem"
"temel" "problem"
I will be grateful for guiding ideas...
r loops dataframe
asked Nov 13 '18 at 22:08
BoraxBorax
284
add a comment |
I have a function which extracts all meaningful words from a string. After this, I would like to create all possible sentences from these words.
For example:
MyString <- "temelproblem"
After splitting with my function I get a dataframe like this;
Data <- data.frame(
myword = c("te","tem","teme","temel","em","eme","emel","me","mel","el","pr","problem","em"),
start = c(1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 11),
finish = c(2, 3, 4, 5, 3, 4, 5, 4, 5, 5, 7, 12, 12)
)
> Data
myword start finish
1 te 1 2
2 tem 1 3
3 teme 1 4
4 temel 1 5
5 em 2 3
6 eme 2 4
7 emel 2 5
8 me 3 4
9 mel 3 5
10 el 4 5
11 pr 6 7
12 problem 6 12
13 em 11 12
I need all possible combinations and the rule is; next word should start after previous word finish. From this sample I sould get;
"tem" "el" "problem"
"temel" "problem"
I will be grateful for guiding ideas...
r loops dataframe
asked Nov 13 '18 at 22:08
BoraxBorax
284
1
how many sub-words ? your first example you have three sub-word, and in your second examples you have two. Can you clarify that in your question ?
– user702846
Nov 13 '18 at 22:16
Number of sub-words are not important. Only rule is start-finish continuity. First combination is: tem(1:3)-el(4:5)-problem(6:12) and the second is: temel(1:5)-problem(6:12).
– Borax
Nov 13 '18 at 22:24
add a comment |
I have a function which extracts all meaningful words from a string. After this, I would like to create all possible sentences from these words.
For example:
MyString <- "temelproblem"
After splitting with my function I get a dataframe like this;
Data <- data.frame(
myword = c("te","tem","teme","temel","em","eme","emel","me","mel","el","pr","problem","em"),
start = c(1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 11),
finish = c(2, 3, 4, 5, 3, 4, 5, 4, 5, 5, 7, 12, 12)
)
> Data
myword start finish
1 te 1 2
2 tem 1 3
3 teme 1 4
4 temel 1 5
5 em 2 3
6 eme 2 4
7 emel 2 5
8 me 3 4
9 mel 3 5
10 el 4 5
11 pr 6 7
12 problem 6 12
13 em 11 12
I need all possible combinations and the rule is; next word should start after previous word finish. From this sample I sould get;
"tem" "el" "problem"
"temel" "problem"
I will be grateful for guiding ideas...
r loops dataframe
asked Nov 13 '18 at 22:08
BoraxBorax
284
I have a function which extracts all meaningful words from a string. After this, I would like to create all possible sentences from these words.
For example:
MyString <- "temelproblem"
After splitting with my function I get a dataframe like this;
Data <- data.frame(
myword = c("te","tem","teme","temel","em","eme","emel","me","mel","el","pr","problem","em"),
start = c(1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 11),
finish = c(2, 3, 4, 5, 3, 4, 5, 4, 5, 5, 7, 12, 12)
)
> Data
myword start finish
1 te 1 2
2 tem 1 3
3 teme 1 4
4 temel 1 5
5 em 2 3
6 eme 2 4
7 emel 2 5
8 me 3 4
9 mel 3 5
10 el 4 5
11 pr 6 7
12 problem 6 12
13 em 11 12
I need all possible combinations and the rule is; next word should start after previous word finish. From this sample I sould get;
"tem" "el" "problem"
"temel" "problem"
I will be grateful for guiding ideas...
r loops dataframe
r loops dataframe
asked Nov 13 '18 at 22:08
BoraxBorax
284
asked Nov 13 '18 at 22:08
BoraxBorax
284
asked Nov 13 '18 at 22:08
BoraxBorax
284
asked Nov 13 '18 at 22:08
BoraxBorax
284
asked Nov 13 '18 at 22:08
BoraxBorax
284
284
1
how many sub-words ? your first example you have three sub-word, and in your second examples you have two. Can you clarify that in your question ?
– user702846
Nov 13 '18 at 22:16
Number of sub-words are not important. Only rule is start-finish continuity. First combination is: tem(1:3)-el(4:5)-problem(6:12) and the second is: temel(1:5)-problem(6:12).
– Borax
Nov 13 '18 at 22:24
add a comment |
1
how many sub-words ? your first example you have three sub-word, and in your second examples you have two. Can you clarify that in your question ?
– user702846
Nov 13 '18 at 22:16
Number of sub-words are not important. Only rule is start-finish continuity. First combination is: tem(1:3)-el(4:5)-problem(6:12) and the second is: temel(1:5)-problem(6:12).
– Borax
Nov 13 '18 at 22:24
1
1
how many sub-words ? your first example you have three sub-word, and in your second examples you have two. Can you clarify that in your question ?
– user702846
Nov 13 '18 at 22:16
how many sub-words ? your first example you have three sub-word, and in your second examples you have two. Can you clarify that in your question ?
– user702846
Nov 13 '18 at 22:16
Number of sub-words are not important. Only rule is start-finish continuity. First combination is: tem(1:3)-el(4:5)-problem(6:12) and the second is: temel(1:5)-problem(6:12).
– Borax
Nov 13 '18 at 22:24
Number of sub-words are not important. Only rule is start-finish continuity. First combination is: tem(1:3)-el(4:5)-problem(6:12) and the second is: temel(1:5)-problem(6:12).
– Borax
Nov 13 '18 at 22:24
add a comment |
0
active
oldest
votes
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%2f53290239%2fr-find-all-possible-combinations-splitted-word%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f53290239%2fr-find-all-possible-combinations-splitted-word%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
1
how many sub-words ? your first example you have three sub-word, and in your second examples you have two. Can you clarify that in your question ?
– user702846
Nov 13 '18 at 22:16
Number of sub-words are not important. Only rule is start-finish continuity. First combination is: tem(1:3)-el(4:5)-problem(6:12) and the second is: temel(1:5)-problem(6:12).
– Borax
Nov 13 '18 at 22:24