• E-mail
  • The use of word distance algorithms in natural




    Download 0,51 Mb.
    Pdf ko'rish
    bet12/12
    Sana22.01.2024
    Hajmi0,51 Mb.
    #143201
    1   ...   4   5   6   7   8   9   10   11   12
    Bog'liq
    n.xudayberganov sh.hasanov til va madaniyat
    PDF Scanner 211223 9.14.43, MA`LUMOTNOMA
    The use of word distance algorithms in natural 
    language processing
    Nizomaddin Xudayberganov
    1
    Shaxboz Khasanov
    2
    Abstract:
    Distance between words - can be characterized according to 
    different qualities of words. Different algorithms are proposed in the 
    direction of natural language processing to determine their similarity 
    according to their component. These algorithms differ from each other in 
    their places of use and performance. It is mainly used in areas such as spell 
    check, speech recognition and plagiarism detection. This article analyzes 
    the algorithms used to determine the similarity distance of more than one 
    word and their characteristics.
    1
    Xudayberganov Nizomaddin Uktamboy oʻgʻli – Teacher of the Department of 
    Computer Linguistics and Digital Technologies of Tashkent State University of 
    Uzbek Language and Literature named after Alisher Navoi.
    E-mail: nizomaddin@navoiy-uni.uz 
    ORCID: 0000-0002-6213-3015
    2
    Hasanov Shaxboz G‘olibjon o‘g‘li – student, The INHA University in Tashkent.
    E-mail: shaxbozhsh@gmail.com  
    ORCID: 0000-0002-2368-2863
    For reference: Xudayberganov N., Khasanov Sh. 2022. “The use of word distance 
    algorithms in natural language processing”. 
    Uzbekistan: language and culture. 
    Applied philology.
    2 (5): 69-83.


    Tabiiy tilni qayta ishlashda so‘zlar orasidagi masofani aniqlash algoritmlaridan foydalanish
    83
    Key words: Hamming distance, Levenshteyin distance, Cosine 
    similarity, similarity table, coding theory.
    References:
    Waggener Bill. Pulse Code Modulation Techniques. Springer. p. 206. ISBN. 
    Retrieved 13 June, 2020.
    Robinson, Derek J. S. (2003). An Introduction to Abstract Algebra. Walter 
    de Gruyter. pp. 255–257.ISBN.
    Levenshteyin, Vladimir I. (February 1966). “Binary codes capable of 
    correcting deletions, insertions, and reversals”. Soviet Physics 
    Doklady.
    Levenshteyin Distance Computation by Sergey Grashchenko November 16, 2022. 
    https://www.baeldung.com/cs/Levenshteyin-distance-
    computation
    Cosine similarity https://en.wikipedia.org/wiki/Cosine_similarity
    Connor, Richard (2016). A Tale of Four Metrics. Similarity Search and 
    Applications. Tokyo: Springer.
    Cosine distance, cosine similarity, angular cosine distance, angular cosine similarity. 
    https://www.itl.nist.gov/div898/software/dataplot/refman2/auxillar/
    cosdist.htm.
    Understanding cosine similarity and its application. Richmond Alake 
    Sep 15,2020. Connor, Richard (2016). A Tale of Four Metrics. 
    Similarity Search and Applications. Tokyo: Springer.
    Sidorov, Grigori; Velasquez, Francisco; Stamatatos, Efstathios; Gelbukh, 
    Alexander; Chanona-Hernández, Liliana (2013). Advances 
    in Computational Intelligence. Lecture Notes in Computer 
    Science. Vol.7630. LNAI 7630. pp.1–11.

    Download 0,51 Mb.
    1   ...   4   5   6   7   8   9   10   11   12




    Download 0,51 Mb.
    Pdf ko'rish

    Bosh sahifa
    Aloqalar

        Bosh sahifa



    The use of word distance algorithms in natural

    Download 0,51 Mb.
    Pdf ko'rish