From 2009.igem.org
(Difference between revisions)
|
|
Line 8: |
Line 8: |
| #TEXT<> | | #TEXT<> |
| P {color: #000033;} | | P {color: #000033;} |
- | body {background-color: #0000A0;} | + | body {background-color: #0000FF;} |
| | | |
| </style> | | </style> |
Revision as of 21:38, 7 October 2009
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.
|