![\"\"](\"https:\/\/tenthplanet.in\/blogs\/wp-content\/uploads\/sites\/21\/2018\/02\/blog3-3.png\" "\\"\\"")
<\/p>\n
- \n
- Pair letters similarity<\/b>—dissects the two strings in pairs and calculates the similarity of the two strings by dividing the number of common pairs by the sum of the pairs from both strings.<\/li>\n<\/ul>\n
Metaphone, Double Metaphone, SoundEx, and Refined SoundEx<\/b>—are phonetic algorithms, which try to match strings based on how they would sound. Each is based on the English language and would not be useful to compare other languages.<\/p>\n
- \n
- \n
- \n
- The Metaphone algorithm returns an encoded value based on the English pronunciation of a given word. The encoded value of the names John and Jan would return the value JN<\/i> for both names.<\/li>\n
- The Double Metaphone algorithm has fundamental design improvements over its predecessor and uses a more complex rule set for coding. It can return a primary and a secondary encoded value for a string. The names John and Jan each return Metaphone key values of JN<\/i> and AN<\/i>.<\/li>\n
- The Soundex algorithm returns a single encoded value for a name that consists of a letter followed by three numerical digits. The letter is the first letter of the name, and the digits encode the remaining consonants.<\/li>\n
- The Refined SoundEx algorithm is an improvement over its predecessor. Encoded values for this algorithm are six digits long, the initial character is encoded, and multiple possible encodings can be returned for a single name. Using this algorithm, the name John returns the values 160000 and 460000, as does the name Jan.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n
Process Flow in PDI:<\/h4>\n
To extract\/map the relevant data from the structured data for the semi-structured data, we used to follow the below steps<\/p>\n
Step 1:<\/strong> wi Transform the semi structured data into structured data using respective transform steps from PDI<\/p>\n
![\"\"](\"https:\/\/tenthplanet.in\/blogs\/wp-content\/uploads\/sites\/21\/2018\/02\/blog4-2.png\" "\\"\\"")
\nStep 2<\/b>:\u00a0 Match the practitioner prescribed diagnosis with Master Diagnosis to fetch the respective ICD code<\/p>\nStep 3<\/b>: Use the fuzzy match step to achieve the process, there we have to choose the right algorithm to do the fuzzy match process.<\/p>\n
Jaro Winkler algorithm will fetch maximum relevant strings from master with score value<\/p>\n
![\"\"](\"https:\/\/tenthplanet.in\/blogs\/wp-content\/uploads\/sites\/21\/2018\/02\/blog5-1-1.png\" "\\"\\"")
\nStep 4<\/b>: Store the mapped\/matched value into table with score value which is used to determine the matched sentence\u00a0accuracy<\/p>\n![\"\"](\"https:\/\/tenthplanet.in\/blogs\/wp-content\/uploads\/sites\/21\/2018\/02\/blog6-1.png\" "\\"\\"")
\n<\/b><\/p>\nUser Interface to Edit \/ Remap the ICD:<\/h4>\n
Pentaho Plus UI supports the customized table editor, which helps to update or remap the mapped the ICD code to the respective diagnosis.<\/p>\n
User can search the Diagnosis based on ICD code or ICD code based on diagnosis respectively.<\/p>\n
The below screenshot explains, how the interface can be used to update the matched records.<\/p>\n
![\"\"](\"https:\/\/tenthplanet.in\/blogs\/wp-content\/uploads\/sites\/21\/2018\/02\/blog7.jpg\" "\\"\\"")
<\/p>\nSummary<\/h1>\n
With the help of Pentaho Plus fuzzy match process, customer’s semi-structure data was analyzed and processed to match the standard classification of diseases.<\/p>\n
Customers are able to edit or remap ICD code for the respective diagnosis with the help of matching score value.<\/p>\n
![\"\"](\"https:\/\/tenthplanet.in\/blogs\/wp-content\/uploads\/sites\/21\/2018\/02\/blog8-1.png\" "\\"\\"")
<\/p>\nReferences:<\/h3>\n
Fuzzy match Step<\/p>\n
:https:\/\/wiki.pentaho.com\/display\/EAI\/Fuzzy+match<\/b><\/p>\n","protected":false},"excerpt":{"rendered":"
Fuzzy matching is a method that provides an improved ability to process word-based matching queries to find matching phrases <\/p>\n","protected":false},"author":23,"featured_media":1131,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[424],"tags":[448,449,450],"class_list":["post-244","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-pentaho","tag-fuzzy-logic","tag-matching-words","tag-phonetically"],"acf":[],"_links":{"self":[{"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/posts\/244","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/users\/23"}],"replies":[{"embeddable":true,"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/comments?post=244"}],"version-history":[{"count":0,"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/posts\/244\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/media\/1131"}],"wp:attachment":[{"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/media?parent=244"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/categories?post=244"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/tenthplanet.in\/blogs\/wp-json\/wp\/v2\/tags?post=244"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
- The Double Metaphone algorithm has fundamental design improvements over its predecessor and uses a more complex rule set for coding. It can return a primary and a secondary encoded value for a string. The names John and Jan each return Metaphone key values of JN<\/i> and AN<\/i>.<\/li>\n
- The Metaphone algorithm returns an encoded value based on the English pronunciation of a given word. The encoded value of the names John and Jan would return the value JN<\/i> for both names.<\/li>\n
- \n