Syntactical Similarity Learning by Means of Grammatical Evolution

  • Alberto Bartoli
  • Andrea De Lorenzo
  • Eric Medvet
  • Fabiano Tarlao
Conference paper

DOI: 10.1007/978-3-319-45823-6_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9921)
Cite this paper as:
Bartoli A., De Lorenzo A., Medvet E., Tarlao F. (2016) Syntactical Similarity Learning by Means of Grammatical Evolution. In: Handl J., Hart E., Lewis P., López-Ibáñez M., Ochoa G., Paechter B. (eds) Parallel Problem Solving from Nature – PPSN XIV. PPSN 2016. Lecture Notes in Computer Science, vol 9921. Springer, Cham

Abstract

Several research efforts have shown that a similarity function synthesized from examples may capture an application-specific similarity criterion in a way that fits the application needs more effectively than a generic distance definition. In this work, we propose a similarity learning algorithm tailored to problems of syntax-based entity extraction from unstructured text streams. The algorithm takes in input pairs of strings along with an indication of whether they adhere or not adhere to the same syntactic pattern. Our approach is based on Grammatical Evolution and explores systematically a similarity definition space including all functions that may be expressed with a specialized, simple language that we have defined for this purpose. We assessed our proposal on patterns representative of practical applications. The results suggest that the proposed approach is indeed feasible and that the learned similarity function is more effective than the Levenshtein distance and the Jaccard similarity index.

Keywords

Distance learning Entity extraction String patterns 

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Alberto Bartoli
    • 1
  • Andrea De Lorenzo
    • 1
  • Eric Medvet
    • 1
  • Fabiano Tarlao
    • 1
  1. 1.Department of Engineering and ArchitectureUniversity of TriesteTriesteItaly

Personalised recommendations