Difference between revisions of "Cracking the Voynich code 2014"
From Derek
(Created page with "== Supervisors == *Prof Derek Abbott *Dr Brian Ng *Maryam Ebrahimpour ==Honours students== *Bryce Shi *Peter Roush ==Project ...") |
|||
| Line 18: | Line 18: | ||
We already have Support Vector Machine (SVM) and Multiple Discriminant Analysis (MDA) software that you can adapt for your purposes. This software is set up to test if two texts are written by the same author or not. The great thing about our software is that it is independent of language. So you could compare it against the existing writings of Roger Bacon, who is a suspected author | We already have Support Vector Machine (SVM) and Multiple Discriminant Analysis (MDA) software that you can adapt for your purposes. This software is set up to test if two texts are written by the same author or not. The great thing about our software is that it is independent of language. So you could compare it against the existing writings of Roger Bacon, who is a suspected author | ||
| − | == | + | ==Useful notes== |
| − | + | * Download the digital Voynich from [http://www.ic.unicamp.br/~stolfi/voynich/99-01-16-concordance/ here]. | |
| − | * | + | * The UN Declaration of Human Rights is translated into every language in the world and in principle you can compare the Voynich to all the existing languages for statistical proximity. Electronic access is [http://www.ohchr.org/EN/UDHR/Pages/Introduction.aspx here]. |
| − | |||
| − | * | + | ==Specific tasks== |
| + | * '''Phase 1:''' Characterize the text. Write scripts that count its features. How many words? How long is the alphabet? Word frequencies? Probability of one letter following another. Probability of two letter pairs (2-grams) and n-letter group (n-grams). Compare these in a table with known languages obtained by running your same code on the Declaration of Human Rights. Don't forget to get a short paragraph of English and manually count everything and then run it on your code to cross check it is counting correctly. You must always validate your code or you will lose marks. | ||
| − | * | + | * '''Phase 2:''' Write a general descriptor for each picture in the book, eg. water, woman, tree, flower, vegetable, leaf, dancing etc. Associate each descriptor with the appropriate paper. Write some code to find which words on a page are unique to those pages with those descriptors. Which words also suddenly increase in frequency on those pages with shared descriptors? Tabulate the results. |
| − | * | + | * '''Phase 3:''' Investigate the use of Word Recurrence Interval (WRI) versus rank plots. Plot WRI curves of the Voynich versus other languages from the Declaration of Human Rights. |
| − | * | + | * '''Phase 4:''' Think up some of your own ideas to try out. |
| − | * | + | * '''Phase 5:''' As WRI is a language-independent metric, you can select classification features based on WRI. Then you can run an SVM and an MDA classifier to compare the Voynich against other languages in the Declaration of Human Rights. Then you can run it against the works of specific authors of interest such as Roger Bacon, John Dee, and Edward Kelley. |
| − | + | ||
| − | + | ||
==Deliverables== | ==Deliverables== | ||
| Line 42: | Line 40: | ||
===Semester A=== | ===Semester A=== | ||
| − | * Proposal seminar | + | * Proposal seminar |
| − | * Progress report | + | * Progress report - only one report needed in wiki format |
===Semester B=== | ===Semester B=== | ||
| − | * Final seminar | + | * Final seminar |
| − | * Final report | + | * Final report - only one report needed in wiki format |
| − | * Poster | + | * Poster - one poster only needed |
| − | * Project exhibition 'expo' | + | * Project exhibition 'expo' |
| − | * CD or stick containing your whole project directories | + | * Labelled CD or USB stick containing your whole project directories |
| − | * YouTube video | + | * YouTube video - add the URL to this wiki |
== Weekly progress and questions == | == Weekly progress and questions == | ||
This is where you record your progress and ask questions. Make sure you update this every week. | This is where you record your progress and ask questions. Make sure you update this every week. | ||
| − | *[[ | + | *[[Cracking the Voynich code 2014 weekly progress]] |
==Approach and methodology== | ==Approach and methodology== | ||
| − | We expect you to take a structured approach to both the validation | + | We expect you to take a structured approach to both the validation and the writing of the software. You should carefully design the big-picture high-level view of the software modules, and the relationships and interfaces between them. Think also about the data transformations needed. |
| − | + | ||
| − | + | ||
| − | + | ||
== Expectations == | == Expectations == | ||
| − | We don't really expect you to | + | * We don't really expect you to crack the Voynich, though that would be cool if you do and you'll become very famous overnight. |
| + | |||
| + | * To get good marks we expect you to show a logical approach to decisively eliminating some languages and authors, and finding some hints about the statistical nature of the words. | ||
| + | |||
| + | * In your conclusion, you need to come up with a short list of possible hypotheses and a list of things you can definitely eliminate. | ||
| + | |||
| + | * We expect you to critically look at the conclusions of the previous work and highlight to what extent your conclusions agree and where you disagree. | ||
| + | |||
| + | * It is important to regularly see your main supervisors. Don't let more than 2 week go by without them seeing your face briefly. | ||
| + | |||
| + | * You should be making at least one formal progress meeting with supervisors per month. It does not strictly have to be exactly a month, but roughly each month you should be in a position to show some progress and have some problems and difficulties to discuss. On the other hand the meetings can be very frequent in periods when you have a lot of activity and progress to show. | ||
| + | |||
| + | * The onus is on you to drive the meetings, make the appointments, and set them up. | ||
== Relationship to possible career path== | == Relationship to possible career path== | ||
| − | Whilst the project is fascinating as you'll learn about a specific | + | Whilst the project is fascinating as you'll learn about a specific high-profile mystery—and we do want you to have a lot of fun with it—the project does have a hard-core serious engineering side. It will familiarize you with techniques in information theory, probability, statistics, encryption, decryption, signal classification, and datamining. It will also improve your software skills. The new software tools you develop may lead to new IP in the areas of datamining, automatic text language identification, and also make you rich/famous. The types of jobs out there where these skills are useful are in computer security, comms, digital forensics, internet search companies, and language processing software companies. The types of industries that will need you are: the software industry, e-finance industry, e-security, IT industry, Google, telecoms industry, [http://www.asio.gov.au/ ASIO], [http://www.asis.gov.au/ ASIS], defence industry (e.g. [http://www.dsd.gov.au/ DSD]), etc. So go ahead and have fun with this, but keep your eye on the bigger engineering picture and try to build up an appreciation of why these techniques are useful to our industry. Now go crack the Voynich...this message will self-destruct in five seconds :-) |
==See also== | ==See also== | ||
| − | * [[ | + | * [[Cracking the Voynich code]] |
| − | + | * [[Cracking the Voynich code 2014 weekly progress]] | |
| − | * [[ | + | * [[Semester A Progress Report 2014 - Cracking the Voynich code]] |
| − | * [[Semester A Progress Report | + | * [[Semester B Final Report 2014 - Cracking the Voynich code]] |
| − | * [[Semester B Final Report | + | |
| − | + | ==Useful papers we wrote== | |
| − | + | [http://www.eleceng.adelaide.edu.au/personal/dabbott/publications/PLO_ebrahimpour2013.pdf] | |
| − | + | [[Maryam Ebrahimpour|M. Ebrahimpour]], [[Tālis J. Putniņš|T. J. Putniņš]], [[Matthew J. Berryman|M. J. Berryman]], [[Andrew G. Allison|A. Allison]], [[Brian W.-H. Ng|B. W.-H.-Ng]], and '''[[Derek Abbott|D. Abbott]]''', "Automated authorship attribution using advanced signal classification techniques," ''PLoS ONE'', '''Vol. 8,''' No. 2, Art. No. e54998, 2013, http://dx.doi.org/10.1371/journal.pone.0054998 | |
| + | |||
| + | [http://www.eleceng.adelaide.edu.au/Personal/dabbott/publications/FNL_berryman2003.pdf] [[Matthew J. Berryman|M. J. Berryman]], [[Andrew G. Allison|A. Allison]], and '''[[Derek Abbott|D. Abbott]],''' "Statistical techniques for text classification based on word recurrence intervals," | ||
| + | ''Fluctuation and Noise Letters'', '''Vol. 3''', No. 1, pp. L1–L12, 2003. | ||
== References and useful resources== | == References and useful resources== | ||
If you find any useful external links, list them here: | If you find any useful external links, list them here: | ||
| − | * [ | + | * [https://archive.org/details/TheVoynichManuscript Scanned copy of the Voynich] |
| − | * [http:// | + | * [http://www.ic.unicamp.br/~stolfi/voynich/99-01-16-concordance/ Digital download for the Voynich] |
| − | + | ||
| − | + | ||
* [http://ebooks.adelaide.edu.au/ Adelaide Uni Library e-book collection] | * [http://ebooks.adelaide.edu.au/ Adelaide Uni Library e-book collection] | ||
* [http://www.gutenberg.org/wiki/Main_Page Project Gutenburg e-books] | * [http://www.gutenberg.org/wiki/Main_Page Project Gutenburg e-books] | ||
* [http://onlinebooks.library.upenn.edu/archives.html#foreign Foreign language e-books] | * [http://onlinebooks.library.upenn.edu/archives.html#foreign Foreign language e-books] | ||
* [http://www.ohchr.org/EN/UDHR/Pages/Introduction.aspx UN Declaration of Human Rights - different languages] | * [http://www.ohchr.org/EN/UDHR/Pages/Introduction.aspx UN Declaration of Human Rights - different languages] | ||
| − | |||
| − | |||
| − | |||
| − | |||
* [http://portal.acm.org/citation.cfm?id=1389095.1389425 Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems] | * [http://portal.acm.org/citation.cfm?id=1389095.1389425 Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems] | ||
| + | * [http://www.bckelk.ukfsn.org/words/etaoin.html List of letter rankings for different languages] | ||
| + | * [http://www.compellingpress.com/voynich/ The Curse of the Voynich] | ||
| + | * [http://www.plosone.org/article/fetchObject.action?uri=info%3Adoi%2F10.1371%2Fjournal.pone.0067310&representation=PDF Statistical properties of the Voynich] | ||
| + | * [http://www.plosone.org/article/fetchObject.action?uri=info%3Adoi%2F10.1371%2Fjournal.pone.0066344&representation=PDF Information-theoretic analysis of the Voynich] | ||
| + | * [http://www.amazon.com/s/ref=nb_sb_noss?url=search-alias%3Daps&field-keywords=voynich Books on the Voynich (Amazon)] | ||
| + | * [http://www.ic.unicamp.br/~stolfi/voynich/ Voynich resources] | ||
| + | * [http://ixoloxi.com/voynich/tools.html Voynich tools] | ||
| + | * [http://en.wikibooks.org/wiki/The_Voynich_Manuscript/Jargon Guide to Voynich jargon] | ||
==Back== | ==Back== | ||
| Line 101: | Line 113: | ||
*[http://www.eleceng.adelaide.edu.au Back to EEE Department page] | *[http://www.eleceng.adelaide.edu.au Back to EEE Department page] | ||
*[http://www.adelaide.edu.au Back to the University of Adelaide homepage] | *[http://www.adelaide.edu.au Back to the University of Adelaide homepage] | ||
| − | |||
Revision as of 21:58, 5 March 2014
Contents
- 1 Supervisors
- 2 Honours students
- 3 Project guidelines
- 4 General project description
- 5 Useful notes
- 6 Specific tasks
- 7 Deliverables
- 8 Weekly progress and questions
- 9 Approach and methodology
- 10 Expectations
- 11 Relationship to possible career path
- 12 See also
- 13 Useful papers we wrote
- 14 References and useful resources
- 15 Back
Supervisors
Honours students
Project guidelines
General project description
The Voynich Manscript is a mysterious 15th century book that no one today know what it says or who wrote it. The book is in a strange alphabet. See details here.
Fortunately the whole book has been converted into an electronic format with each character changed to a convenient ascii character. We want you to write software that will search the text and perform statistical tests to get clues as to the nature of the writing. Does the document bear the statistics of a natural language or is it a fake?
We already have Support Vector Machine (SVM) and Multiple Discriminant Analysis (MDA) software that you can adapt for your purposes. This software is set up to test if two texts are written by the same author or not. The great thing about our software is that it is independent of language. So you could compare it against the existing writings of Roger Bacon, who is a suspected author
Useful notes
- Download the digital Voynich from here.
- The UN Declaration of Human Rights is translated into every language in the world and in principle you can compare the Voynich to all the existing languages for statistical proximity. Electronic access is here.
Specific tasks
- Phase 1: Characterize the text. Write scripts that count its features. How many words? How long is the alphabet? Word frequencies? Probability of one letter following another. Probability of two letter pairs (2-grams) and n-letter group (n-grams). Compare these in a table with known languages obtained by running your same code on the Declaration of Human Rights. Don't forget to get a short paragraph of English and manually count everything and then run it on your code to cross check it is counting correctly. You must always validate your code or you will lose marks.
- Phase 2: Write a general descriptor for each picture in the book, eg. water, woman, tree, flower, vegetable, leaf, dancing etc. Associate each descriptor with the appropriate paper. Write some code to find which words on a page are unique to those pages with those descriptors. Which words also suddenly increase in frequency on those pages with shared descriptors? Tabulate the results.
- Phase 3: Investigate the use of Word Recurrence Interval (WRI) versus rank plots. Plot WRI curves of the Voynich versus other languages from the Declaration of Human Rights.
- Phase 4: Think up some of your own ideas to try out.
- Phase 5: As WRI is a language-independent metric, you can select classification features based on WRI. Then you can run an SVM and an MDA classifier to compare the Voynich against other languages in the Declaration of Human Rights. Then you can run it against the works of specific authors of interest such as Roger Bacon, John Dee, and Edward Kelley.
Deliverables
Semester A
- Proposal seminar
- Progress report - only one report needed in wiki format
Semester B
- Final seminar
- Final report - only one report needed in wiki format
- Poster - one poster only needed
- Project exhibition 'expo'
- Labelled CD or USB stick containing your whole project directories
- YouTube video - add the URL to this wiki
Weekly progress and questions
This is where you record your progress and ask questions. Make sure you update this every week.
Approach and methodology
We expect you to take a structured approach to both the validation and the writing of the software. You should carefully design the big-picture high-level view of the software modules, and the relationships and interfaces between them. Think also about the data transformations needed.
Expectations
- We don't really expect you to crack the Voynich, though that would be cool if you do and you'll become very famous overnight.
- To get good marks we expect you to show a logical approach to decisively eliminating some languages and authors, and finding some hints about the statistical nature of the words.
- In your conclusion, you need to come up with a short list of possible hypotheses and a list of things you can definitely eliminate.
- We expect you to critically look at the conclusions of the previous work and highlight to what extent your conclusions agree and where you disagree.
- It is important to regularly see your main supervisors. Don't let more than 2 week go by without them seeing your face briefly.
- You should be making at least one formal progress meeting with supervisors per month. It does not strictly have to be exactly a month, but roughly each month you should be in a position to show some progress and have some problems and difficulties to discuss. On the other hand the meetings can be very frequent in periods when you have a lot of activity and progress to show.
- The onus is on you to drive the meetings, make the appointments, and set them up.
Relationship to possible career path
Whilst the project is fascinating as you'll learn about a specific high-profile mystery—and we do want you to have a lot of fun with it—the project does have a hard-core serious engineering side. It will familiarize you with techniques in information theory, probability, statistics, encryption, decryption, signal classification, and datamining. It will also improve your software skills. The new software tools you develop may lead to new IP in the areas of datamining, automatic text language identification, and also make you rich/famous. The types of jobs out there where these skills are useful are in computer security, comms, digital forensics, internet search companies, and language processing software companies. The types of industries that will need you are: the software industry, e-finance industry, e-security, IT industry, Google, telecoms industry, ASIO, ASIS, defence industry (e.g. DSD), etc. So go ahead and have fun with this, but keep your eye on the bigger engineering picture and try to build up an appreciation of why these techniques are useful to our industry. Now go crack the Voynich...this message will self-destruct in five seconds :-)
See also
- Cracking the Voynich code
- Cracking the Voynich code 2014 weekly progress
- Semester A Progress Report 2014 - Cracking the Voynich code
- Semester B Final Report 2014 - Cracking the Voynich code
Useful papers we wrote
[1] M. Ebrahimpour, T. J. Putniņš, M. J. Berryman, A. Allison, B. W.-H.-Ng, and D. Abbott, "Automated authorship attribution using advanced signal classification techniques," PLoS ONE, Vol. 8, No. 2, Art. No. e54998, 2013, http://dx.doi.org/10.1371/journal.pone.0054998
[2] M. J. Berryman, A. Allison, and D. Abbott, "Statistical techniques for text classification based on word recurrence intervals," Fluctuation and Noise Letters, Vol. 3, No. 1, pp. L1–L12, 2003.
References and useful resources
If you find any useful external links, list them here:
- Scanned copy of the Voynich
- Digital download for the Voynich
- Adelaide Uni Library e-book collection
- Project Gutenburg e-books
- Foreign language e-books
- UN Declaration of Human Rights - different languages
- Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems
- List of letter rankings for different languages
- The Curse of the Voynich
- Statistical properties of the Voynich
- Information-theoretic analysis of the Voynich
- Books on the Voynich (Amazon)
- Voynich resources
- Voynich tools
- Guide to Voynich jargon
