josephg
commented
12 years ago After this discussion on the mailing list, I might swap back to using composable ops for text. This avoids the n^2 complexity problem.
Open josephg opened 13 years ago
josephg
commented
12 years ago After this discussion on the mailing list, I might swap back to using composable ops for text. This avoids the n^2 complexity problem.
The current text OT type has quadratic transform time for transforming lists of operations.
It should be possible to speed this up immensely by using clever algorithms.