Elamur Research⌕
☰
home / papers / 1991 / Word-Sense Disambiguation Using Statistical Methods

Word-Sense Disambiguation Using Statistical Methods

Summary

Statistical MT systems of this period relied on local models: a trigram language model and a word-alignment translation model. As a result, they mistranslated ambiguous words whenever the deciding context lay more than a couple of words away. For example, French prendre came out as "take" instead of "make" when décision was not adjacent. The authors add a step to the analysis phase that tags each such word with one of two senses before translation. They do not use dictionary senses: a distinction counts only if it predicts a different translation. The training data come from Viterbi alignments of roughly one million short French–English sentence pairs from the Canadian Hansard. For each word, the method checks several candidate context positions and picks the binary question that carries the most mutual information with the word's translation, using the flip-flop algorithm. Applied to frequent words in both languages, the sense labels lowered the translation system's error rate by 13%. The work shows that useful word senses can be learned from parallel text without any lexicon and can directly benefit a downstream application.

Key points

  • Training data: 1,002,165 short sentence pairs from the Canadian Hansard. Their Viterbi alignments produced 12,028,485 word connections, which were used to estimate the joint distribution p(e, f).
  • The question for each word is built with the flip-flop algorithm of Nadas et al. This algorithm uses the splitting theorem of Breiman et al., which finds the best binary split of a vocabulary of size V in linear time instead of searching all 2^V options.
  • Pilot experiment: each of the 500 highest-frequency English words and each of the 200 highest-frequency French words was given two senses.
    • French words could use seven informants: adjacent words, nearest nouns and verbs on either side, and verb tense.
    • English words were limited to the one or two preceding words, because the decoder builds English output left to right.
  • Example information gains:
    • prendre: noun to the right, .381 bits.
    • vouloir: its tense, .349 bits.
    • depuis: next word, .738 bits; it becomes "since" with probability .772 before an article, versus .016 otherwise.
    • English cent: previous word, .378 bits; this separates currency use from "per cent".
  • Integrating the senses into the statistical MT system reduced its error rate by thirteen percent.

Interesting ideas

  • I1. Define senses by translation. A sense distinction matters only if it changes the translation, so senses the target language does not separate are merged. One example is French intérêt, which needs two senses for German but one for English. This task-driven notion of ambiguity could suit Ukrainian–English or Ukrainian–Russian work, where dictionary senses are often too fine or too coarse.
  • I2. Let the data choose the context feature. The method builds one question for each candidate context site (word to the right, nearest noun, verb tense, and so on) and keeps the most informative one. This is a cheap way to discover which piece of context actually resolves a given word, and it transfers to other feature-selection problems.
  • I3. Alternate between two clusterings. The flip-flop procedure switches between splitting the context vocabulary and splitting the word's translations. Each step can only raise the mutual information, so the process converges. This alternating scheme is reusable for any setting where two sets of categories must be grouped to explain each other.
  • I4. Match features to the decoder. English-side questions were restricted to previous words so they would fit a left-to-right generator. A placeholder token (TERM_WORD) handles cases where an informant is missing. Both are practical tricks for adding context features to incremental systems.
  • I5. Measure the gain in bits and in end-task errors. Each question is scored by the entropy reduction it gives on translations, and the whole component is judged by the MT error rate. This makes it clear how much a sense split helps before and after integration.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Natural language processing

Topics: Word sense disambiguation

Cited by

99 papers of our library cite it (of the 140884 whose bibliographies we read); 9 of them have a page here, 90 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.3115/981344.981378

@inproceedings{brown1991word,
  title = {{Word-Sense Disambiguation Using Statistical Methods}},
  author = {Brown, Peter F. and Pietra, Stephen A. Della and Pietra, Vincent J. Della and Mercer, Robert L.},
  booktitle = {29th Annual Meeting of the Association for Computational Linguistics},
  year = {1991},
  doi = {10.3115/981344.981378},
  url = {https://doi.org/10.3115/981344.981378}
}

References

12 references, 1 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. BMd, L., Brown, P., de Souza, P., and Mercer, R. (1989). A tree-based statistical language model for natural language speech recognition. I E E E Transactions on Acoustics, Speech and Signal Processing, 37:1001-1008. find
  2. Breiman, L., Friedman, J. tI., Olshen, R. A., and Stone, C. J. (1984). Classification and Regression Trees. Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, California. find
  3. Brown, P. F., Cocke, J., DellaPietra, S. A., DellaPietra, V. J., Jelinek, F., Lafferty, J. D., Mercer, R. L., and Roossin, P. S. (1990). A statistical apl)roach to machine translation. Computational Linguistics, 16(2):79--85. find
  4. Brown, P. F., Cocke, J., DellaPietra, S. A., DellaPietra, V. J., Jelinek, F., Mercer, R. L., and Roossin, P. S. (1988). A statistical approach to language translation. I!1 Proceedings of the 12th International Conference on Computational Linguistics, Budapest, Hungary. find our card
  5. Brown, P. F., DellaPietra, S. A., DellaPietta, V. J., and Mercer, R. L. (1991). Parameter estimation for machine translation. In preparation. find
  6. Ide, N. and V6ronis, .I. (1990). Mapping dictionaires: A spreading activation approach. I:! Proccedil~!ls of the Sixth Annual Conferen~:e of the UII' Centre for the New Oxford English Dictionary and Text Research, pages 52-6,t, Waterloo, Canada. find
  7. Lesk, M. E. (1986). Automated sense disambiguation using machine-readable dictionaries: How to tell a pine cone from an ice cream cone. In Proceedings of the SIGDOC Conference. find
  8. Lucassen, J. M. (1983). Discovering phonemic baseforms automatically: an information theoretic approach. Technical Report RC 9833, IBM Research Division. find
  9. Lucassen, J. M. and Mercer, R. L. (1984). An information theoretic approach to automatic determination of phonemic baseforms. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, pages 42.5.1-42.5.4, San Diego, California. find
  10. do, 1990] Merialdo, B. (1990). Tagging text with a probabilistic model. In Proceedii~gs of the IBM Natural Language ITL, pages 161-172, Paris, France. find
  11. Nadas, A., Nahamoo, D., Picheny, M. A., and Powell, J. (1991). An iterative "flip-flop" approximation of the most informative split in the construction of decision trees. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, Toronto, Canada. find
  12. White, J. S. (1988). Determination of lexical-semantic relations for multi-lingual terminology structures. In Relational Models of the Lexicon,. Cambridge University Press, Cambridge, OK. find

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/brown-1991-word-sense-disambiguation-statistical-methods/