Team:Sweden/Project

From 2009.igem.org

(Difference between revisions)
(Project)
Line 17: Line 17:
{|align="justify"
{|align="justify"
-
|You can write a background of your team hereGive us a background of your team, the members, etc. Or tell us more about something of your choosing.
+
|
-
|[[Image:Example_logo.png|200px|right]]
+
We want to implement this automaton in the cell. It is based on a few simple rules on how to parse a simple sentence like The little girl plays ball or Boys stroke the little dog. These simple rules are :
 +
S    à NP VP
 +
NP à (det adj) N
 +
VP à V (NP)
 +
We target only the parts of speech (POS) tags because this way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton.
 +
A finite state automaton is a 5-tupel A = (Q, Σ, δ, s0, F), where Q is a finite set of states, Σ is the finite set of input symbols (alphabet), δ is the transition function, δ: Q × Σ -> Q, s0 is the start state and F is the set of final/accepting states with .   
 +
The sentence is a string of different reagents which will be introduced to the cell one by one. As soon as a wrong input is detected the cell will light up red.  A sentence is finished by a stop reagent and then the cell will light up green.
 +
 
 +
|[[Image:teamsweden_state.png|200px|right]]
|-
|-
|
|
Line 39: Line 47:
|}
|}
(''Or you can choose different headings.  But you must have a team page, a project page, and a notebook page.'')
(''Or you can choose different headings.  But you must have a team page, a project page, and a notebook page.'')
-
 
-
 
== '''Overall project''' ==
== '''Overall project''' ==

Revision as of 17:11, 28 September 2009

New Header copy.jpg
Home Our Team Our Project Mathematical Modelling Logbook Result Parts Sponsors


Contents

Project

We want to implement this automaton in the cell. It is based on a few simple rules on how to parse a simple sentence like The little girl plays ball or Boys stroke the little dog. These simple rules are : S à NP VP NP à (det adj) N VP à V (NP) We target only the parts of speech (POS) tags because this way the grammar can be implemented as a finite state automaton (FSA) and not as a push-down automaton. A finite state automaton is a 5-tupel A = (Q, Σ, δ, s0, F), where Q is a finite set of states, Σ is the finite set of input symbols (alphabet), δ is the transition function, δ: Q × Σ -> Q, s0 is the start state and F is the set of final/accepting states with .  The sentence is a string of different reagents which will be introduced to the cell one by one. As soon as a wrong input is detected the cell will light up red. A sentence is finished by a stop reagent and then the cell will light up green.

Teamsweden state.png

Tell us more about your project. Give us background. Use this is the abstract of your project. Be descriptive but concise (1-2 paragraphs)

Team.png
Team Example 2


Home The Team The Project Parts Submitted to the Registry Modeling Notebook

(Or you can choose different headings. But you must have a team page, a project page, and a notebook page.)

Overall project

Your abstract




Project Details

Part 2

The Experiments

Part 3

Results