Abstract
In this paper, the similarity between a pair of text documents is measured by identifying three sets of words: words that exist in the first but not in the second, in the second but not in the first and those words that exist in both. Two deterministic finite automata are built to recognize the words of the two documents. These finite state automata are used to identify these three sets of words. An experimental study was conducted to present the proposed approach and to compare it with other peer text similarity measures: Jaccard and cosine distance. The proposed approach gave more reasonable results than Jaccard but more inflated than cosine distance approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
