[{"authors":"Florian Frank","built_at":"1980-01-02T00:00:00.000Z","created_at":"2026-06-05T17:55:36.811Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":179965,"metadata":{},"number":"0.7.0","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 2.4","prerelease":false,"ruby_abi":null,"licenses":["Apache-2.0"],"requirements":[],"sha":"d503a09a3b73f96b3ecb14347dcb149830555771a23a9b24e1c4d9f39de03e2b","spec_sha":"d4c94d8b019f2e16fd1d1faa897d25f1b60bf21502de37e97779c0bd0d8e3b6d"},{"authors":"Florian Frank","built_at":"1980-01-02T00:00:00.000Z","created_at":"2025-12-19T16:50:37.161Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":371749,"metadata":{},"number":"0.6.0","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 2.4","prerelease":false,"ruby_abi":null,"licenses":["Apache-2.0"],"requirements":[],"sha":"247996bdce87754a42ed38ce8b22a4b8162e1699a8d353bc36bc96b544bd509d","spec_sha":"2924b2728005ccf5e07f160bcab745253f8dba7d17be14967af64b59ec7f5869"},{"authors":"Florian Frank","built_at":"1980-01-02T00:00:00.000Z","created_at":"2025-09-11T14:25:21.861Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":168051,"metadata":{},"number":"0.5.0","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 2.4","prerelease":false,"ruby_abi":null,"licenses":["Apache-2.0"],"requirements":[],"sha":"fdf3796d7a8bb957f8bbf04faa3ba06e7aba95f2eaabfe0bf7c46d0e70b9aec3","spec_sha":"56995a4155332a4d9e8160129b3b6ec0af632392695ea109cebfb18c8696f18a"},{"authors":"Florian Frank","built_at":"1980-01-02T00:00:00.000Z","created_at":"2025-07-10T21:19:54.500Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":740706,"metadata":{},"number":"0.4.2","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 2.4","prerelease":false,"ruby_abi":null,"licenses":["Apache-2.0"],"requirements":[],"sha":"5a7c8c08882864621b81bf3bbc0447bb638afe6066ceeead6b9d11f34cf0d911","spec_sha":"ad48881051ca692ed843edf99e1ef3bb3b5f5706a8d844e94ab7a03309d1b935"},{"authors":"Florian Frank","built_at":"2022-05-15T00:00:00.000Z","created_at":"2022-05-15T10:39:37.426Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":24919056,"metadata":{},"number":"0.4.1","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 2.4","prerelease":false,"ruby_abi":null,"licenses":["Apache-2.0"],"requirements":[],"sha":"d3ff15226a2e627c72802e94579db829e5e10c96cf89d329494caec5889145f7","spec_sha":"dbad284654a43c4a5874840e143335d299d92a84878308b771d57b1c442748ee"},{"authors":"Florian Frank","built_at":"2017-07-04T00:00:00.000Z","created_at":"2017-07-04T15:16:10.321Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":3575590,"metadata":{},"number":"0.4.0","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"ruby_abi":null,"licenses":["Apache-2.0"],"requirements":[],"sha":"b22249ba04464dfaa737b39c1be389f34faf82309e5053a006f321cc6aa0ba09","spec_sha":"b7f24a39edcb1c47998fcd86559f1e7e7ad572b1c2be12352416abc9b9f65ab9"},{"authors":"Florian Frank","built_at":"2017-05-23T00:00:00.000Z","created_at":"2017-05-23T11:08:51.598Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":203973,"metadata":{},"number":"0.3.1","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"ruby_abi":null,"licenses":["GPL"],"requirements":[],"sha":"7f7a1b388fd6af5fe4cf3aaca1ac6dbdf41c35c283f39d525a92d5f647f446dd","spec_sha":"a17bed0babfd5d93ccf542ecab8f21553d1ce780fb7343173c2669c894cbc808"},{"authors":"Florian Frank","built_at":"2014-03-27T00:00:00.000Z","created_at":"2014-03-27T14:22:26.092Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":587246,"metadata":{},"number":"0.3.0","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"ruby_abi":null,"licenses":[],"requirements":[],"sha":"669bac06769ab21d2fbd87839b5aa1b1d9e0eb39971b4404fe88de103685f45d","spec_sha":"92121c5aeb88d6f28c6deed8034d23317609b5d2cfe786f3f56edb2f5b2bf702"},{"authors":"Florian Frank","built_at":"2013-01-16T00:00:00.000Z","created_at":"2013-01-16T15:52:23.966Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":1181984,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.11","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":[],"requirements":null,"sha":"3955bd06c0f9a208dd38bec6c2bc55d5aa8839c934e491f72ce99a48717a52ef","spec_sha":"baafe9912e7feb204a0f12770f3189196663673bcf2ac24a41045dbe768b39ae"},{"authors":"Florian Frank","built_at":"2012-02-06T00:00:00.000Z","created_at":"2012-02-06T21:55:43.414Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":74883,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.10","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"43d862821173432fbcc870b402fdfe6a966fde7f760fc4f9283af57e7951c263","spec_sha":"06dd618814d73759f5176c3c9ce1d4f3fd85d5e7088262bd816a623edb99ab75"},{"authors":"Florian Frank","built_at":"2011-11-15T00:00:00.000Z","created_at":"2011-11-15T08:20:56.737Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":10922,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.9","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"b8638f4ed5c2e58a68d71ac047c77a2f9b12004b663775f9a45e3284994cd5f8","spec_sha":"3ccf92c9ebdf5526b3b3b1e8b68c3d99d78c0b9a2ee14b7e265e3569f8d143d2"},{"authors":"Florian Frank","built_at":"2011-09-25T00:00:00.000Z","created_at":"2011-09-25T22:50:22.543Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":16373,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.8","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"d25fc85a82cb2410b29b77b8e719b24582e49bc374d300a2c730e1e7ec131d4b","spec_sha":"5bde2edb34d1e92e7cde41403b534eba029754eec14981208a86358923b4b354"},{"authors":"Florian Frank","built_at":"2011-08-05T00:00:00.000Z","created_at":"2011-08-05T23:22:38.796Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":10451,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.7","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"6ee54fac59cfb30b6b8818a0795e947d233b45fd125a6ddf9d296c26c3246a39","spec_sha":"bbef5cb7dd0485f12a89473ebfa44c274611ed215908912202a6a9d23dcd5fe1"},{"authors":"Florian Frank","built_at":"2011-07-15T22:00:00.000Z","created_at":"2011-07-16T17:11:25.901Z","description":"Library to tail files in Ruby","downloads_count":14570,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.6","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"464701979a154f2c31a32e4b0e0f99c357d206a9214f74c97db6d2b536db95fe","spec_sha":"873172158e32b6263a081ba725c5f13d51ca902ff41d312d7cd53574fa4aa501"},{"authors":"Florian Frank","built_at":"2009-09-25T01:00:00.000Z","created_at":"2009-09-28T09:22:38.583Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":6327,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.5","summary":"Approximate String Matching library","platform":"x86-mswin32","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"dedc0bac38b11dadb3d6dbcc008563e0f8b48ef906641cc1683761c147c6d786","spec_sha":"014d4fa0006c2e404221c574986b56f183ab1b2ca6f2cdb368eb22909d44d2ea"},{"authors":"Florian Frank","built_at":"2009-09-25T01:00:00.000Z","created_at":"2009-09-28T09:22:38.154Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":45390,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.5","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"a77602917c18ab72ce9b3490f091963710b0dbc7e3ff667ca00de6ca6155b8a5","spec_sha":"a79885ab730dc8a091f761e97203aae42772570cfa7075b55277ea57ae239c4a"},{"authors":"Florian Frank","built_at":"2009-08-26T01:00:00.000Z","created_at":"2009-09-10T01:39:03.000Z","description":"Amatch is a library for approximate string matching and searching in strings.\nSeveral algorithms can be used to do this, and it's also possible to compute a\nsimilarity metric number between 0.0 and 1.0 for two given strings.\n","downloads_count":6337,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.4","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":null,"prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"327c7cf55a2c835820ffc748150cbba4477e35bd73947b07b35a862bc2726e30","spec_sha":"df50655710c0f69bfd71a35664e8ad215d6bfad98ee5b8ca88a092ac33820651"},{"authors":"Florian Frank","built_at":"2006-09-25T22:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.","downloads_count":7444,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.3","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"7f1808f0f0850f9b8359ce13044a7aad4f6551495f0820040c441bec75c04f16","spec_sha":"1427a60b02527fb7ba794d86c3d11a7d43a8c4af423bd1695187c48fb3548682"},{"authors":"Florian Frank","built_at":"2005-11-09T23:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.","downloads_count":6155,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.2","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"057e3a58031174df6367c77933265badb52b6202e1c644ac3717aef050240c5a","spec_sha":"6972e5f6bf00f4374c3e5b6ec29abf4badf09c6a24bf08b7cd490a6971d9b64c"},{"authors":"Florian Frank","built_at":"2005-09-11T22:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.","downloads_count":6384,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.1","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"3ada1e6167c31c5cce4be4df00ea08d61ffd5f8bb633d804b27659398b5cae7b","spec_sha":"4e3314f6223c6e6c34b3393c16798a8f2da83d413475b1928c205ead6ac3efc9"},{"authors":"Florian Frank","built_at":"2005-06-01T04:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching in strings. Several algorithms can be used to do this, and it's also possible to compute a similarity metric number between 0.0 and 1.0 for two given strings.","downloads_count":6502,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.2.0","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"f9dbef67a713f6c73c8ac1066d869c93619ed63cde2fe689538bccc1eba02ad2","spec_sha":"14642d5437c5a879e048207e6b6f500b4ad0867ee33ca3c011f5e42c3feb37fd"},{"authors":"Florian Frank","built_at":"2005-05-26T04:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching using a dynamic programming algorithm to compute the Levenstein distance between strings.","downloads_count":6063,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.1.5","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"980ba76ac0e160e690df7c433e9e0aab3053306b3a855180953a8c5875527117","spec_sha":"9f0d219cd90e5e8060d47a94009cb565cbef9cd50ca267bf1ee56e68281281b3"},{"authors":"","built_at":"2005-01-20T05:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching using a dynamic programming algorithm to compute the Levenstein distance between strings.","downloads_count":6452,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.1.4","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"21a8c813604f5d38681775763df7dbafdcdf9a23dd7e92dee17cecb7c1772dfb","spec_sha":"c740c88311ee5a9410c14c9076846accd773ab3eabbcab614f1982f2ca2db3a1"},{"authors":"","built_at":"2004-09-27T04:00:00.000Z","created_at":"2009-07-25T18:34:22.000Z","description":"Amatch is a library for approximate string matching and searching using a dynamic programming algorithm to compute the Levenstein distance between strings.","downloads_count":6248,"metadata":{"wiki_uri":"","homepage_uri":"http://github.com/flori/amatch","bug_tracker_uri":"http://github.com/flori/amatch/issues","source_code_uri":"http://github.com/flori/amatch","mailing_list_uri":"","documentation_uri":"http://flori.github.com/amatch/doc/index.html"},"number":"0.1.3","summary":"Approximate String Matching library","platform":"ruby","rubygems_version":">= 0","ruby_version":"> 0.0.0","prerelease":false,"ruby_abi":null,"licenses":null,"requirements":null,"sha":"235d44bcb3e5dd46ca1404185d70e39a107151891c934318216d2c36347944ce","spec_sha":"ebc88a2d2ba18134d1a0289cbe5f928617f42159fba2e5416046891a67dcabf5"}]