2018
DOI: 10.1007/978-3-319-92058-0_80
|View full text |Cite
|
Sign up to set email alerts
|

Identifying Similar Sentences by Using N-Grams of Characters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 9 publications
0
2
0
1
Order By: Relevance
“…Elhadi (2012) introduces a method to calculate text similarity by comparing the longest common sequence between two texts. Sultana and Biskri (2018) propose another method by utilizing the N-grams of characters. N-grams are a subsequence of characters or words that are contained in a sentence or text.…”
Section: String-based Methodsmentioning
confidence: 99%
“…Elhadi (2012) introduces a method to calculate text similarity by comparing the longest common sequence between two texts. Sultana and Biskri (2018) propose another method by utilizing the N-grams of characters. N-grams are a subsequence of characters or words that are contained in a sentence or text.…”
Section: String-based Methodsmentioning
confidence: 99%
“…Полученные числовые векторы сравнивались математическими метриками расстояний: евклидово, косинусное, манхэттенское, расстояние Хэмминга [7]. Часто сходство вычислялось путем выделения самой длинной общей подстроки [8] или с использованием 𝑛-грамм [9].…”
Section: обзор научных исследованийunclassified
“…(3) Greedy String Tilling -Karp Robin Problem (GST-KRP) Michael J. Wise [18] proposed the use of the "Greedy String Tiling and Running Karp-Rabin matching (GST -KRP)" algorithm in the areas of plagiarism/similarity detection and other applications such as DNA Matching, amino acids, etc. GST algorithm is based on the concept of one-to-one string matching and can deal with the substring transposition.…”
Section: Local Similarity Algorithmsmentioning
confidence: 99%