Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.3115/980691.980760dlproceedingsArticle/Chapter ViewAbstractPublication PagesaclConference Proceedingsconference-collections
Article
Free access

Maximum entropy model learning of the translation rules

Published: 10 August 1998 Publication History
  • Get Citation Alerts
  • Abstract

    This paper proposes a learning method of translation rules from parallel corpora. This method applies the maximum entropy principle to a probabilistic model of translation rules. First, we define feature functions which express statistical properties of this model. Next, in order to optimize the model, the system iterates following steps: (1) selects a feature function which maximizes loglikelihood, and (2) adds this function to the model incrementally. As computational cost associated with this model is too expensive, we propose several methods to suppress the overhead in order to realize the system. The result shows that it attained 69.54% recall rate.

    References

    [1]
    L. E. Baum. 1972. An inequality and associated maximumization technique in statistical estimation of probabilistic functions of a markov process. Inequalities, 3: 1--8.
    [2]
    Adam L. Berger, Stephen A. Della Pietra, and Vincent J. Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1): 39--71.
    [3]
    Hiroyuki Kaji and Toshiko Aizono. 1996. Extracting word correspondences from bilingual corpora based on word co-occurrence information. In Proceedings of the 16th International Conference on Computational Linguistics, pages 23--28.
    [4]
    M. Kay and M. Röschesen. 1993. Text translation alignment. Computational Linguistics, 19(1): 121--142.
    [5]
    J. D. Lafferty. 1993. A derivation of the inside-outside algorithm from the EM algorithm. IBM Research Report. IBM T. J. Watson Research Center.
    [6]
    Stephen Della Pietra, Vincent Della Pietra, and John Lafferty. 1995. Inducing features of random fields. Technical Report CMU-CS-95-144, Carnegie Mellon University, May.
    [7]
    Adwait Ratnaparkhi. 1997. A linear observed time statistical parser based on maximum entropy models. In Proceedings of Second Conference On Empirical Methods in Natural Language Processing.
    [8]
    Jeffrey C. Reynar and Adwait Ratnaparkhi. 1997. A maximum entropy approach to identifying sentence boundaries. In Proceedings of the 5th Applied Natural Language Processing Conference.
    [9]
    Ronald Rosenfeld. 1996. A maximum entropy approach to adaptive statistical language modeling. Computer, Speech and Language, (10): 187--228.
    [10]
    Kiyoaki Shirai, Kentaro Inui, Takenobu Tokunaga, and Hozumi Tanaka. 1996. A maximum entropy model for estimating lexical bigrams (in Japanese). In SIG Notes of the Information Processing Society of Japan, number 96-NL-116.
    [11]
    Takehito Utsuro, Takashi Miyata, and Yuji Matsumoto. 1997. Maximum entropy model learning of subcategorizatoin preference. In Proceedings of the 5th Workshop on Very Large Corpora, pages 246--260, August.

    Cited By

    View all
    • (2002)Extracting word sequence correspondences with support vector machinesProceedings of the 19th international conference on Computational linguistics - Volume 110.3115/1072228.1072248(1-7)Online publication date: 24-Aug-2002
    • (2000)Structural feature selection for English-Korean statistical machine translationProceedings of the 18th conference on Computational linguistics - Volume 110.3115/990820.990884(439-445)Online publication date: 31-Jul-2000

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image DL Hosted proceedings
    ACL '98/COLING '98: Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2
    August 1998
    768 pages

    Sponsors

    • Government of Canada
    • Université de Montréal

    Publisher

    Association for Computational Linguistics

    United States

    Publication History

    Published: 10 August 1998

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate 85 of 443 submissions, 19%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)33
    • Downloads (Last 6 weeks)6
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2002)Extracting word sequence correspondences with support vector machinesProceedings of the 19th international conference on Computational linguistics - Volume 110.3115/1072228.1072248(1-7)Online publication date: 24-Aug-2002
    • (2000)Structural feature selection for English-Korean statistical machine translationProceedings of the 18th conference on Computational linguistics - Volume 110.3115/990820.990884(439-445)Online publication date: 31-Jul-2000

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media