2019
DOI: 10.1088/1742-6596/1175/1/012120
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of rabin-karp algorithm to determine the similarity of synoptic gospels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…The fifth step involves calculating the softmax function, which acts as the last activation function of the neural network. It normalizes the network output into a probability distribution based on the predicted output classes [32]. The standard softmax function is defined within the range of K [0, 1] and can be expressed using (3).…”
Section: Figure 4 Interaction Process Between N Inputsmentioning
confidence: 99%
“…The fifth step involves calculating the softmax function, which acts as the last activation function of the neural network. It normalizes the network output into a probability distribution based on the predicted output classes [32]. The standard softmax function is defined within the range of K [0, 1] and can be expressed using (3).…”
Section: Figure 4 Interaction Process Between N Inputsmentioning
confidence: 99%
“…Dice Similarity determines the degree of similarity between the vector data by dividing the number of vector values by the number of intersection values between vector 1 and the other vectors. Equation 6 [18] can be used to calculate dice similarity. In this equation, x is equal to (x1, x2, x3,..., xn), y is equal to (y1, y2, y3,..., yn), and ∩ is the intersection of the vector data.…”
Section: Dice Similaritymentioning
confidence: 99%
“…In this case, the k-gram value also becomes minimum string length for each comparison. Example: Words : kursinyaadi K-Gram : 4 Result : {kurs} {ursi} {rsin} {siny} {inya} {nyaa} {yaad} {aadi} D. Hashing Hashing is a function convert sub-strings into numbers where the output will be called as hash [12]. It actually works by using the formula below.…”
Section: B Rabin Karp Algorithmmentioning
confidence: 99%