# Team:Sweden

(Difference between revisions)
 Revision as of 21:08, 28 April 2009 (view source)Fahimr (Talk | contribs)← Older edit Latest revision as of 23:15, 20 October 2009 (view source)Fahimr (Talk | contribs) (→The linguistic cell: Sentence parsing E.Coli) (103 intermediate revisions not shown) Line 1: Line 1: - - -
+ -
+ + + [[Image:JUST.jpg|center|970px]] + {|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" + !"align="center"|[[Team:Sweden|Home]] + !align="center"|[[Team:Sweden/Team|Team]] + !align="center"|[[Team:Sweden/Project|Project]] + !align="center"|[[Team:Sweden/Mathematical Modelling|Mathematical Modelling]] + !align="center"|[[Team:Sweden/Logbook|Logbook]] + !align="center"|[[Team:Sweden/Result|Result]] + !align="center"|[[Team:Sweden/Sponsors|Sponsors]] + + |} + ='''Team:''Sweden'''''= + [[Image:Title.gif|center|970px]] +
+ + + + {|style=  "background:gold;" + |[[Image:Teaching_ecoli.jpg|500px|center|]] + + =='''The linguistic cell: Sentence parsing Escherichia Coli'''== + + 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.

# Team:Sweden

## The linguistic cell: Sentence parsing Escherichia Coli

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.
.

## Our Journey

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"!!!

|bgcolor:"gold"|

|