"
Team:Sweden
From 2009.igem.org
(Difference between revisions)
(→Our project) |
|||
| Line 1: | Line 1: | ||
| - | [[Image: | + | [[Image:Header_change.jpg|center|950px]] |
{|style="color:#0000a0;background-color:#000000;" cellpadding="6" cellspacing="1" border="2" bordercolor="#fff" width="100%" align="center" | {|style="color:#0000a0;background-color:#000000;" cellpadding="6" cellspacing="1" border="2" bordercolor="#fff" width="100%" align="center" | ||
!align="center"|[[Team:Sweden|Home]] | !align="center"|[[Team:Sweden|Home]] | ||
Revision as of 22:06, 6 October 2009
| Home | Our Team | Our Project | Mathematical Modelling | Logbook | Result | Parts | Sponsors |
|---|
Team Sweden
- 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.
