{"action":"created","issue":{"url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie/issues/16","repository_url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie","labels_url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie/issues/16/labels{/name}","comments_url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie/issues/16/comments","events_url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie/issues/16/events","html_url":"https://github.com/hankcs/AhoCorasickDoubleArrayTrie/issues/16","id":345597098,"node_id":"MDU6SXNzdWUzNDU1OTcwOTg=","number":16,"title":"是否可以实现正向最长匹配","user":{"login":"tonyliangli","id":16441239,"node_id":"MDQ6VXNlcjE2NDQxMjM5","avatar_url":"https://avatars2.githubusercontent.com/u/16441239?v=4","gravatar_id":"","url":"https://api.github.com/users/tonyliangli","html_url":"https://github.com/tonyliangli","followers_url":"https://api.github.com/users/tonyliangli/followers","following_url":"https://api.github.com/users/tonyliangli/following{/other_user}","gists_url":"https://api.github.com/users/tonyliangli/gists{/gist_id}","starred_url":"https://api.github.com/users/tonyliangli/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tonyliangli/subscriptions","organizations_url":"https://api.github.com/users/tonyliangli/orgs","repos_url":"https://api.github.com/users/tonyliangli/repos","events_url":"https://api.github.com/users/tonyliangli/events{/privacy}","received_events_url":"https://api.github.com/users/tonyliangli/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-07-30T03:16:17Z","updated_at":"2018-08-04T08:58:03Z","closed_at":null,"author_association":"NONE","body":"您好，\r\n    试用了本项目的双数组AC自动机，比较好用。请问是否能够提供单独的最长匹配方法？\r\n    另外看到HanLP项目com.hankcs.hanlp.collection.trie包中的DoubleArrayTrie.java提供了parseLongestText最长匹配方法，我直接调用可以实现最长匹配。请问该方法是否基于您本项目的双数组AC自动机呢？性能如何？谢谢。"},"comment":{"url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie/issues/comments/410435132","html_url":"https://github.com/hankcs/AhoCorasickDoubleArrayTrie/issues/16#issuecomment-410435132","issue_url":"https://api.github.com/repos/hankcs/AhoCorasickDoubleArrayTrie/issues/16","id":410435132,"node_id":"MDEyOklzc3VlQ29tbWVudDQxMDQzNTEzMg==","user":{"login":"hankcs","id":5326890,"node_id":"MDQ6VXNlcjUzMjY4OTA=","avatar_url":"https://avatars0.githubusercontent.com/u/5326890?v=4","gravatar_id":"","url":"https://api.github.com/users/hankcs","html_url":"https://github.com/hankcs","followers_url":"https://api.github.com/users/hankcs/followers","following_url":"https://api.github.com/users/hankcs/following{/other_user}","gists_url":"https://api.github.com/users/hankcs/gists{/gist_id}","starred_url":"https://api.github.com/users/hankcs/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/hankcs/subscriptions","organizations_url":"https://api.github.com/users/hankcs/orgs","repos_url":"https://api.github.com/users/hankcs/repos","events_url":"https://api.github.com/users/hankcs/events{/privacy}","received_events_url":"https://api.github.com/users/hankcs/received_events","type":"User","site_admin":false},"created_at":"2018-08-04T08:58:03Z","updated_at":"2018-08-04T08:58:03Z","author_association":"OWNER","body":"请使用HanLP中的parseLongestText，核心代码与本项目一致。性能与场景有关，需做实验确定。"}}
{"actor":{"display_login":"hankcs"}}