by Hub Space
This flow query the telephony data content provider to get all contacts and store them in an array.
The user has to input a name via voice recognition or text input.
Due the input may not equals the telephone entry with a match of 100% we need to calculate the levenshtein value for each contact.
Afterwards we sort our array by this value and the name with the highest (lowest) conformity will be returned.
The performance of this algorithm could be improved by finding the lowest levenshtein value instead of sorting the whole array.
Rate and review within the app in the Community section.