TAILIEUCHUNG - Báo cáo khoa học: "An efficient algorithm for building a distributional thesaurus (and other Sketch Engine developments)"

Gorman and Curran (2006) argue that thesaurus generation for billion+-word corpora is problematic as the full computation takes many days. We present an algorithm with which the computation takes under two hours. We have created, and made publicly available, thesauruses based on large corpora for (at time of writing) seven major world languages. The development is implemented in the Sketch Engine (Kilgarriff et al., 2004). | An efficient algorithm for building a distributional thesaurus and other Sketch Engine developments Pavel Rychly Masaryk University Brno Czech Republic pary@ z Adam Kilgarriff Lexical Computing Ltd Brighton UK adam@ Abstract Gorman and Curran 2006 argue that thesaurus generation for billion -word corpora is problematic as the full computation takes many days. We present an algorithm with which the computation takes under two hours. We have created and made publicly available thesauruses based on large corpora for at time of writing seven major world languages. The development is implemented in the Sketch Engine Kilgarriff et al. 2004 . Another innovative development in the same tool is the presentation of the grammatical behaviour of a word against the background of how all other words of the same word class behave. Thus the English noun constraint occurs 75 in the plural. Is this a salient lexical fact To form a judgement we need to know the distribution for all nouns. We use histograms to present the distribution in a way that is easy to grasp. 1 Thesaurus creation Over the last ten years interest has been growing in distributional thesauruses hereafter simply thesauruses . Following initial work by Sparck Jones 1964 and Grefenstette 1994 an early online distributional thesaurus presented in Lin 1998 has been widely used and cited and numerous authors since have explored thesaurus properties and parameters see survey component of Weeds and Weir 2005 . 41 A thesaurus is created by taking a corpus identifying contexts for each word identifying which words share contexts. For each word the words that share most contexts according to some statistic which also takes account of their frequency are its nearest neighbours. Thesauruses generally improve in accuracy with corpus size. The larger the corpus the more clearly the signal of similar words will be distinguished from the noise of words that just happen to share a few contexts . Lin s was

• Báo cáo khoa học
• An efficient algorithm
• building a distributional thesaurus
• Sketch Engine developments
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• The Memory Architecture
• Efficient Pattern Matching Algorithm
• Review of AC algorithm
• The Hardware architecture
• The Related researches
• The Experimental results
• Sequential Labeling
• Latent Variables
• An Exact Inference Algorithm
• Its Efficient Approximation
• scientific reports
• model language
• process natural language
• báo cáo hóa học
• công trình nghiên cứu về hóa học
• tài liệu về hóa học
• cách trình bày báo cáo