Databases
StackOverflow2013
Postsdbo
POC# check given word to answer word
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POC# check given word to answer word
    primarykey
    data
    text
    <p>I'm making a simple spell checker for C#, I want to try and compare a given answer to the randomly chosen word.</p> <p>I want to compare the first letter to all the letters given in the answer so I can tell if it's correct, it's there was a swap of letters, a deletion or an added letter. I would ultimately like to be able to tell if only one letter was wrong to see a substitution was used.</p> <p>For example, correct answer hello:</p> <pre><code> checking first letter ~H h e l l o 1 0 0 0 0 h h e l l o 1 1 0 0 0 0 e l l o 0 0 0 0 </code></pre> <p>Then go through it for the second letter.</p> <p>I've absolutely no idea when it comes to C#.</p> <p>I've tried </p> <pre><code>int CheckErrors(string Answer, string Guess) { if (Answer == Guess) { return 1; } if (Answer == null || Guess == null) { return -1; } for (int i = 0; i &lt;= Answer.Length; i++) { if (Guess[i] != Answer[i]) { count++; //substitution = -4 //deletion = -5 //transposition = -6 //insertion = -7 } return count; } return -9; } </code></pre> <p>but I just can't get any further.</p> <p>UPDATE:</p> <p>with further research I guess what I was trying to do is something like:</p> <pre><code>STRING answer = answer_given STRING input = correct_answer int check = 0; FOR (int i = 0; i &lt; input.Length; i++) { FOR (int ii = 0; ii &lt; answer.Length; ii++) { if (input[i] == answer[i]) { int check++; } } } </code></pre> <p>Obviously I know this would keep adding check up, but I can't guess what how else to do it.</p> <p>ANOTHER UPDATE!</p> <p>I can use this-</p> <pre><code>int CheckErrors(string Answer, string Guess) { int[,] d = new int[Answer.Length + 1, Guess.Length + 1]; for (int i = 0; i &lt;= Answer.Length; i++) d[i, 0] = i; for (int j = 0; j &lt;= Guess.Length; j++) d[0, j] = j; for (int j = 1; j &lt;= Guess.Length; j++) for (int i = 1; i &lt;= Answer.Length; i++) if (Answer[i - 1] == Guess[j - 1]) d[i, j] = d[i - 1, j - 1]; //no operation else d[i, j] = Math.Min(Math.Min( d[i - 1, j] + 1, //a deletion d[i, j - 1] + 1), //an insertion d[i - 1, j - 1] + 1 //a substitution ); return d[Answer.Length, Guess.Length]; } </code></pre> <p>But I need a way to do a count for the amount of times each error is used?</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USSjrsmile
    1. USSjrsmile
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POC# check given word to answer word
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POC# check given word to answer word
      1. USuser1988332
      1. VTFavorite
    1. COWell, just glancing at your code, you never declare count, so that won't compile. Even with count, your function will always return either 0(Answer[0] and Guess[0] were equal), 1(Answer[0] and Guess[0] were not equal), or -9(Answer[0]'s length is 0) once it gets to the for loop. Try pseudo-coding out some of your logic, both for yourself and for us to help you with (in your question, not as a comment).
      singulars
      1. POC# check given word to answer word
      1. USTory
    2. COSee [Wikipedia Levenshtein distance](http://en.wikipedia.org/wiki/Levenshtein_distance) and [Rosetta Code](http://rosettacode.org/wiki/Levenshtein_distance#C.23) for an implementation.
      singulars
      1. POC# check given word to answer word
      1. USAustin Salonen
    3. CO@Austin I did have a look at it, but I couldn't find an example I could understand to use it. But with the Rosetta link that really helps, seeing I can use it now. Thank you.
      singulars
      1. POC# check given word to answer word
      1. USSjrsmile
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload