# An Efficient Inductive Unsupervised Semantic Tagger

Source: [An Efficient Inductive Unsupervised Semantic Tagger](<https://www.sota2.com/research/paper/68fa5fd31e209131ce9ec128>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:26:47.341Z

Authors: K T Lua

Published: 1996-06-11T06:20:46.000Z

## Abstract

We report our development of a simple but fast and efficient inductive unsupervised semantic tagger for Chinese words. A POS hand-tagged corpus of 348,000 words is used. The corpus is being tagged in two steps. First, possible semantic tags are selected from a semantic dictionary(Tong Yi Ci Ci Lin), the POS and the conditional probability of semantic from POS, i.e., P(S\|P). The final semantic tag is then assigned by considering the semantic tags before and after the current word and the semantic-word conditional probability P(S\|W) derived from the first step. Semantic bigram probabilities P(S\|S) are used in the second step. Final manual checking shows that this simple but efficient algorithm has a hit rate of 91%. The tagger tags 142 words per second, using a 120 MHz Pentium running FOXPRO. It runs about 2.3 times faster than a Viterbi tagger.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/cmp-lg/9606012>)

[PDF](<https://arxiv.org/pdf/cmp-lg/9606012.pdf>)
