Distributional PartofSpeech Tagging词性标注的分布式部分.pptVIP

Distributional Part-of-Speech Tagging Hinrich Schütze CSLI, Ventura Hall Stanford, CA 94305-4115 , USA email: schuetze@csli.stanford.edu Outline of the Talk Introduction Brief review on the literature Presenting a hypothesis Introducing induction experiments Results Conclusions Discussions Abstract of the Talk This paper presents an algorithm for tagging words whose part-of-speech properties are unknown. This algorithm categorizes word tokens in context. Introduction Why is it needed? Increasing on line texts need to use automatic techniques to analyze a text. Related Works Stochastic Tagging: - Bigram or trigram models: require a relatively large tagged training text (Church, 1989; Charniak et al.,1993) - Hidden Markov Models: require no pretagged text (Jelinek, 1985; Cutting et al., 1991; Kupiec, 1992) Rule-based Tagging: - Transformation-based tagging as introduced by Brill (1993): requires a hand-tagged text for training Other Related Works Using connectionist net to predict words by reflecting grammatical categories (Elman, 1990) Inferring grammatical category from bigram statistics (Brill et al, 1990) Using vector models in which words are clustered according to the similarity of their close neighbors in a corpus (Finch and Chater, 1992; Finch, 1993) Presenting a probabilistic model for entropy maximization that relies on the immediate neighbors of words in a corpus (Kneser and Ney, 1993) Applying factor analysis to collocations of two target words with their immediate neighbors (Biber, 1993) Hypothesis for New Tagging Algorithm The syntactic behavior of a word is represented with respect to its left and right context. Left neighbor ? WORD ? Right neighbor ? ? Left context vector Right context vector 4 POS Tag Induction Experiments Based on word type only Based on word type and context Based on word type and context, restricted to “natural” contexts Based on word type and cont