P281424/AMR
1
0
Fork 0
mirror of https://github.com/msberends/AMR.git synced 2025-07-12 12:21:58 +02:00
Code Releases Activity

(v1.4.0) matching score update

Browse Source
This commit is contained in:
dr. M.S. (Matthijs) Berends
2020-10-08 11:16:03 +02:00
parent c04dc852cf
commit 28e77680c5
261 changed files with 1488 additions and 1171 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
man/mo_matching_score.Rd
View File

@ -18,7 +18,7 @@ This helper function is used by \code{\link[=as.mo]{as.mo()}} to determine the m
With ambiguous user input in \code{\link[=as.mo]{as.mo()}} and all the \code{\link[=mo_property]{mo_*}} functions, the returned results are chosen based on their matching score using \code{\link[=mo_matching_score]{mo_matching_score()}}. This matching score \eqn{m}, is calculated as:
\deqn{m_{(x, n)} = \frac{l_{n} - 0.5 \cdot \min \begin{cases}l_{n} \\ \operatorname{lev}(x, n)\end{cases}}{l_{n} \cdot p_{n} \cdot k_{n}}}{m(x, n) = ( l_n * min(l_n, lev(x, n) ) ) / ( l_n * p_n * k_n )}
\deqn{m_{(x, n)} = \frac{l_{n} - 0.5 \cdot \min \begin{cases}l_{n} \\ \textrm{lev}(x, n)\end{cases}}{l_{n} \cdot p_{n} \cdot k_{n}}}{m(x, n) = ( l_n * min(l_n, lev(x, n) ) ) / ( l_n * p_n * k_n )}
where:
\itemize{