Efficiently representing word sense probabilities

Word sense probabilities are compressed for storage in a semantic index. Each word sense for a word is mapped to one of a number of "buckets" by assigning a bucket score to the word sense. A scoring function is utilized to assign the bucket scores that maximizes the entropy of the assigned...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Snow, Rion, Thione, Giovanni Lorenzo, Waterman, Scott A, Walters, Chad, Converse, Timothy
Format: Patent
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Word sense probabilities are compressed for storage in a semantic index. Each word sense for a word is mapped to one of a number of "buckets" by assigning a bucket score to the word sense. A scoring function is utilized to assign the bucket scores that maximizes the entropy of the assigned bucket scores. Once the bucket scores have been assigned to the word senses, the bucket scores are stored in the semantic index. The bucket scores stored in the semantic index may be utilized to prune one or more of the word senses prior to construction of the semantic index. The bucket scores may also be utilized to prune and rank the word senses at the time a query is performed using the semantic index.