Team:Sweden
From 2009.igem.org
(Difference between revisions)
(→Team Sweden) |
|||
Line 33: | Line 33: | ||
{|style= "background:gold;" align="justify" | {|style= "background:gold;" align="justify" | ||
- | |[[Image: | + | |[[Image:Teaching_ecoli.jpg|500px|left|]]<br><br><br><br><br><br><br><br><br><br><br><br> |
<font color="blue">'''The linguistic cell: Sentence parsing bacteria''' | <font color="blue">'''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. | ::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. |
Revision as of 08:15, 19 October 2009
Home | Team | Project | Mathematical Modelling | Logbook | Result | Sponsors |
---|
Team Sweden
The linguistic cell: Sentence parsing bacteria
|
|[[Image:|150px|center]]