Team:Sweden
From 2009.igem.org
(Difference between revisions)
Line 1: | Line 1: | ||
+ | <html> | ||
+ | <head> | ||
+ | <style> | ||
+ | |||
+ | #bodyContent {background-color: #0000FF;} | ||
+ | #content {background-color: #0000FF;} | ||
+ | #footer-box {background-color: #0000FF;} | ||
+ | P {color: #000033;} | ||
+ | body {background-color: #0000FF;} | ||
+ | |||
+ | </style> | ||
+ | </head> | ||
+ | </html> | ||
+ | |||
[[Image:Header_change.jpg|center|950px]] | [[Image:Header_change.jpg|center|950px]] | ||
- | {|style=" | + | {|style="background-color:#0000A0;" cellpadding="6" cellspacing="1" border="2" width="100%" align="center" |
- | !align="center"|[[Team:Sweden|Home]] | + | !"align="center"|[[Team:Sweden|Home]] |
!align="center"|[[Team:Sweden/Team|Our Team]] | !align="center"|[[Team:Sweden/Team|Our Team]] | ||
!align="center"|[[Team:Sweden/Project|Our Project]] | !align="center"|[[Team:Sweden/Project|Our Project]] | ||
Line 17: | Line 31: | ||
---- | ---- | ||
- | [[Image:ICanUnderstand.jpg|300px|thumb|left|I Can Understand ! .]] | + | {|style= "background:#FFCC33;" align="center" |
+ | |<b>[[Image:ICanUnderstand.jpg|300px|thumb|left|I Can Understand ! .]] | ||
::'''The linguistic cell: Sentence parsing bacteria''' | ::'''The linguistic cell: Sentence parsing bacteria''' | ||
- | ::Language is an essential part of our civilization. But making sense out | + | ::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. |
- | 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.</b> | ||
+ | |} | ||
<!-- | <!-- | ||
<html> | <html> |
Revision as of 20:53, 7 October 2009
Home | Our Team | Our Project | Mathematical Modelling | Logbook | Result | Parts | Sponsors |
---|
Team Sweden
|