There are 0 repository under insertions topic.
Evaluate results from ASR/Speech-to-Text quickly
Damerau–Levenshtein distance is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one word into the other.
Gerador de wordlists para a disciplina de Segurança e auditoria de Sistemas - SAS