ALDC: Average Levenshtein Distance of Candidates - ALDC

In dosc91/LDLConvFunctions: LDLConvFunctions for measure computation, extraction, and other handy stuff.

Description

ALDC computes the mean Levenshtein Distances of all candidate productions.

Usage

ALDC(prod_acc, data)

Arguments

prod_acc	A list, typically the output of WpmWithLdl::accuracy_production.
data	The dataset with which prod_acc was computed

Value

A data frame containing:

• Word - The pertinent word as found in data.

• Base - The pertinent base as found in data.

• ALDC - The ALDC of a word.

Author(s)

D. Schmitz

References

Baayen, R. H., Chuang, Y. Y., and Blevins, J. P. (2018). Inflectional morphology with linear mappings. The Mental Lexicon, 13 (2), 232-270.

Chuang, Y-Y., Vollmer, M-l., Shafaei-Bajestan, E., Gahl, S., Hendrix, P., & Baayen, R. H. (2020). The processing of pseudoword form and meaning in production and comprehension: A computational modeling approach using Linear Discriminative Learning. Behavior Research Methods, 1-51.

Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady. 10 (8), 707-710.

van der Loo M (2014). The stringdist package for approximate string matching. The R Journal, 6, 111-122.

dosc91/LDLConvFunctions documentation built on Feb. 2, 2022, 6:17 p.m.