Task:
You are given two strings S1 and S2 that can contain any ASCII symbols, except for the line feed character.
Normalize the strings: delete all symbols that are not latin letters, digits or a whitespace character, and decapitalize every letter (make it lowercase). You should then delete all words which length is less or equal to 3 and all extra whitespace characters (so that there's no more than one whitespace character between two words).
For the resulting strings count the Levenshtein distance - the minimal number of operations of inserting/deleting a symbol or replacing one symbol with another that is required to transform the string S1 into S2.
Input:
Two strings S1 and S2 separated with a line feed character.
Output:
The calculated number.
Example:
|
Input |
Output |
|
R7 1 I*HrJm9 |
11 |