Team:Sweden

From 2009.igem.org

(Difference between revisions)
(→Team Sweden)
(→Team Sweden)
Line 39: Line 39:
::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.</font>
+
::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>.
-
|[[Image:Igem_modified.jpg|500px|center|]]
 
Line 55: Line 54:
 +
|}
 +
|bgcolor:"gold"|
 +
|[[Image:Igem_modified.jpg|150px|center|]]
-
|}
 
-
 
-
|[[Image:‎|300px|center]]
 
<!--
<!--

Revision as of 13:28, 19 October 2009



Header change.jpg
Home Team Project Mathematical Modelling Logbook Result Sponsors

Team Sweden

Teaching ecoli.jpg

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








|bgcolor:"gold"|

|
Igem modified.jpg


Retrieved from "http://2009.igem.org/Team:Sweden"