# Difference between revisions of "WNImage:Jonathan's Lab Notes"

From CSWiki

(→5/6/06) |
|||

Line 3: | Line 3: | ||

* Wrote a brute force synset ranker. | * Wrote a brute force synset ranker. | ||

* It might be extremely slow. Think about using something like a HMM to get approximate rankings. | * It might be extremely slow. Think about using something like a HMM to get approximate rankings. | ||

+ | * Read up on HMM. Also consider a simple gradient descent algorithm. Since the optimal synset must connected to one of the keywords, we just start walking from each of the keywords. | ||

== 5/5/06 == | == 5/5/06 == |

## Revision as of 17:33, 6 May 2006

## 5/6/06

- Updated the code to generate a weighted Xsynset.
- Wrote a brute force synset ranker.
- It might be extremely slow. Think about using something like a HMM to get approximate rankings.
- Read up on HMM. Also consider a simple gradient descent algorithm. Since the optimal synset must connected to one of the keywords, we just start walking from each of the keywords.

## 5/5/06

- Updated the database to use the new structures.
- Regenerated the database.
- Updated the web documentation.