{"action":"opened","issue":{"url":"https://api.github.com/repos/polm/node-migemo/issues/1","repository_url":"https://api.github.com/repos/polm/node-migemo","labels_url":"https://api.github.com/repos/polm/node-migemo/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/polm/node-migemo/issues/1/comments","events_url":"https://api.github.com/repos/polm/node-migemo/issues/1/events","html_url":"https://github.com/polm/node-migemo/issues/1","id":131966191,"number":1,"title":"add incremental search at least as an option","user":{"login":"polm","id":286278,"avatar_url":"https://avatars.githubusercontent.com/u/286278?v=3","gravatar_id":"","url":"https://api.github.com/users/polm","html_url":"https://github.com/polm","followers_url":"https://api.github.com/users/polm/followers","following_url":"https://api.github.com/users/polm/following{/other_user}","gists_url":"https://api.github.com/users/polm/gists{/gist_id}","starred_url":"https://api.github.com/users/polm/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/polm/subscriptions","organizations_url":"https://api.github.com/users/polm/orgs","repos_url":"https://api.github.com/users/polm/repos","events_url":"https://api.github.com/users/polm/events{/privacy}","received_events_url":"https://api.github.com/users/polm/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-02-07T13:07:35Z","updated_at":"2016-02-07T13:07:35Z","closed_at":null,"body":"In other migemos typically partial searches match full words, for example \"toukyo\" will match \"東京\". The obvious way to do this is by making the dictionary a recursive tree; this makes it slower (and increases spurious matches) but can be handy. "}}