IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v12y2020i3p277-307.html
   My bibliography  Save this article

Proposal and study of statistical features for string similarity computation and classification

Author

Listed:
  • E.O. Rodrigues
  • D. Casanova
  • M. Teixeira
  • V. Pegorini
  • F. Favarim
  • E. Clua
  • A. Conci
  • Panos Liatsis

Abstract

Adaptations of features commonly applied in the field of visual computing, co-occurrence matrix (COM) and run-length matrix (RLM), are proposed for the similarity computation of strings in general (words, phrases, codes and texts). The proposed features are not sensitive to language related information. These are purely statistical and can be used in any context with any language or grammatical structure. Other statistical measures that are commonly employed in the field such as longest common subsequence, maximal consecutive longest common subsequence, mutual information and edit distances are evaluated and compared. In the first synthetic set of experiments, the COM and RLM features outperform the remaining state-of-the-art statistical features. In 3 out of 4 cases, the RLM and COM features were statistically more significant than the second best group based on distances (P-value < 0.001). When it comes to a real text plagiarism dataset, the RLM features obtained the best results.

Suggested Citation

  • E.O. Rodrigues & D. Casanova & M. Teixeira & V. Pegorini & F. Favarim & E. Clua & A. Conci & Panos Liatsis, 2020. "Proposal and study of statistical features for string similarity computation and classification," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 12(3), pages 277-307.
    • Handle: RePEc:ids:ijdmmm:v:12:y:2020:i:3:p:277-307
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=108731
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijdmmm:v:12:y:2020:i:3:p:277-307. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.