Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have two data sources, and both of them return JSONs.
I want to ensure that there is some percentage of match (overlap of data, if you will) in the two JSONs, so as to collate them and store in a single record.
Is comparing the entropy of the two strings the best way? Are there any other solutions? I use Java, and could also use scala for the same.
You can convert them to xml and then use xdiff algorithm, or put every json record to a single line, and use unix
diff. Or convert it to an internal tree representation, and apply parallel tree difference algorithm. That depends on what kind of difference are you looking for and doesn’t depend on the implementation language.