here’s a thought from the algorithm world: hamming is the upper bound on levenshtein.
does that help you? -w > On Dec 24, 2015, at 4:10 AM, Yonghui Zhao <zhaoyong...@gmail.com> wrote: > > I mean sort and filter. I want to filter all documents within some > hamming distances say 3, and sort them from distance 0 to 3. > > 2015-12-22 21:42 GMT+08:00 will martin <wmartin...@gmail.com>: > >> Yonghui: >> >> Do you mean sort, rank or score? >> >> Thanks, >> Will >> >> >> >>> On Dec 22, 2015, at 4:02 AM, Yonghui Zhao <zhaoyong...@gmail.com> wrote: >>> >>> Hi, >>> >>> Is there any query can sort docs by hamming distance if field values are >>> same length, >>> >>> Seems fuzzy query only works on edit distance. >> >> >> --------------------------------------------------------------------- >> To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org >> For additional commands, e-mail: java-user-h...@lucene.apache.org >> >> --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
