Team:Sweden/Project

From 2009.igem.org

(Difference between revisions)
(Project)
Line 23: Line 23:
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 :
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
+
: S     NP VP
-
: NP à (det adj) N
+
: NP (det adj) N
-
: VP à V (NP)
+
: 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.  
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.  

Revision as of 21:20, 5 October 2009

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


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