| |
| | Disambiguation (outline) (Site not responding. Last check: 2007-10-18) |
 | | Assume we have a window [w1,w2,...,W,wi+1,...,wn], in which we want to disambiguate the word W. Let S1, S2,..., Sn be the GermaNet senses for W (each representing a path in one of the Germanet hierarchies), and let c1,..., cm be the classes occurring in these senses. |
 | | For each of the classes, we calculate its probability or weight, and use this value to compute the weights/probs of the senses. |
 | | Here's how to calculate the weight of one class C in c1,...,cm: list:=empty for all words w1...wn do: - compute the relation between W and wi (Here I assume that the POS of the words is in some way contained in the relation) we get a pair (wi,r,W) or (W,r,wi) depending on wi's position. |
| www.dfki.de /~lesch/cooc/tech/disambig.html (178 words) |
|