[
https://issues.apache.org/jira/browse/LUCENE-3830?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13265888#comment-13265888
]
Robert Muir commented on LUCENE-3830:
-------------------------------------
I only glanced at the Schulz/Mihov paper, but it seemed like in order for it to
work you have
to add extra transitions (loops) which would make the FST infinite? (could be
totally wrong here)
Maybe there is some creative way we could do this, but thats just in addition
to the fact the
paper is ... like their other papers and would take some work to decode anyway
:)
> MappingCharFilter could be improved by switching to an FST.
> -----------------------------------------------------------
>
> Key: LUCENE-3830
> URL: https://issues.apache.org/jira/browse/LUCENE-3830
> Project: Lucene - Java
> Issue Type: Improvement
> Reporter: Dawid Weiss
> Assignee: Michael McCandless
> Priority: Minor
> Labels: gsoc2012, lucene-gsoc-12
> Fix For: 4.0
>
> Attachments: LUCENE-3830.patch
>
>
> MappingCharFilter stores an overly complex tree-like structure for matching
> input patterns. The input is a union of fixed strings mapped to a set of
> fixed strings; an fst matcher would be ideal here and provide both memory and
> speed improvement I bet.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
