Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

Báo cáo khoa học: "A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots" docx

... A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots Anne N. DE ROECK Department of Computer Science University ... present a clustering algorithm for Arabic words sharing the same root. Root based clusters can substitute dictionaries in indexing for IR. Modifying Adamson and Boreham (1974), our Two-stage algorithm applies ... 4.1.1). 4 The T...

Ngày tải lên: 17/03/2014, 07:20

8 263 0
Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot

Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot

... the intended referent(s). Several algorithms have been developed for this purpose, differing in terms of computational efficiency, quality and coverage. For identifying sets of objects rather ... expensive. Mediating between these extreme control regimes, we propose a best-first searching algorithm for uniquely identifying sets of objects. We incorporate linguistically motivated...

Ngày tải lên: 22/02/2014, 02:20

4 672 3
Báo cáo khoa học: "A Multi-Document Summarization System for Scientific Article" docx

Báo cáo khoa học: "A Multi-Document Summarization System for Scientific Article" docx

... Frequent Term based text clustering. 3.3 Frequent Term Based Clustering The clustering module employs Frequent Term Based Clustering (Beil et al., 2002). For each co- citation, we use this clustering technique ... such clusters is generated, which allows for swift navigation between topics of interest for a user (Figure 3). This summary is tremendously useful as it informs the...

Ngày tải lên: 17/03/2014, 00:20

6 343 0
Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx

Báo cáo khoa học: "A Beam-Search Extraction Algorithm for Comparable Data" pptx

... defin- ing the feature vector is needed for the search in Section 3: the contribution of the ’negative’ fea- tures for c = 0 is only computed when Eq. 1 is evaluated for the highest scoring final hypothesis in ... (Munteanu and Marcu, 2005). For a given source sentence S, a max- imum entropy (ME) classifier is applied to a large set of candidate target transla- tions . A beam-search alg...

Ngày tải lên: 17/03/2014, 02:20

4 404 0
Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc

Báo cáo khoa học: "A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces" doc

... efficient PFS algorithm. At the beginning of each round for feature se- lection, a uniform prior distribution is always assumed for the new CME model. A more pre- cise description of the PFS algorithm ... other machine learning algorithms as well. 4 Experiments with PFS for Edit Re- gion Identification In this section, we will demonstrate the benefits of the PFS algorithm fo...

Ngày tải lên: 17/03/2014, 04:20

8 388 0
Báo cáo khoa học: "A Generative Constituent-Context Model for Improved Grammar Induction" docx

Báo cáo khoa học: "A Generative Constituent-Context Model for Improved Grammar Induction" docx

... Constituent-Context Model for Improved Grammar Induction Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA 94305-9040 {klein, manning}@cs.stanford.edu Abstract We ... multinomial distributions over the set of all possible yields: one for constituents (B ij = c) and one for distituents (B ij = d). Similarly for P(x ij |B ij ) and contexts...

Ngày tải lên: 17/03/2014, 08:20

8 316 0
Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot

Báo cáo khoa học: " A simple pattern-matching algorithm for recovering empty nodes and their antecedents∗" pot

... A simple pattern-matching algorithm for recovering empty nodes and their antecedents ∗ Mark Johnson Brown Laboratory for Linguistic Information Processing Brown University Mark Johnson@Brown.edu Abstract This ... a simple pattern- matching algorithm for recovering empty nodes and identifying their co-indexed an- tecedents in phrase structure trees that do not contain this informat...

Ngày tải lên: 17/03/2014, 08:20

8 347 0
Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf

Báo cáo khoa học: "A Trainable Rule-based Algorithm for Word Segmentation" pdf

... adopting it for word segmentation. For example, since word seg- mentation is merely a preprocessing task for a wide variety of further tasks such as parsing, information extraction, and information ... therefore need only define an appropriate rule syntax for transforming this initial approxima- 3The "existing" algorithm does not need to be a large or even accurate s...

Ngày tải lên: 17/03/2014, 23:20

8 470 0
Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot

Báo cáo khoa học: "A Polynomial-Time Parsing Algorithm for TT-MCTAG" pot

... with Shared Nodes (Lichte, 2007)), or TT-MCTAG for short. For some of the above formalisms the word recognition problem is NP-hard. This has been shown for non-local MCTAG (Rambow and Satta, 1992), ... derivation tree without deciding, for ev- ery occurrence of some argument β, which of the h(β)-nodes represents its head. Therefore we pro- pose to reformulate (SN-TTL). For a node v...

Ngày tải lên: 23/03/2014, 16:21

9 259 0
Báo cáo khoa học: "A Morphological Analyzer and Generator for the Arabic Dialects" pdf

Báo cáo khoa học: "A Morphological Analyzer and Generator for the Arabic Dialects" pdf

... language for the higher multitape level, the new Morphtools for- mat. Specification in the Morphtools format of different types of information such as rules or context-free grammars for morpheme ... morphological analyzer and generator for the Arabic lan- guage family. Our work is novel in that it explicitly addresses the need for pro- cessing the morphology of the dialects. MAGEAD...

Ngày tải lên: 23/03/2014, 18:20

8 319 0
w