skip to main content
10.3115/981863.981886dlproceedingsArticle/Chapter ViewAbstractPublication PagesaclConference Proceedingsconference-collections
Article
Free Access

Head automata and bilingual tiling: translation with minimal representations

Published:24 June 1996Publication History

ABSTRACT

We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for incremental application of lexical associations in a dynamic programming search for optimal dependency tree derivations. We also present a model and algorithm for machine translation involving optimal "tiling" of a dependency tree with entries of a costed bilingual lexicon. Experimental results are reported comparing methods for assigning cost functions to these models. We conclude with a discussion of the adequacy of annotated linguistic strings as representations for machine translation.

References

  1. Alshawi, H. 1987. Memory and Context for Language Interpretation. Cambridge University Press, Cambridge, England. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Alshawi, H. 1996. "Underspecified First Order Logics". In Semantic Ambiguity and Underspecification, edited by K. van Deemter and S. Peters, CSLI Publications, Stanford, California.Google ScholarGoogle Scholar
  3. Alshawi, H. 1992. The Core Language Engine. MIT Press, Cambridge, Massachusetts.Google ScholarGoogle Scholar
  4. Alshawi, H., D. Carter, B. Gamback and M. Rayner. 1992. "Swedish-English QLF Translation". In H. Alshawi (ed.) The Core Language Engine. MIT Press, Cambridge, Massachusetts.Google ScholarGoogle Scholar
  5. Booth, T. 1969. "Probabilistic Representation of Formal Languages". Tenth Annual IEEE Symposium on Switching and Automata Theory.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Brew, C. 1992. "Letting the Cat out of the Bag: Generation for Shake-and-Bake MT". Proceedings of COLING92, the International Conference on Computational Linguistics, Nantes, France. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Brown, P., J. Cocke, S. Della Pietra, V. Della Pietra, F. Jelinek, J. Lafferty, R. Mercer and P. Rossin. 1990. "A Statistical Approach to Machine Translation". Computational Linguistics 16:79--85. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Brown, P. F., S. A. Della Pietra, V. J. Della Pietra, and R. L. Mercer. 1993. "The Mathematics of Statistical Machine Translation: Parameter Estimation". Computational Linguistics 19:263--312. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Chen, K. H. and H. H. Chen. 1992. "Attachment and Transfer of Prepositional Phrases with Constraint Propagation". Computer Processing of Chinese and Oriental Languages, Vol. 6, No. 2, 123--142.Google ScholarGoogle Scholar
  10. Church K. and R. Patil. 1982. "Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table". Computational Linguistics 8:139--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Collins, M. and J. Brooks. 1995. "Prepositional Phrase Attachment through a Backed-Off Model." Proceedings of the Third Workshop on Very Large Corpora, Cambridge, Massachusetts, ACL, 27--38.Google ScholarGoogle Scholar
  12. Dorr, B. J. 1994. "Machine Translation Divergences: A Formal Description and Proposed Solution". Computational Linguistics 20:597--634. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Dunning, T. 1993. "Accurate Methods for Statistics of Surprise and Coincidence." Computational Linguistics. 19:61--74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Early, J. 1970. "An Efficient Context-Free Parsing Algorithm". Communications of the ACM 14: 453--60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Gazdar, G., E. Klein, G. K. Pullum, and I. A. Sag. 1985. Generalised Phrase Structure Grammar. Blackwell, Oxford.Google ScholarGoogle Scholar
  16. Hinton, G. E., P. Dayan, B. J. Frey and R. M. Neal. 1995. "The 'Wake-Sleep' Algorithm for Unsupervised Neural Networks". Science 268:1158--1161.Google ScholarGoogle ScholarCross RefCross Ref
  17. Hudson, R. A. 1984. Word Grammar. Blackwell, Oxford.Google ScholarGoogle Scholar
  18. Hirschman, L., M. Bates, D. Dahl, W. Fisher, J. Garofolo, D. Pallett, K. Hunicke-Smith, P. Price, A. Rudnicky, and E. Tzoukermann. 1993. "Multi-Site Data Collection and Evaluation in Spoken Language Understanding". In Proceedings of the Human Language Technology Workshop, Morgan Kaufmann, San Francisco, 19--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Isabelle, P. and E. Macklovitch. 1986. "Transfer and MT Modularity", Eleventh International Conference on Computational Linguistics, Bonn, Germany, 115--117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Jackendoff, R. S. 1977. X-bar Syntax: A Study of Phrase Structure. MIT Press, Cambridge, Massachusetts.Google ScholarGoogle Scholar
  21. Jelinek, F., R. L. Mercer and S. Roukos. 1992. "Principles of Lexical Language Modeling for Speech Recognition". In S. Furui and M. M. Sondhi (eds.), Advances in Speech Signal Processing, Marcel Dekker, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Lafferty, J., D. Sleator and D. Temperley. 1992. "Grammatical Trigrams: A Probabilistic Model of Link Grammar". In Proceedings of the 1992 AAAI Fall Symposium on Probabilistic Approaches to Natural Language, 89--97.Google ScholarGoogle Scholar
  23. Kay, M. 1989. "Head Driven Parsing". In Proceedings of the Workshop on Parsing Technologies, Pittsburg, 1989.Google ScholarGoogle Scholar
  24. Lindop, J. and J. Tsujii. 1991. "Complex Transfer in MT: A Survey of Examples". Technical Report 91/5, Centre for Computational Linguistics, UMIST, Manchester, UK.Google ScholarGoogle Scholar
  25. Resnik, P. 1992. "Probabilistic Tree-Adjoining Grammar as a Framework for Statistical Natural Language Processing". In Proceedings of COLING-92, Nantes, France, 418--424. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Sata, G. and O. Stock. 1989. "Head-Driven Bidirectional Parsing". In Proceedings of the Workshop on Parsing Technologies, Pittsburg, 1989.Google ScholarGoogle Scholar
  27. Schabes, Y. 1992. "Stochastic Lexicalized Tree-Adjoining Grammars". In Proceedings of COLING-92, Nantes, France, 426--432. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Whitelock, P. J. 1992. "Shake-and-Bake Translation". Proceedings of COLING92, the International Conference on Computational Linguistics, Nantes, France. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Younger, D. 1967. Recognition and Parsing of Context-Free Languages in Time n.3 Information and Control, 10, 189--208.Google ScholarGoogle Scholar
  1. Head automata and bilingual tiling: translation with minimal representations

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image DL Hosted proceedings
            ACL '96: Proceedings of the 34th annual meeting on Association for Computational Linguistics
            June 1996
            399 pages
            • Program Chairs:
            • Aravind Joshi,
            • Martha Palmer

            Publisher

            Association for Computational Linguistics

            United States

            Publication History

            • Published: 24 June 1996

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate85of443submissions,19%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader