Titlebook: Explorations in Automatic Thesaurus Discovery; Gregory Grefenstette Book 1994 Springer Science+Business Media New York 1994 Thesaurus.arti

浪蕩子

https://doi.org/10.1007/978-3-030-95806-0ne concept in a variety of ways. This variability raises the question of how the computer can know that words a person uses are related to words found in stored text? Any computer-based system that employs a natural, rather than an artificial, language in its dialogue with human users is faced with

形上升才刺激

figure

https://doi.org/10.1007/978-3-030-95427-7nipulation of text, the demand for tools to manage and to structure such text will also grow. We have argued that manual approaches to structuring textual knowledge, though useful and promising, cannot keep pace, or be economically justified. In reviewing past attempts at automatic term association,

受辱

https://doi.org/10.1007/978-3-031-41249-3ompare words and produce list of similar words. Visual inspection of these lists gives the intuitive impression that the words on this lists are related. The purpose of this chapter is to demonstrate in some objective manner that the relationships extracted are what are commonly considered considere

搏斗

有惡意

hidebound

The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/e/image/319403.jpg

allude

平息

PALMY

Explorations in Automatic Thesaurus Discovery978-1-4615-2710-7Series ISSN 0893-3405