Created: Tue 2018-02-06
wed feb 28
- continued reading parsing slides.
- it was the last lecture of this parsing course. And everything is pushing to the deadline. Have to focus more on study. But it is really tiring.
tue feb 27
- was late for morning lecture, but with the help of classmate, understood how the process of “left-arc” ”right-arc” ”shift” etc work.
- again, the most important thing is to wake up early in the morning and check what to do during the day. otherwise the whole day would go to waste.
- the small library at Blåsenhus is lovely. Wish bright light inside, huge glass walls (transparent from both sides), pedestrians can see whose inside and sitting inside, you can see the domkyrka and slottet clearly.
mon feb 26
- list the most important points in the parsing course (just a plan. didn't finish it.)
- proposed a parsing course project by monday night, got reply in the afternoon of Tuesday. It was a last-minute submission of half-baked idea. And the reply raised simple and basic questions that had never ever occurred to me.
sun feb 25
- didn't notice a deadline. scratching for life.
thu feb 22
- It seems I have figured out how to do the recursion successfully. It's surprisingly simple, in the end. Will have to figure out some bugs in other parts of the code.
- Also, continued in the algorithm textbook. Also made some small but lovely progress.
- Continued with linear algebra in Brilliant. Specifically, how to do a Gaussian elimination with a matrix. That's where it gets confusing.
- The final part about Gaussian elimination was confusing, esp when it said “linear algebra is all about solving equations like Ax = b”.
- Linear Algebra Done Right seems a good textbook for beginners.
wed feb 21
- Lecture of syntactic parsing in the morning.
- Read through programming slides.
- Continued linear algebra on brilliant.
- something about Gaussian Elimination (I know it's rookie.)
- Fell back to the algorithm book to get some inspiration about the recursion problem that I've been stuck at.
- about Recursion
tue feb 20
- During the vacation, took part in a seminar.
- took a vacation
sat feb 10
- tried some tactics on recursively solve the assignment.
- will try to finish the coding part of assignment by tonight.
fri feb 9
- should be panicking by now. self-imposed deadline is approaching.
- I developed a way to help focus more time on study, which is do two or four study tasks at one time. This is helpful because before this, I'd be tired after one or two pomodoros. Then I'd relax for too long and the whole point of pomodoro technique is lost.
- When I work on two or three tasks at one time, eg. doing programming assignment, reading textbook, and solving math problems, if my brain stops working after one or two pomos on one thing, I could regain focus by moving to another task that is equally constructive. Working on a different task refreshes your brain by using it from a different “angle”. And indeed, I spent a lot of time on study. Although I am still stuck on the parsing assignment (recursion problem that is a little too abstract for me), I managed to read some textbook instead of falling asleep.
thu feb 8
- two minor things that are not really worth mentioning:
- worked on code (slowly)
- continued with linear algebra quizzes on brilliant.
wed feb 7
- Spent most time of the day thinking about how to write that piece of code. Still think the best way is to call a function recursively.
- Also thought of turn the input form into a graph (or a matrix). As the form seems natural and transparent. Then it seems very complicated to implement. It needs a Head class and a Node class. And the Node class requires methods to change itself and move itself.
- Tomorrow I'll have to finish the recursive function approach. Will only try the class approach if I had time.
tue feb 6
- For no particular reason, I paused writing TIL notes for a week. Need to spend more time on pomodoro. Writing TIL by week will just build a few very short pages. May as well change back to write by month.
- Today listened to a lecture about PCFG. In which two examples of CNF converter are given. Didn't notice it is the first part of assignment until in the afternoon.
- For the purpose of finishing this assignment, Earley algorithm is not covered. (Relief.)
- Read chapter 13 (without Earley, which is smart though) and the first section of chapter 14. Still need to do more reading to be able to start working on the assignment.