updated docs

--HG--
extra : convert_revision : svn%3Afdd8eb12-d10e-0410-9acb-85c331704f74/trunk%404193
This commit is contained in:
Davis King 2011-03-23 23:44:08 +00:00
parent 4b2ab507f7
commit ef4523f34c
1 changed files with 1 additions and 1 deletions

View File

@ -679,7 +679,7 @@ subject to the following constraint:
A structural SVM, on the other hand, can learn to predict outputs as complex A structural SVM, on the other hand, can learn to predict outputs as complex
as entire parse trees. To do this, it learns a function F(x,y) which measures as entire parse trees. To do this, it learns a function F(x,y) which measures
how well a particular data sample x matches a label y. When used for prediction, how well a particular data sample x matches a label y. When used for prediction,
the best label for an x is then given by the y which maximizes F(x,y). the best label for a new x is then given by the y which maximizes F(x,y).
<br/> <br/>
<br/> <br/>