Markov Chain Algorithm

Question

0.00/5 (No votes)

See more:

Hi everyone,

Does any one has knowledge about Markov Chain in programing in C#. I need to solve an problem, but I have no Idea how to start.

e.x I have text with 100 words. Ok I call it in a rich box or text box. The problem is:

When I write in other text box just one single word, the algorithm should give the other single word that is next.

example I open text '' The weather is very good today.....''

so, when i write word very in text box, the algorithm should reply the word good.

I hope, I was clear.

Thnx a lot.

Posted 11-Oct-13 20:54pm

h7h7h7

Add a Solution

Comments

Andreas Gieriet 12-Oct-13 3:02am

This problem has nothing to do with Markov-Chain, or am I missing something?
Cheers
Andi

h7h7h7 12-Oct-13 3:09am

Hi Andi, Ok how you so can make this solution, any Idea.

Andreas Gieriet 12-Oct-13 3:13am

You must have some rules defined with associated probabilities to happen, based on the current state you are in. Do you have rules and what are the states?
Cheers
Andi
PS: Press the reply button on the right of my name to reply.

h7h7h7 12-Oct-13 3:22am

Andi, I dont have rules. I open e text file in a rich box(now I can see a text). Near to rich box, I put a text boxt to write a word that is in a text, then I put button and all I want is when I click it if a word was ''very'', then application should reply me what is next word..

I write a code to find double word e.x Hi Andi, are you, why not....etc...but I am blocked in a problem above, from one given word, to find wich next...if you want i can write my code for finding double word, maybe it could give you an Idea.

Andreas Gieriet 12-Oct-13 3:52am

I think you must first rephrase your problem for yoursef to get a clear idea what you are after. The task at hand seems to have multiple levels
- you talk about Markov Chains but you seem not to have an idea why this term appears here
- you talk about Rich Text Box and to get text to propose the next word but don't tell if this is the problem (register on key strokes to parse the entered text for getting the current last word?)
- is it the problem to search for the next word once you have the last word of the entered text?

It seems that this is a homework exercise for some intellisense text box with Markov-Chain probabilities of next words (Markov-Chain: it only bases on the last word and not on the whole sentence).
Did you understand the task at all? Can you rephrase the task in your words? Without that it's useless to talk about implementing "something".
And if you have understood the task, post a concrete problem where you struggle. E.g. how to register a keystroke handler on a text box, a concrete problem on parsing the text - not: "how to parse the text", that's your task...
This execise was designed that you can manage it to solve yourself. You won't get ready to use solutions here.
So: concrete question with the small code snippet that makes troubles would help.

Cheers
Andi
PS: You stated at least one rule: after "very" comes "good", no other word is suggested for "very". I.e. in Markov-Chain terms: from the "very"-state, you have 100% probability for "good" and 0% probability for any other word. And a second rule: any other word has 0% probability for any other next word (i.e. you do not suggest any under these conditions). Maybe you have more rules.

h7h7h7 12-Oct-13 4:46am

if there in a text are other word except good show all.....ok a write good in text box and than all the word that are next show me......good can be every where in a text......I am new in C#...and the problem seems to be not so difficult

Andreas Gieriet 12-Oct-13 5:05am

You will not get an answer here to "I have no idea how to start". Read your text book to get an answer or ask your teacher for help.
Andi
PS: Before going to C#, write in pseudo code what the program should do and only then go to codeing C#. This will help understanding the task before going to care about C# details.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Bernhard Hiller · Answer 1 · 2013-10-13T20:59:00

Solution 2

See César de Souza's great article on Hidden Markov models here on CP:
Sequence Classifiers in C# - Part I: Hidden Markov Models[^]

Posted 13-Oct-13 20:59pm

Bernhard Hiller

Richard MacCutchan · Answer 2 · 2013-10-11T21:34:00

Solution 1

This is hardly a complicated problem. Save the text in a string[^] and use the various string methods to search and extract words according to your rules.

Posted 11-Oct-13 21:34pm

Richard MacCutchan