|
|
|
|
|
|
by arthur_sonzogni
1637 days ago
|
|
|
That would be awesome. However, this sounds a bit hard to do ;-) Would you had any ideas how to do it?
I guess:
1. some custom logic very difficult to write for every translators.
2. some genetic algorithm to reconstruct the input, given the output, using the string levenshtein distance. Every translators are independants, so this would require |
|
|