In this paper we introduce a method for part-of-speech disambiguation of Persian texts, which uses word class probabilities in a relatively small training corpus in order to automatically tag unrestricted Persian texts. The experiment has been carried out in two levels as unigram and bi-gram genotypes disambiguation. Comparing the results gained from the two levels, we show that using immediate right context to which a given word belongs can increase the accuracy rate of the system to a high degree. Keywords: genotype, machine translation, part of speech disambiguation, word class probabilities 1. Introduction In linguistics, the term 'corpus' refers to a relatively large number of raw or annotated words in the body of text. Computational linguists recently turned into corpus-based approaches for solving various linguistic problems such as phrase recognition (Cutting, et al., 1992), word sense disambiguation (Mosavi Miangah & Delavar Khalafi, 2005), building dictionaries, morphological analysis and automatic lemmatization (Masayuki, 2003; Mosavi Miangah, 2006), language teaching (Conrad, 1999), machine translation (Tsutsumi, et al., 1994), information retrieval (Braschler, & Schauble, 2000) and some other problems. Naturally, preparing a tagged or annotated corpus from different points of view has been of great significance for anyone who involves in computational linguistics career. Constructing such an annotated corpus has already been done for many languages including English, Czech, German, Hungarian, French and Arabic to name a few. Automatic part-of-speech (below POS) disambiguation of a large corpus has been studied applying different approaches that we will go through some of them in what follows. To start with Persian, it should be said that corpus-based approaches for text analysis have a rather short history in Persian language. The only serious attempt ever taken in this connection is constructing an interactive POS tagging system developed by Assi and Abdolhosseini (2000). In their project they followed the methods proposed in Schuetze (1995). It is based on the hypothesis that syntactic behavior is reflected in co-occurrence patterns. Therefore, the similarity between two words will be measured with respect to their syntactic behaviors to their left side by the degree to which they share the same neighbors on the left. So, the word types are recognized according to their distributional similarity (their similarity in terms of sharing the same neighbors), and then each category can be manually tagged (Assi, S, M. & Haji Abdolhosseini, M. 2000). In this way a grammatically tagged corpus of Persian was created making up of 45 tags which have designed with reference to the categories normally introduced in dictionaries. Each tag is made up of one to five characters. In general, the accuracy of this kind of distributional POS tagging system proved to be 57.5%. Brill (1992) presents a simple rule-based POS tagger, which automatically acquires its rules and tags with accuracy comparable to stochastic taggers (Brill, E. 1992). Petasis, et al. (1999) study the performance of Transformation-Based Error Driven (TDED) learning for solving POS ambiguity in the Greek language, and examine its dependence on the thematic domain. For their work they trained the Brill tagger (Brill, 1995) over relatively small-sized annotated Greek corpus and found its performance to be around 95% (Petasis, G. et al., 1999). Daelemans, et al. (1996) introduce a memory-based approach to POS tagging. The POS tag of a word in a particular context is extrapolated from the most similar cases held in memory. Using this method, they obtain a tagging accuracy that is on a par with that of known statistical approaches, and with attractive space and time complexity properties when using IGTree, a tree-based formalism for indexing and searching huge case bases (Daelemans, W. et al., 1996). Kempe (2000) presents a method of constructing and applying a cascade consisting of a left and right-sequential finite-state transducer, T 1 and T 2 , for POS disambiguation. In the process of POS tagging, every word is first assigned a unique ambiguity class that represents the set of alternative tags that this word can occur with. The sequence of the ambiguity classes of all words of one