| { |
| "name": "LevenshteinSwift", |
| "version": "1.0.0", |
| "summary": "Compute Levenshtein string distances using Swift.", |
| "description": "[Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) is a measure of the difference between two strings. It can be used for fuzzy searching, among other things. This is an implementation in Swift 1.2, based on Mark Aufflick's Objective-C \"NSString+Levenshtein\".", |
| "homepage": "https://github.com/coryalder/LevenshteinSwift", |
| "license": "MIT", |
| "authors": { |
| "Cory Alder": "cory@davander.com" |
| }, |
| "source": { |
| "git": "https://github.com/coryalder/LevenshteinSwift.git", |
| "tag": "1.0.0" |
| }, |
| "social_media_url": "https://twitter.com/corydmc", |
| "platforms": { |
| "ios": "8.0" |
| }, |
| "requires_arc": true, |
| "source_files": "*.swift", |
| "frameworks": "Foundation" |
| } |
