1 / 3

Evaluating Names Finding Algorithm Performance in BHL Accessed by Tony Rees

This document presents an evaluation of the names finding algorithm performance as demonstrated on a random Biodiversity Heritage Library (BHL) page, accessed in June 2009. Authored by Tony Rees from CSIRO, the example illustrates the effectiveness of this algorithm under two scenarios: names that were successfully found (marked in blue) and those that were not found (marked in red). This work is crucial for understanding algorithm capabilities in the context of biodiversity informatics and enhances the accessibility of taxonomic information in historical literature.

creda
Télécharger la présentation

Evaluating Names Finding Algorithm Performance in BHL Accessed by Tony Rees

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