Báo cáo khoa học: "Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering" ppt

... July 2006. c 2006 Association for Computational Linguistics Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering Chris Biemann University of Leipzig, NLP Department Augustusplatz ... Germany biem@informatik.uni-leipzig.de Abstract An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in c...

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

... word of the argument, and (iii) pos-head: Part-of-Speech tag of head. Algorithm 1 describes the generative story of our model and Figure 1 illustrates it graphically. Given a predicate and its voice, ... give the results of three methods on this task. In terms of F1 score, the La- tent Logistic and Graph Partitioning methods result in slight reduction in performance over the baseline, whi...

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

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

... Arabic side of the corpus and then merging or deleting Arabic morphemes us- ing alignments with a part-of-speech tagged En- glish corpus. But this method is not completely unsupervised since it

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

... Tasks for Arabic We define the task of morphological tagging as choosing an inflectional morphological tag (in this paper, the term “morphological tagging never refers to derivational morphology). ... this paper, we investigate three variants of the morphological tagging tasks: MorphPOS (determining the feature POS, which is the core part-of-speech – verb, noun, adjective, etc.); MorphPa...

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

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

... variety of approaches used. (Hearst, 1994) uses a measure of lexical cohesion between adjoining paragraphs in text; (Reynar, 1999) and (Beeferman et al., 1999) combine a variety of features such as ... θ (u−1) ) = ( δ(θ (u) , θ (u−1) ) c u = 0 Γ(T α) Γ(α) T Q T t=1 (θ (u) t ) α−1 c u = 1 18 Figure 1: Graphical models indicating the dependencies among variables in (a) the topic segmentation mo...

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

... Space We represent each context vector of entity pair as a node in an undirected graph. Each edge (i,j) in the graph is assigned a weight that reflects the similarity between two context vectors ... partition of the graph so that entity pairs that are more similar to each other, e.g. labeled by the same relation type, belong to the same cluster. As a relaxation of such NP-hard discrete g...

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

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

... DA tagging has been studied a lot previ- ously. For example, in (Stolcke et al., 2000), Hidden Markov Models (HMMs) were used for DA tagging; in (Ji and Bilmes, 2005), different types of graphical models ... features. Table 2: Features Used in Sentence Type Tagging. 3.1.2 Sentence Type Tagging Features We used various types of feature functions in sen- tence type tagging. Table 2 sho...

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