Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Sentence disambiguation by asking

  • Published:
Computers and translation

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Carbonell, Jaime G. and Tomita, Masaru. 1985. “New Approaches to Machine Translation.” InConference on Theoretical and Methodological Issues in Machine Translation of Natural Languages. Colgate University, August, 1985. Also available as Tech. Report, Computer Science Department, Carnegie-Mellon University, July, 1985.

  • Church, K. and Patil, R. 1982.Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table. Technical Report MIT/LCS/TM-216, Lab. for Computer Science, Massachusetts Institute of Technology.

  • Kay, M. 1973. “The MIND System”. InNatural Language Processing. New York: Algorithmics Press, 155–188.

    Google Scholar 

  • ———. 1982. “Machine Translation”.American Journal of Computational Linguistics 8:74–78.

    Google Scholar 

  • Sheil, B. 1976. “Observations on context-free parsing”.Statistical Methods in Linguistics, 71–109.

  • Tomita, M. 1984. “Disambiguating Grammatically Ambiguous Sentences by Asking”. InProceedings of 10th International Conference on Computational Linguistics (COLING84).

  • Kay, M., Sheil, B., Tomita, M. 1985a. “Feasibility Study of Personal/Interactive Machine Translation Systems”. InConference on Theoretical and Methodological Issues in Machine Translation of Natural Languages. Colgate University, August, 1985. Also available as Tech. Report, Computer Science Department, Carnegie-Mellon University, July, 1985.

  • Kay, M., Sheil, B., Tomita, M.: 1985b. “An Efficient Context-free Parsing Algorithm for Natural Languages”. In9th International Joint Conference on Artificial Intelligence (IJCAI85).

  • ———. 1985c.Efficient Parsing for Natural Language: A Fast algorithm for Practical Systems. Boston: Kluwer Academic Publishers.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department at Carnegie-Mellon University, USA

    Masaru Tomita

Authors
  1. Masaru Tomita
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tomita, M. Sentence disambiguation by asking. Computers and Translation 1, 39–51 (1986). https://doi.org/10.1007/BF00940827

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940827

Keywords

Search

Navigation