Let's find non-overlapping subsets of the language that are themselves complete languages.
@drethelin Say J1 has する, most on-yomi, は, です, な-adj, while J2 has other verbs, kun-yomi, い-adj, の, が, and だ. Not sure about を, に, と, etc.
-
-
@InstanceOfClass you can also reassign katakana to one of the languages for "clarity" -
@drethelin European loan-words could almost form a third language but I'm not sure if there enough particles to go around.
End of conversation
New conversation -
-
-
@InstanceOfClass@drethelin What are the requirements for completeness, in this case?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.