"
Team:Sweden
From 2009.igem.org
(→The linguistic cell: Sentence parsing bacteria) |
(→Our Project Abstracts) |
||
| Line 43: | Line 43: | ||
==<font color="blue">'''Our Project Abstracts'''== | ==<font color="blue">'''Our Project Abstracts'''== | ||
| - | 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 con- cept of language parsing from computational linguistics. | + | <font color="blue">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 con- cept of language parsing from computational linguistics. |
</font> | </font> | ||
Revision as of 17:20, 20 October 2009
| Home | Team | Project | Mathematical Modelling | Logbook | Result | Sponsors |
|---|
Team Sweden
 The linguistic cell: Sentence parsing bacteriaLanguage 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. Our Project AbstractsLanguage 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 con- cept of language parsing from computational linguistics.
|
|bgcolor:"gold"|
|
