1 / 3

Current names finding algorithm performance example – random BHL page, accessed June 2009

This document presents a detailed analysis of the performance of current names finding algorithms with examples from the Biodiversity Heritage Library (BHL). It illustrates scenarios where names are successfully found (highlighted in blue) and those where names are not found (highlighted in red), referencing the work of Tony Rees from CSIRO. The examples emphasize the effectiveness of algorithms in real-world applications, providing insights into their strengths and areas for improvement. This evaluation is significant for researchers and developers in biodiversity informatics.

mimi
Télécharger la présentation

Current names finding algorithm performance example – random BHL page, accessed June 2009

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