Difference between revisions of "User:Asfrent/MSc Log"
Jump to navigation
Jump to search
(→Log) |
|||
| Line 63: | Line 63: | ||
* Wrote stream tokenizer in Prolog. |
* Wrote stream tokenizer in Prolog. |
||
* Wrote token splitter in Prolog. |
* Wrote token splitter in Prolog. |
||
=== 13.07.2014 === |
|||
* Implemented and tested output writer. |
|||
* Implemented a trivial disambiguator that always selects the first reading. The number of mismatches from the hand tagged version lowered from 107 to 45 (this was kind of a test to ensure the two are actually aligned and match a bit better). |
|||
* Designed the internal structure of the data. We will keep the initial split tokens in lists and remove tags from these lists. Each one of the lists will have a metadata slot allocated somewhere (probably in a metadata list). I should research hashtables, trees, or whatever fast lookup data structure Prolog might have. |
|||
Revision as of 23:08, 13 July 2014
Contents
MSc
Plan, questions, stuff
Short term plan / Pendings
| Pending | Estimated date | Notes |
|---|---|---|
| Write a DCG for the apertium stream format. | ||
| Research UTF and Prolog. | ||
| Write a simple PoS disambiguator that makes a random choice. | ||
| Set up a repository for the project. | ||
| Check licensing of MIL code. | ||
| Design internal representation of the input data. | ||
| Design rules. | ||
| Implement basic predicates. | ||
| Learn rules using MIL. |
Questions
Log
11.07.2014
- Read ILP paper from Francis.
- Got MIL code, did a few tests.
- Tracked down and downloaded test data from Apertium project for the tagger.
- Read about tagging, CG and rules.
- Wrote a Prolog script that reads all the lines from a file.
12.07.2014
- Started to read CG docs in order to make the design of the data structures.
- Did a bit of research on Prolog DCG.
- Wrote stream tokenizer in Prolog.
- Wrote token splitter in Prolog.
13.07.2014
- Implemented and tested output writer.
- Implemented a trivial disambiguator that always selects the first reading. The number of mismatches from the hand tagged version lowered from 107 to 45 (this was kind of a test to ensure the two are actually aligned and match a bit better).
- Designed the internal structure of the data. We will keep the initial split tokens in lists and remove tags from these lists. Each one of the lists will have a metadata slot allocated somewhere (probably in a metadata list). I should research hashtables, trees, or whatever fast lookup data structure Prolog might have.
