{
  "name": "MDCDamerauLevenshtein",
  "version": "0.1.0",
  "summary": "Categories to calculate the edit distance between NSString objects.",
  "description": "                   MDCDamerauLevenshtein includes two algorithms for calculating\n                   the edit distance between NSString objects:\n\n                   1. Levenshtein distance calculates the number of insertions,\n                      deletions, and substitions necessary in order to convert one\n                      string into the other.\n                   2. Damerau-Levenshtein improves upon Levenshtein to include the\n                      transposition of two adjacent characters. Damerau states that\n                      some combination of the four operations make up for 80% of all\n                      human spelling errors.\n\n                   Potential applications for this library:\n\n                   - Don't just use `-[NSString compare:options:]` to filter search results,\n                     display terms with small edit distances.\n                   - ...and many more!\n",
  "homepage": "https://github.com/modocache/MDCDamerauLevenshtein",
  "license": {
    "type": "MIT",
    "file": "LICENSE"
  },
  "authors": {
    "modocache": "modocache@gmail.com"
  },
  "social_media_url": "http://twitter.com/modocache",
  "source": {
    "git": "https://github.com/modocache/MDCDamerauLevenshtein.git",
    "tag": "v0.1.0"
  },
  "source_files": "MDCDamerauLevenshtein/**/*.{h,m}",
  "public_header_files": [
    "MDCDamerauLevenshtein/MDCDamerauLevenshtein.h",
    "MDCDamerauLevenshtein/Categories/*.h"
  ],
  "xcconfig": {
    "OTHER_LDFLAGS": "-all_load"
  },
  "requires_arc": true
}