On some optimization heuristics for lesk-like WSD algorithms
- Authors
- Gelbukh, A.; Sidorov, G.; Han, S.-Y.
- Issue Date
- Jun-2005
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- NATURAL LANGUAGE PROCESSING AND INFORMATION SYSTEMS, PROCEEDINGS, v.3513, pp 402 - 405
- Pages
- 4
- Journal Title
- NATURAL LANGUAGE PROCESSING AND INFORMATION SYSTEMS, PROCEEDINGS
- Volume
- 3513
- Start Page
- 402
- End Page
- 405
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/53242
- DOI
- 10.1007/11428817_47
- ISSN
- 0302-9743
1611-3349
- Abstract
- For most English words, dictionaries give various senses: e.g., "bank" can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a given text has crucial importance in many applications of text processing, such as information retrieval or machine translation: e.g., "(my account in the) bank" is to be translated into Spanish as "(mi cuenta en el) banco" whereas "(on the) bank (of the lake)" as "(en la) orilla (del logo)." To choose the optimal combination of the intended senses of all words, Lesk suggested to consider the global coherence of the text, i.e., which we mean the average relatedness between the chosen senses for an words in the text. Due to high dimensionality of the search space, heuristics are to be used to find a near-optimal configuration. In this paper, we discuss several such heuristics that differ in terms of complexity and quality of the results. In particular, we introduce a dimensionality reduction algorithm that reduces the complexity of computationally expensive approaches such as genetic algorithms.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Da Vinci College of General Education > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/53242)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.