Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

String Similarity & Maximum-Weighted Matching in Graphs #16

Open
jiansoung opened this issue Oct 29, 2018 · 0 comments
Open

String Similarity & Maximum-Weighted Matching in Graphs #16

jiansoung opened this issue Oct 29, 2018 · 0 comments
Labels
algorithm

Comments

@jiansoung
Copy link
Owner

String Similarity & Maximum-Weighted Matching in Graphs

The Similarity of two strings s1, s2

Maximum-Weighted Matching in Graphs

A matching is a subset of edges in which no node occurs more than once. The weight of a matching is the sum of the weights of its edges. A maximal matching cannot add more edges and still be a matching.

Combine Two Concepts

Graph G: strings as nodes, and similarity of two strings as their edge's weight.

The maximum-weighted matching in the Graph G is the best result of similarity strings pairs between two datasets.

References
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
algorithm
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@jiansoung