"
Team:Sweden
From 2009.igem.org
(Difference between revisions)
| Line 1: | Line 1: | ||
| - | [[Image:Header_change.jpg|center| | + | [[Image:Header_change.jpg|center|970px]] |
{|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" | {|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" | ||
| - | !"align="center"|[[Team:Sweden|Home]] | + | !"align="center"|[[Team:Sweden|<font color="gold">Home</font>]] |
| - | !align="center"|[[Team:Sweden/Team| | + | !align="center"|[[Team:Sweden/Team|<font color="gold">Team</font>]] |
| - | !align="center"|[[Team:Sweden/Project| | + | !align="center"|[[Team:Sweden/Project|<font color="gold">Project</font>]] |
| - | !align="center"|[[Team:Sweden/Mathematical Modelling|Mathematical Modelling]] | + | !align="center"|[[Team:Sweden/Mathematical Modelling|<font color="gold">Mathematical Modelling</font>]] |
| - | !align="center"|[[Team:Sweden/Logbook|Logbook]] | + | !align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]] |
| - | !align="center"|[[Team:Sweden/Result|Result]] | + | !align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]] |
| - | !align="center"|[[Team:Sweden/Parts|Parts]] | + | !align="center"|[[Team:Sweden/Parts|<font color="gold">Parts</font>]] |
| - | !align="center"|[[Team:Sweden/Sponsors|Sponsors]] | + | !align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]] |
|} | |} | ||
| Line 14: | Line 14: | ||
| - | =Team Sweden= | + | =<font color="blue">Team Sweden</font>= |
---- | ---- | ||
{|style= "background:#FFCC33;" align="center" | {|style= "background:#FFCC33;" align="center" | ||
| - | |<b>[[Image:ICanUnderstand.jpg|300px|thumb|left|I Can Understand ! | + | |<b>[[Image:ICanUnderstand.jpg|300px|thumb|left|<font color="blue">I Can Understand!</font>]] |
| - | ::'''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. | ||
| - | ::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.</b> | + | ::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.</font></b> |
|} | |} | ||
<!-- | <!-- | ||
Revision as of 22:01, 7 October 2009
| Home | Team | Project | Mathematical Modelling | Logbook | Result | Parts | Sponsors |
|---|
Team Sweden
 ::The linguistic cell: Sentence parsing bacteria
|
