Two Languages Are More Informative Than One
Paper · 1991 · Ido Dagan, Alon Itai and Ulrike Schwall
Summary
The paper addresses lexical ambiguity in unrestricted text, focusing on target word selection in machine translation: picking the target-language equivalent that best fits a source word in its context. The authors avoid hand-built semantic knowledge and sense-tagged source corpora. Instead, they make the decision on the target side.
Each ambiguous source sentence is reduced to its syntactic lexical relations, such as verb–object, subject–verb, noun compounds and noun–PP. A bilingual lexicon expands each relation into every possible target-language version. These candidates are then counted in a large, untagged, parsed English corpus of about 150 million words. A statistical model uses a bound on the odds ratio between alternatives to decide which relation to trust first and which translation to choose.
On a random sample of Hebrew foreign-news sentences, the model applied to 70% of ambiguous words and was right in 92% of those cases. A German set was also tested. The study shows that cheap monolingual statistics in a second language can replace costly sense annotation.
Key points
- Motivating example. The Hebrew verb 'laḥtom' can mean sign, seal, finish or close, and 'hoze' can mean contract or treaty.
- Choosing the most frequent English word alone gives the wrong output "closing a peace contract".
- Relation counts fix this: 'peace treaty' appeared 49 times and 'peace contract' never. 'Sign a treaty' appeared 79 times, while each competing verb appeared at most twice.
- Counting method. Relation frequencies come only from sentences in the English corpus (~150M words) that the parser handled successfully. When a sentence has several ambiguous words, they are resolved one at a time, in an order set by the statistical confidence of each relation.
- Evaluation. There were two example sets, one Hebrew→English and one German→English. On the randomly drawn Hebrew news set, applicability was 70% and precision 92%.
- Error categories.
- Trusting the wrong relation. For 'matzav' (state/position), put-position (320) outweighed put-state (18). The modifier relation, state-war (13) vs position-war (2), pointed to the correct choice.
- Mixing senses. The target corpus ignores the source word, so counts for one Hebrew word can leak into another (e.g., 'young prospect' affecting 'sikkuy' vs 'tiqva').
- Needing deep understanding. Hebrew 'hagira' covers both emigration and immigration, and only the wider context could tell them apart.
- Authors' explanation of the high precision. Correct readings are a small fraction of the possible ones (sparseness), and independent cues tend to agree with each other (redundancy).
Interesting ideas
- I1. Resolve ambiguity where it is cheaper. The source sentence is treated as a noisy signal, and a target-language model picks the most plausible output. This framing is useful whenever one side of a task has abundant raw text and the other does not, such as a lower-resource source paired with English.
- I2. Use another language as free sense labels. Distinct translations often line up with distinct senses of a source word. Counting relations among those translations therefore yields sense-level statistics for monolingual WSD, and a third language can help when two senses share a translation. This could bootstrap sense inventories without manual tagging.
- I3. Resolve the most confident decision first. The system ranks ambiguous relations by a confidence bound rather than raw counts, settles the surest one, and lets it constrain the rest. This greedy, uncertainty-aware ordering transfers to many joint-decision problems.
- I4. Weight relation types differently. The 'matzav' failure suggests that a noun's own modifiers or objects should count more for its sense than the verb governing it. Typed weighting of evidence by syntactic role is a cheap refinement for any count-based model.
- I5. Report coverage and precision separately and classify failures. Giving applicability (70%) and accuracy on covered cases (92%) as separate figures, plus grouping errors by cause, shows clearly where the method breaks down. It also frames future gains as an explicit recall/precision tradeoff.
Institutions
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 9,086 worksArtificial Intelligence · 8,889 worksArts and Humanities · 9,296 worksLanguage and Linguistics · 9,206 works
Cite
Cite as Ido Dagan, Alon Itai and Ulrike Schwall. 1991. Two Languages Are More Informative Than One. 29th Annual Meeting of the Association for Computational Linguistics.
@inproceedings{dagan1991two,
title = {{Two Languages Are More Informative Than One}},
author = {Ido Dagan, Alon Itai and Ulrike Schwall},
booktitle = {29th Annual Meeting of the Association for Computational Linguistics},
year = {1991},
doi = {10.3115/981344.981361},
url = {https://doi.org/10.3115/981344.981361}
}References
- Brown, P., Cocks, J., Della Pietra, S., Della Pietra, V., Jelinek, F., Mercer, R.L. and Rossin P.S., A statistical approach to language translation, Computational Linguistics, vol. 16(2), 79-85 (1990). find
- Chodorow, M. S., R. J. Byrd and G. E. Heidron, Extracting Semantic Hierarchies from a Large On-Line Dictionary. Proc. of the 23rd Annual Meeting of the ACL, 299-304 (1985). find
- Church, K. W., and Hanks, P., Word association norms, mutual information, and Lexicography, Computational Linguistics, vol. 16(1), 22-29 (1990).
- Dagan, I. and A. Itai, Automatic Acquisition of Constraints for the Resolution of Anaphora References and Syntactic Ambiguities, COLING 1990, Helsinki, Finland. find
- Dagan, I. and A. Itai, A Statistical Filter for Resolving Pronoun References, Proc. of the 7th Israeli Sym. on Artificial Intelligence and Computer Vision, 1990. find
- Hindle, D. Noun Classification from Predicate-Argument Structures, Proc. of the 28rd Annual Meeting of the ACL, (1990).
- Hindle D. and M. Rooth, Structural Ambiguity and Lexical Relations, Proc. of the Speech and Natural Language Workshop, (DARPA), June 1990. find
- Hornby, A. S., C. Ruse, J. A. Reif and Y. Levy, Ozford Student's Dictionanary for Hebrew Speakers, Kernerman Publishing Ltd, Lonnie Kahn & Co. Ltd. (1986). find
- Johnson, R. A. and D. W. Wichern, Multivariate Statistical Analysis, Prentice-Hall, 1982. find
- Katz, S., Recursive m-gram language model via a smoothing of Turing's formula, IBM Tech. Disclosure Bull., 1985. find
- Lenat, D. B., R. V. Guha, K. Pittman, D. Pratt and M. Shepherd, Cyc: toward programs with common sense, Comm. ACM, vol. 33(8), 1990. find
- McCord, M. C., A new version of slot grammar, Research Report RC 1~506, IBM Research Division, Yorktown Heights, NY, 1989. find
- Sirenburg, S., (ed.), Machine Translation, Cambridge University Press (1987). find
- Nirenburg, S., I. Monarch, T. Kaufmann, I. Nirenburg and J. Carbonell. Acquisition of Very Large Knowledge Bases: Methodology, Tools and Applications, Center for Machine Translation, Carnegie-Mellon, CMU-CMT-88-108, (1988). find
- Sadler, V., Working with analogical semantics: disambiguation techniques in DLT, Foris Publications, 1989. find
- Van Eynde, F. et al.: The Task of Transfer vis-avis Analysis and Generation. Eurotra Final Report ET-10-B/NL, (1982). find
- Wittgenstein, L. Philosophical Investigations, Oxford (1953). find
- Zernik U., and P. Jacobs, Tagging for Learning: Collecting Thematic Relations from Corpus. Proc. COLING 1990. find
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/dagan-1991-two-languages-are-more-informative/