package.json 1.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  1. {
  2. "name": "leven",
  3. "version": "2.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": ">=0.10.0"
  14. },
  15. "scripts": {
  16. "test": "xo && ava",
  17. "bench": "matcha bench.js"
  18. },
  19. "files": [
  20. "index.js"
  21. ],
  22. "keywords": [
  23. "leven",
  24. "levenshtein",
  25. "distance",
  26. "algorithm",
  27. "algo",
  28. "string",
  29. "difference",
  30. "diff",
  31. "fast",
  32. "fuzzy",
  33. "similar",
  34. "similarity",
  35. "compare",
  36. "comparison",
  37. "edit",
  38. "text",
  39. "match",
  40. "matching"
  41. ],
  42. "devDependencies": {
  43. "ava": "^0.17.0",
  44. "fast-levenshtein": "^2.0.5",
  45. "ld": "^0.1.0",
  46. "levdist": "^2.0.0",
  47. "levenshtein": "^1.0.4",
  48. "levenshtein-component": "0.0.1",
  49. "levenshtein-edit-distance": "^2.0.0",
  50. "matcha": "^0.7.0",
  51. "natural": "^0.4.0",
  52. "talisman": "^0.18.0",
  53. "xo": "^0.16.0"
  54. }
  55. }