Revision as of 09:23, 16 October 2009

Home	Team	Project	Mathematical Modelling	Logbook	Result	Suggested Parts	Sponsors

Team Sweden

The linguistic cell: Sentence parsing bacteria

Language is an essential part of our civilization. But making sense out of a series of words can only be achieved by certain rules that underlie the language. This set of rules is called a grammar. A grammar tells us how to order words in a meaningful way. These rules can be implemented as a Finite State Automaton (FSA), which for every new word input moves from the current state to the next until it reaches the end of input. We propose in our project a biological model which is based on this concept of language parsing from computational linguistics.

Our goal is to create an finite state automaton in the cell which parses sentences according to their parts-of-speech. We are currently working on the mathematical modeling of the parsing automation.

@@ Line 21: / Line 21: @@
 !align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]]
 !align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]]
-!align="center"|[[Team:Sweden/Parts|<font color="gold">Parts</font>]]
+!align="center"|[[Team:Sweden/Parts|<font color="gold"> Suggested Parts</font>]]
 !align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]]