mirror of
https://github.com/msberends/AMR.git
synced 2025-07-11 11:41:54 +02:00
(v1.3.0.9026) eucast expert rules 3.2
This commit is contained in:
@ -25,7 +25,7 @@ The matching score is based on four parameters:
|
||||
\item The \href{https://en.wikipedia.org/wiki/Levenshtein_distance}{Levenshtein distance} \eqn{L} is the distance between the user input and all taxonomic full names, with the text length of the user input being the maximum distance. A modified version of the Levenshtein distance \eqn{L'} based on the text length of the full name \eqn{F} is calculated as:
|
||||
}
|
||||
|
||||
\deqn{L' = F - \frac{0.5L}{F}}{L' = (F - 0.5L) / F}
|
||||
\deqn{L' = 1 - \frac{0.5L}{F}}{L' = 1 - ((0.5 * L) / F)}
|
||||
|
||||
The final matching score \eqn{M} is calculated as:
|
||||
\deqn{M = L' \times \frac{1}{P K U} = \frac{F - 0.5L}{F P K U}}{M = L' * (1 / (P * K * U)) = (F - 0.5L) / (F * P * K * U)}
|
||||
|
Reference in New Issue
Block a user