package.json 1.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
  1. {
  2. "name": "leven",
  3. "version": "3.1.0",
  4. "description": "Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm",
  5. "license": "MIT",
  6. "repository": "sindresorhus/leven",
  7. "author": {
  8. "name": "Sindre Sorhus",
  9. "email": "sindresorhus@gmail.com",
  10. "url": "sindresorhus.com"
  11. },
  12. "engines": {
  13. "node": ">=6"
  14. },
  15. "scripts": {
  16. "test": "xo && ava && tsd",
  17. "bench": "matcha bench.js"
  18. },
  19. "files": [
  20. "index.js",
  21. "index.d.ts"
  22. ],
  23. "keywords": [
  24. "leven",
  25. "levenshtein",
  26. "distance",
  27. "algorithm",
  28. "algo",
  29. "string",
  30. "difference",
  31. "diff",
  32. "fast",
  33. "fuzzy",
  34. "similar",
  35. "similarity",
  36. "compare",
  37. "comparison",
  38. "edit",
  39. "text",
  40. "match",
  41. "matching"
  42. ],
  43. "devDependencies": {
  44. "ava": "^1.4.1",
  45. "fast-levenshtein": "^2.0.6",
  46. "ld": "^0.1.0",
  47. "levdist": "^2.2.9",
  48. "levenshtein": "^1.0.5",
  49. "levenshtein-component": "^0.0.1",
  50. "levenshtein-edit-distance": "^2.0.3",
  51. "matcha": "^0.7.0",
  52. "natural": "^0.6.3",
  53. "talisman": "^0.21.0",
  54. "tsd": "^0.7.2",
  55. "xo": "^0.24.0"
  56. }
  57. }