1 / 3

Optimal Names Finding Algorithm Performance: A Study Example

Explore the efficiency of names finding algorithms through a random example from June 2009. This study by Tony Rees at CSIRO evaluates name retrieval success rates. Findings include instances where names were found or not found within the given context.

acton-collins
Download Presentation

Optimal Names Finding Algorithm Performance: A Study Example

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Current names finding algorithm performance example – random BHL page, accessed June 2009 Tony Rees, CSIRO: Names Finding – June 2009

  2. BLUE = name found, e.g. Current names finding algorithm performance example – random BHL page, accessed June 2009 Tony Rees, CSIRO: Names Finding – June 2009

  3. RED= name not found, e.g. Current names finding algorithm performance example – random BHL page, accessed June 2009 Tony Rees, CSIRO: Names Finding – June 2009

More Related