{"action":"created","issue":{"url":"https://api.github.com/repos/ManuelSchneid3r/albert/issues/41","labels_url":"https://api.github.com/repos/ManuelSchneid3r/albert/issues/41/labels{/name}","comments_url":"https://api.github.com/repos/ManuelSchneid3r/albert/issues/41/comments","events_url":"https://api.github.com/repos/ManuelSchneid3r/albert/issues/41/events","html_url":"https://github.com/ManuelSchneid3r/albert/issues/41","id":102667326,"number":41,"title":"Please allow matching of substrings inside file names","user":{"login":"sb56637","id":2692138,"avatar_url":"https://avatars.githubusercontent.com/u/2692138?v=3","gravatar_id":"","url":"https://api.github.com/users/sb56637","html_url":"https://github.com/sb56637","followers_url":"https://api.github.com/users/sb56637/followers","following_url":"https://api.github.com/users/sb56637/following{/other_user}","gists_url":"https://api.github.com/users/sb56637/gists{/gist_id}","starred_url":"https://api.github.com/users/sb56637/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/sb56637/subscriptions","organizations_url":"https://api.github.com/users/sb56637/orgs","repos_url":"https://api.github.com/users/sb56637/repos","events_url":"https://api.github.com/users/sb56637/events{/privacy}","received_events_url":"https://api.github.com/users/sb56637/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/ManuelSchneid3r/albert/labels/enhancement","name":"enhancement","color":"84b6eb"},{"url":"https://api.github.com/repos/ManuelSchneid3r/albert/labels/wontfix","name":"wontfix","color":"ffffff"}],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":6,"created_at":"2015-08-23T22:32:59Z","updated_at":"2015-09-20T15:07:21Z","closed_at":"2015-09-20T13:36:27Z","body":"Hello,\r\n\r\nMost of my filenames are fairly long and specific with prefixes to categorize/tag them. Would it be possible to have an option for Albert to find substrings inside filenames? For example, I have a file called `20150501_QWA_performance_report.odt`. Would it be possible to make it match this filename by searching for `qwa report` or `performance`?\r\n\r\nThanks a lot for coding this useful utility!"},"comment":{"url":"https://api.github.com/repos/ManuelSchneid3r/albert/issues/comments/141795689","html_url":"https://github.com/ManuelSchneid3r/albert/issues/41#issuecomment-141795689","issue_url":"https://api.github.com/repos/ManuelSchneid3r/albert/issues/41","id":141795689,"user":{"login":"ManuelSchneid3r","id":3252315,"avatar_url":"https://avatars.githubusercontent.com/u/3252315?v=3","gravatar_id":"","url":"https://api.github.com/users/ManuelSchneid3r","html_url":"https://github.com/ManuelSchneid3r","followers_url":"https://api.github.com/users/ManuelSchneid3r/followers","following_url":"https://api.github.com/users/ManuelSchneid3r/following{/other_user}","gists_url":"https://api.github.com/users/ManuelSchneid3r/gists{/gist_id}","starred_url":"https://api.github.com/users/ManuelSchneid3r/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ManuelSchneid3r/subscriptions","organizations_url":"https://api.github.com/users/ManuelSchneid3r/orgs","repos_url":"https://api.github.com/users/ManuelSchneid3r/repos","events_url":"https://api.github.com/users/ManuelSchneid3r/events{/privacy}","received_events_url":"https://api.github.com/users/ManuelSchneid3r/received_events","type":"User","site_admin":false},"created_at":"2015-09-20T15:07:21Z","updated_at":"2015-09-20T15:07:21Z","body":"Currently, extensions providing a fuzzy capability use the same framework offered by the core. In both cases (exact/fuzzy) is use an offline algorithm. Both have an inverted index mapping single words to a set of items.\r\nThe prefix search directly outputs the intersection of the sets, which are the mappings of the entered words.\r\nThe fuzzy search does the same but the mapped words itself are again indexed in a qgram index. A query is split in a set of query words Q. Each query word q in Q gets split in its set of Ngrams G_q. Each nGram g_q maps to a set of words W_g_q. These words are filtered by a levensthein match against q. The intersection of the filtered sets is the result.\r\nWell, to your question. A quick glance on the article lets me assume, that I did exactly that. A substring should therefore match.\r\nAside of that usage counters should influence that but #12 makes it useless. Further in future a scoring will influece the order of results.\r\n"}}