superstrijder15

Members
  • Content Count

    349
  • Joined

  • Last visited

Community Reputation

236 Excellent

About superstrijder15

  • Rank
    Builder of Worlds

Contact Methods

  • Website URL Array

Profile Information

  • Location Array
  • Interests Array

Recent Profile Visitors

1,846 profile views
  1. 21 hours is pretty good relative to my track record! Half the time in the last year I read the chapters people release a month late or more!
  2. Yeah, it could be great, but on the other hand my laptop already has trouble now, which is one of the reasons I barely play anymore, and this will obviously not help in that department.
  3. I got likes from LordOfTheNorth too! Already pretty far in he is, I'm interested in what he'll think by the end of it EDIT: This like has now taken me back to the era of when I first commented in this thread, and you mention Fire in the Sky, which made me think of this song:
  4. Ooh, the Kerm will get to talk to another? I'm very interested to see if they can think of a faster communication protocol after they telegrammed with each other for a while, I think for a Kerm there must be a more efficient way to compress information than English New Kerba telegram by morse code
  5. Noooo! Not the space program! How can you do this!
  6. So I forgot whether this was maybe already mentioned once, but copper is very, very straight. It looks suspiciously like you could attach an engine module on the front and pull the entire thing around the system. Is it going to be a huge mothership for some far mission?
  7. That seems like a good idea. I'll also try to upload my programs to a drive folder, so others can try to do stuff with it.
  8. Don't think I do understand anything! I could try to find the verb and noun first, but that would require a completly different approach from what I have now. Let my try to explain what my program does: I take the input string, cut it into words at the spaces(1), then try to parse each word. With each word, I start by comparing its beginning to each verb root(2). If I find the right one, I take out the root and add it to output, then see if the next fits any of the verb endings, and add its translation to the output as well(3). Then it does step (2) with nouns again, and then it tries to find prefixes and suffixes. The program also saves whether we already found a verb or noun in this word, for purposes of negation of pre and suffixes. Using this and the technique from (2), the system then tries to find any prefixes. All these steps are repeated until after a full attempt there is no change, then the remainder is put into output is tagged as untranslatable and we continue to the next word(4). for example: "Jebediah ebad belonmansatha" (1) ["Jebediah", "ebad", "belonmansatha"] (2) "akhat" == "ebad" -> False. "akh" == "eba" -> False. ... "eb" == "eb" -> True: output = output + "to be" (3) "da" == "ad" -> False. ... "ad" == "ad" -> True: output = output + "(we)" (4) we tried everything on "Jebediah", but nothing worked. So output = output + "<Jebediah>" It could also be possible to write a program that tries to fit those nouns and verbs to each bit of a word, but that would require making a thing with nouns only instead of 'everything nounlike'. Let's see if I can get that working... You seem to know more about this. Do you know how languages are usually parsed by computers?
  9. Aah, my division might be a bit different than that of a proper linguist. For my program, a verb is something that is conjugated via the standard conjugation scheme(s), a root which has a number of possible endings which carry slightly different meanings in a standardized way. A prefix or suffix is something that can typically only exist attached to a root word, whether verb or noun, it is the equivalent of the adjectives in English. A noun is a catch-all for stuff that can occur as the root of a word but isn't conjugatable. In this scheme, things that cannot stand on their own would typically be a prefix, but then again they can apparently also be conjugated so they are a verb. Annoying things these.
  10. -<Jebediah> --to be(I) --accomplisher of-<ad> --dependence on-biggest-deed or task-(plural) It interprets bel as a noun, because it isn't in the database as a verb. After adding it as 'to accomplish', I got this: -<Jebediah> --to be(I) --to accomplish(we) --dependence on-biggest-deed or task-(plural) The translations aren't even near google translate in 2015 levels yet, but I think it looks at lot at the way writers write the way a new translater still learning a language would talk, which is nice too. And indeed, this is all fresh from my google docs document, which has a tiny issue of not being updated with things you updated in chapters, and missing information if I didn't copy everything diligently.
  11. Alright guys, I think my code works. Now I need to test it for further errors or stuff that the database misses (and maybe make the output sound more like English). For example I think that I miss quite a few words in "Erbabar-beldaonerba ebda berot pilla", since it comes out as "-<Erbabar> --accomplisher of-<daonerba> --to be(they) -<berot> -<pilla>" Also, here is the translation of "Jebediah ebad belonmansatha:": "-<Jebediah> --to be(we) --accomplisher of-dependence on-biggest-deed or task-(plural)". Pretty close to the "Jebediah, we are the persons on which the biggest actions depend" that was meant, right?
  12. Don't get too excited! By now I have: * Loaded my current lists into python dictionaries. My original format was pretty inconsistent so I had to write a converter. The converter has built-in warning messages though! * Seperated the input into words. It seperates at each space, hypen, newline and tab character. * An attempt at translating individual words, starting by trying out all pronouns until none fit, then trying out all nouns and verbs (it even find the right person), then continuing to try all suffixes until none fit. This procedure isn't perfect, as your mention of Boladakhat demonstrates: The output comes out as -place of accomplishing-<adakhat> It gets stuck when there is a suffix in the middle (or possibly Bol is used as a verb here, but since it already took that as a noun it doesn't even look, and it isn't in my file) Edit: the <> means that this part was untranslatable
  13. Alright, let's go. (Yes, the answer is right below it, but who cares): BTW I've done a bit more coding now and I feel like making a program that attempts to interpret Old Kerba. It'll be pretty naive at the start, but good practice on coding weird things.