I don't know which of AI branch is will solve my problem [on hold]











up vote
-1
down vote

favorite












What should I use, machine learning, text analysis or pattern recognition if I have a set of words and I want to find a pattern between them and then look for this pattern in a long text?






database android-studio artificial-intelligence







share|improve this question







New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











put on hold as primarily opinion-based by sascha, legoscia, Rob, GhostCat, mrpatg 13 hours ago


Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.















  • This is a really vague question. It completely depends on what patterns you are looking for and what type of text. Could you define the problem more specifically? Perhaps, give some examples of what you mean, I think it will help greatly in getting an answer.
    – jfaucett
    18 hours ago










  • thanks for replay.. The idea is some English words have the same letters in them, like aim, aid, bail, bait ... etc and I’m not sure what to use to find the pattern between them which are the letters ai. After that whenever I would enter a text ( for example a book) it would find all the words that have (ai) in them
    – user6775268
    17 hours ago















up vote
-1
down vote

favorite












What should I use, machine learning, text analysis or pattern recognition if I have a set of words and I want to find a pattern between them and then look for this pattern in a long text?






database android-studio artificial-intelligence







share|improve this question







New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











put on hold as primarily opinion-based by sascha, legoscia, Rob, GhostCat, mrpatg 13 hours ago


Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.















  • This is a really vague question. It completely depends on what patterns you are looking for and what type of text. Could you define the problem more specifically? Perhaps, give some examples of what you mean, I think it will help greatly in getting an answer.
    – jfaucett
    18 hours ago










  • thanks for replay.. The idea is some English words have the same letters in them, like aim, aid, bail, bait ... etc and I’m not sure what to use to find the pattern between them which are the letters ai. After that whenever I would enter a text ( for example a book) it would find all the words that have (ai) in them
    – user6775268
    17 hours ago













up vote
-1
down vote

favorite









up vote
-1
down vote

favorite











What should I use, machine learning, text analysis or pattern recognition if I have a set of words and I want to find a pattern between them and then look for this pattern in a long text?






database android-studio artificial-intelligence







share|improve this question







New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











What should I use, machine learning, text analysis or pattern recognition if I have a set of words and I want to find a pattern between them and then look for this pattern in a long text?






database android-studio artificial-intelligence




database android-studio artificial-intelligence






share|improve this question







New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question







New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question






New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 19 hours ago









user6775268

1




1




New contributor




user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






user6775268 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




put on hold as primarily opinion-based by sascha, legoscia, Rob, GhostCat, mrpatg 13 hours ago


Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.






put on hold as primarily opinion-based by sascha, legoscia, Rob, GhostCat, mrpatg 13 hours ago


Many good questions generate some degree of opinion based on expert experience, but answers to this question will tend to be almost entirely based on opinions, rather than facts, references, or specific expertise. If this question can be reworded to fit the rules in the help center, please edit the question.














  • This is a really vague question. It completely depends on what patterns you are looking for and what type of text. Could you define the problem more specifically? Perhaps, give some examples of what you mean, I think it will help greatly in getting an answer.
    – jfaucett
    18 hours ago










  • thanks for replay.. The idea is some English words have the same letters in them, like aim, aid, bail, bait ... etc and I’m not sure what to use to find the pattern between them which are the letters ai. After that whenever I would enter a text ( for example a book) it would find all the words that have (ai) in them
    – user6775268
    17 hours ago


















  • This is a really vague question. It completely depends on what patterns you are looking for and what type of text. Could you define the problem more specifically? Perhaps, give some examples of what you mean, I think it will help greatly in getting an answer.
    – jfaucett
    18 hours ago










  • thanks for replay.. The idea is some English words have the same letters in them, like aim, aid, bail, bait ... etc and I’m not sure what to use to find the pattern between them which are the letters ai. After that whenever I would enter a text ( for example a book) it would find all the words that have (ai) in them
    – user6775268
    17 hours ago
















This is a really vague question. It completely depends on what patterns you are looking for and what type of text. Could you define the problem more specifically? Perhaps, give some examples of what you mean, I think it will help greatly in getting an answer.
– jfaucett
18 hours ago




This is a really vague question. It completely depends on what patterns you are looking for and what type of text. Could you define the problem more specifically? Perhaps, give some examples of what you mean, I think it will help greatly in getting an answer.
– jfaucett
18 hours ago












thanks for replay.. The idea is some English words have the same letters in them, like aim, aid, bail, bait ... etc and I’m not sure what to use to find the pattern between them which are the letters ai. After that whenever I would enter a text ( for example a book) it would find all the words that have (ai) in them
– user6775268
17 hours ago




thanks for replay.. The idea is some English words have the same letters in them, like aim, aid, bail, bait ... etc and I’m not sure what to use to find the pattern between them which are the letters ai. After that whenever I would enter a text ( for example a book) it would find all the words that have (ai) in them
– user6775268
17 hours ago












1 Answer
1






active

oldest

votes

















up vote
0
down vote













I would build the n-grams of all the words.



from nltk import ngrams

from collections import Counter



words = ["aim", "aid", "bail", "bait"]





def build_ngrams(words, from_size, to_size):

    word_ngrams = 



    for word in words:

        for ngram_size in range(from_size, to_size + 1):

            ng = ngrams(word, ngram_size)

            word_ngrams.extend(ng)



    return word_ngrams





# construct all bigrams and trigrams

word_ngrams = build_ngrams(words, 2, 3)



# find the most common n-grams

counter = Counter(word_ngrams)

print(counter.most_common(3))


This will give you the most common patterns, and you can use that later for your search.






share|improve this answer





















  • Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
    – user6775268
    12 hours ago










  • Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
    – jfaucett
    9 hours ago


















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
0
down vote













I would build the n-grams of all the words.



from nltk import ngrams

from collections import Counter



words = ["aim", "aid", "bail", "bait"]





def build_ngrams(words, from_size, to_size):

    word_ngrams = 



    for word in words:

        for ngram_size in range(from_size, to_size + 1):

            ng = ngrams(word, ngram_size)

            word_ngrams.extend(ng)



    return word_ngrams





# construct all bigrams and trigrams

word_ngrams = build_ngrams(words, 2, 3)



# find the most common n-grams

counter = Counter(word_ngrams)

print(counter.most_common(3))


This will give you the most common patterns, and you can use that later for your search.






share|improve this answer





















  • Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
    – user6775268
    12 hours ago










  • Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
    – jfaucett
    9 hours ago















up vote
0
down vote













I would build the n-grams of all the words.



from nltk import ngrams

from collections import Counter



words = ["aim", "aid", "bail", "bait"]





def build_ngrams(words, from_size, to_size):

    word_ngrams = 



    for word in words:

        for ngram_size in range(from_size, to_size + 1):

            ng = ngrams(word, ngram_size)

            word_ngrams.extend(ng)



    return word_ngrams





# construct all bigrams and trigrams

word_ngrams = build_ngrams(words, 2, 3)



# find the most common n-grams

counter = Counter(word_ngrams)

print(counter.most_common(3))


This will give you the most common patterns, and you can use that later for your search.






share|improve this answer





















  • Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
    – user6775268
    12 hours ago










  • Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
    – jfaucett
    9 hours ago













up vote
0
down vote










up vote
0
down vote









I would build the n-grams of all the words.



from nltk import ngrams

from collections import Counter



words = ["aim", "aid", "bail", "bait"]





def build_ngrams(words, from_size, to_size):

    word_ngrams = 



    for word in words:

        for ngram_size in range(from_size, to_size + 1):

            ng = ngrams(word, ngram_size)

            word_ngrams.extend(ng)



    return word_ngrams





# construct all bigrams and trigrams

word_ngrams = build_ngrams(words, 2, 3)



# find the most common n-grams

counter = Counter(word_ngrams)

print(counter.most_common(3))


This will give you the most common patterns, and you can use that later for your search.






share|improve this answer












I would build the n-grams of all the words.



from nltk import ngrams

from collections import Counter



words = ["aim", "aid", "bail", "bait"]





def build_ngrams(words, from_size, to_size):

    word_ngrams = 



    for word in words:

        for ngram_size in range(from_size, to_size + 1):

            ng = ngrams(word, ngram_size)

            word_ngrams.extend(ng)



    return word_ngrams





# construct all bigrams and trigrams

word_ngrams = build_ngrams(words, 2, 3)



# find the most common n-grams

counter = Counter(word_ngrams)

print(counter.most_common(3))


This will give you the most common patterns, and you can use that later for your search.







share|improve this answer












share|improve this answer



share|improve this answer










answered 14 hours ago









jfaucett

47339




47339












  • Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
    – user6775268
    12 hours ago










  • Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
    – jfaucett
    9 hours ago


















  • Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
    – user6775268
    12 hours ago










  • Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
    – jfaucett
    9 hours ago
















Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
– user6775268
12 hours ago




Ok thanks !! I will try it. by the way, this is my first time to deal with python language, so maybe I will take some time to test the code. and thanks again for your answer. the last question, if I want to do something like this code in an android studio, can be or not?
– user6775268
12 hours ago












Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
– jfaucett
9 hours ago




Yea definitely writing your own ngram function is really easy. You just iterate over a sequence creating all the tuples of size N you want. Then you have all the tuples in a list and can frequency count them to get the most common.
– jfaucett
9 hours ago



-

Popular posts from this blog

Florida Star v. B. J. F.

Image
Florida Star v. B. J. F. From Wikipedia, the free encyclopedia Jump to navigation Jump to search United States Supreme Court case Florida Star v. B. J. F. Supreme Court of the United States Argued March 21, 1989 Decided June 21, 1989 Full case name The Florida Star v. B. J. F. Citations 491 U.S. 524 ( more ) 109 S. Ct. 2603; 105 L. Ed. 2d 443; 1989 U.S. LEXIS 3120; 57 U.S.L.W. 4816; 16 Media L. Rep. 1801 Prior history The Florida Star v. B.J.F., 530 So.2d 286 (1988) Supreme Court of Florida; Florida Star v. B.J.F., 499 So.2d 883 (1986) Fla. Dist. Court of Appeals Holding Florida Stat. § 794.03 is unconstitutional to the extent it makes the truthful reporting of information that was a matter of public record unlawful, as it violates the First Amendment. Court membership Chief Justice William Rehnquist Associate Justices William J. Brennan Jr.  · Byron White Thurgood Marshall  · Harry Blac
Read more

Error while running script in elastic search , gateway timeout

Image
0 while running script in elastic search, I got 504 Gateway timeout error. { "query": { "bool": { "filter": { "script": { "script": " doc['creted_date'].date.getMonthOfYear() == 12 " } } } }, "aggs": { "test": { "date_histogram": { "field": "creted_date", "interval": "month", "format": "MMM" }, "aggs": { "cost": { "sum": { "field": "cost" } } }
Read more

Adding quotations to stringified JSON object values

Image
0 My stringified object data doesn't include quotation marks around object values, which errors when attempting JSON.parse() : '{ "affiliation": CORPORATE, "userId": 75c35d1c-5d12-4485-8fa8-b2f1551a3e6e }' I need the string to be: '{ "affiliation": "CORPORATE", "userId": "75c35d1c-5d12-4485-8fa8-b2f1551a3e6e" }' I'm using this regex to add quotes to the object keys: var newStr = str.replace(/(['"])?([a-z0-9A-Z_]+)(['"])?:/g, '"$2": '); For instance: '{ affiliation: CORPORATE }' to '{ "affiliation": CORPORATE }' There are only string values in my data, so I don't need to check value types. How can I alter my regex expression to add quotations to
Read more