• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities (2002)

Cached

  • Download as a PDF

Download Links

  • [acl.ldc.upenn.edu]
  • [www.aclweb.org]
  • [ucrel.lancs.ac.uk]
  • [www.aclweb.org]
  • [wing.comp.nus.edu.sg]
  • [aclweb.org]
  • [aclweb.org]
  • [www.aclweb.org]
  • [wing.comp.nus.edu.sg]
  • [www-speech.sri.com]
  • [www.speech.sri.com]
  • [staff.icar.cnr.it]
  • [www.icsi.berkeley.edu]
  • [www1.icsi.berkeley.edu]
  • [http.icsi.berkeley.edu]
  • [ftp.icsi.berkeley.edu]
  • [ftp.icsi.berkeley.edu]
  • [arxiv.org]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Andreas Stolcke
Venue:Computational Linguistics
Citations:222 - 5 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Stolcke02anefficient,
    author = {Andreas Stolcke},
    title = {An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities},
    journal = {Computational Linguistics},
    year = {2002},
    volume = {21},
    pages = {165--201}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

this article can compute solutions to all four of these problems in a single flamework, with a number of additional advantages over previously presented isolated solutions

Keyphrases

efficient probabilistic context-free parsing algorithm    prefix probability    additional advantage    single flamework    isolated solution   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University