[
https://issues.apache.org/jira/browse/JOSHUA-128?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Lewis John McGibbney reopened JOSHUA-128:
-----------------------------------------
> Lattice issues
> --------------
>
> Key: JOSHUA-128
> URL: https://issues.apache.org/jira/browse/JOSHUA-128
> Project: Joshua
> Issue Type: Bug
> Reporter: Matt Post
> Assignee: Matt Post
> Fix For: 6.1
>
>
> Joshua truncates sentences to 200 tokens, but turns them into a lattice first
> and computes the shortest path between all pairs. This causes huge problems
> for buggy input (e.g.,
> https://groups.google.com/forum/#!topic/joshua_support/-2PykKqbnU4 ). A
> couple things that should change:
> - Don't apply an O(n^2) algorithm to buggy input. Maybe only call
> calculateAllPairsShortestPaths() lazily.
> - Compute it more efficiently (for example, if you know the input is just a
> sentence, you could add some shortcuts)
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
