Skip to main content
SpringerLink
Log in

Determining the Similarity of Two Web Applications Using the Edit Distance

  • Conference paper
  • First Online:
Book cover Soft Computing Applications (SOFA 2014)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 356))

Included in the following conference series:

Abstract

This paper presents a method for measuring the similarity of two web applications using the algorithm for determining the Levenshtein distance. The web pages used in the measurement of similarity have ​​the source code made of tags. After presenting the algorithm for determining the similarity of two web applications, we present the results obtained with its implementation in Java using various websites. The final part of the paper presents the definition of fuzzy sets, using the degree of similarity of a web page with a web application as a membership function.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Popescu DA, Danauta CM (2011) Similarity measurement of web sites using sinkweb pages, TSP2011. IEEE, pp 24–26

    Google Scholar 

  2. Popescu DA, Nicolae D (2012) Similarity measurement of web site. In: SOFA 2012, 5th international workshop soft computing applications. Proceedings LNCS, Springer, pp 349–356

    Google Scholar 

  3. Lerman K, Getoor L, Minton S, Knoblock C (2004) Using the structure of web sites for automatic segmentation of tables. In: SIGMOD 2004 June 13–18, Paris, France, ACM (2004)

    Google Scholar 

  4. Korn F, Saha B, Srivastava D, Ying S (2013) On repairing structural problems in semistructured data. Proc VLDB Endow 6(9):601–612

    Article  Google Scholar 

  5. Pawlik M, Augsten N (2012) RTED: a robust algorithm for the tree edit distance. In: The 38th international conference on very large data bases, August 27th–31st 2012, Istanbul, Turkey. Proceedings of the VLDB Endowment, vol 5, no 4

    Google Scholar 

  6. Wolska M, Grigore M, Kohlhase M (2011) Using discourse context to interpret object-denoting mathematical expressions. Towards a Digital Mathematics Library. Bertinoro, Italy, July 20–21st, 2011. Masaryk University Press, Brno, Czech Republic, pp 85–101 (2011)

    Google Scholar 

  7. Benjamin O, Sigrid E, Ian S (2013) Determining image similarity from pattern matching of abstract syntax trees of tree picture grammars. PRASA Johannesburg, pp 83–90

    Google Scholar 

  8. Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, New Jersey

    Google Scholar 

  9. Vladimir B (2001) Discrete cosine and sine transforms. In: Rao KR et al (ed) The transform and data compression handbook. Boca Raton, CRC Press LLC

    Google Scholar 

  10. Remani NVJM, Rachakonda SR, Kurra RSR (2011) Similarity of inference face matching on angle oriented face recognition. J Inf Eng Appl 1(1) (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Sciences, University of Pitesti, Pitesti, Romania

    Doru Anastasiu Popescu

  2. Faculty of Automatic Control and Computer Science, Politehnica University of Bucharest, Bucharest, Romania

    Dragoș Nicolae

Authors
  1. Doru Anastasiu Popescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dragoș Nicolae
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Doru Anastasiu Popescu .

Editor information

Editors and Affiliations

  1. Department of Automation and Applied Informatics, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Balas

  2. Faculty of Science and Technology, Data Science Institute, Bournemouth University, Poole, United Kingdom

    Lakhmi C. Jain

  3. University of Belgrade, Belgrade, Serbia

    Branko Kovačević

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Popescu, D.A., Nicolae, D. (2016). Determining the Similarity of Two Web Applications Using the Edit Distance. In: Balas, V., C. Jain, L., Kovačević, B. (eds) Soft Computing Applications. SOFA 2014. Advances in Intelligent Systems and Computing, vol 356. Springer, Cham. https://doi.org/10.1007/978-3-319-18296-4_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18296-4_53

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18295-7

  • Online ISBN: 978-3-319-18296-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation