"
Team:Sweden
From 2009.igem.org
(→The linguistic cell: Sentence parsing E.Coli) |
|||
| (34 intermediate revisions not shown) | |||
| Line 5: | Line 5: | ||
background: #0000A0 url(https://static.igem.org/mediawiki/igem.org/4/48/Test_image.gif) repeat fixed; | background: #0000A0 url(https://static.igem.org/mediawiki/igem.org/4/48/Test_image.gif) repeat fixed; | ||
} | } | ||
| + | #bodyContent {background-color:gold;} | ||
| + | #content {background-color:gold;} | ||
| + | #footer-box {background-color: #CCCCCC;} | ||
| + | P {color: #FFCC33;} | ||
</style> | </style> | ||
</head> | </head> | ||
</html> | </html> | ||
| - | + | [[Image:JUST.jpg|center|970px]] | |
| - | + | ||
| - | + | ||
| - | + | ||
| - | [[Image: | + | |
{|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|<font color="gold">Home</font>]] | !"align="center"|[[Team:Sweden|<font color="gold">Home</font>]] | ||
| Line 21: | Line 21: | ||
!align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]] | !align="center"|[[Team:Sweden/Logbook|<font color="gold">Logbook</font>]] | ||
!align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]] | !align="center"|[[Team:Sweden/Result|<font color="gold">Result</font>]] | ||
| - | |||
!align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]] | !align="center"|[[Team:Sweden/Sponsors|<font color="gold">Sponsors</font>]] | ||
|} | |} | ||
| + | =<font color="blue">'''Team:''Sweden'''''</font>= | ||
| + | [[Image:Title.gif|center|970px]] | ||
<div style="text-align:justify"> | <div style="text-align:justify"> | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | ::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></ | + | |
| + | {|style= "background:gold;" | ||
| + | |[[Image:Teaching_ecoli.jpg|500px|center|]] | ||
| + | |||
| + | ==<font color="blue">'''The linguistic cell: Sentence parsing Escherichia Coli'''== | ||
| + | |||
| + | <font color="blue">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. | ||
| + | |||
| + | <font color="blue">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><br>. | ||
| + | |||
| + | ==<font color="blue">'''Our Journey'''== | ||
| + | |||
| + | <font color="blue">We are a group of student from varied backgrounds, who joined togather in a team to pursue the iGEM competetion. We thought a lot(a looooot) about our team name..Actually we had a big meeting on deciding on the team name. Even though none of us are Swedish, we felt, as we all are studying in Sweden and we love the place so much, our common ground is '''"Sweden"'''. Thus here we are the team '''"SWEDEN"!!!''' | ||
| + | </font> | ||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
|} | |} | ||
| + | |||
| + | |bgcolor:"gold"| | ||
| + | |[[Image:Igem_modified.gif|150px|center|]] | ||
| + | |||
| + | |||
<!-- | <!-- | ||
<html> | <html> | ||
Latest revision as of 23:15, 20 October 2009
| Home | Team | Project | Mathematical Modelling | Logbook | Result | Sponsors |
|---|
Team:Sweden
 The linguistic cell: Sentence parsing Escherichia ColiLanguage 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. Our JourneyWe are a group of student from varied backgrounds, who joined togather in a team to pursue the iGEM competetion. We thought a lot(a looooot) about our team name..Actually we had a big meeting on deciding on the team name. Even though none of us are Swedish, we felt, as we all are studying in Sweden and we love the place so much, our common ground is "Sweden". Thus here we are the team "SWEDEN"!!!
|
|bgcolor:"gold"|
|
