Difference between revisions of "A.I. Natural Language Processing 1.1"
From Hackerspace.gr
(Added presentation link to mediawiki uploaded file) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 16: | Line 16: | ||
*Presentation by Timos | *Presentation by Timos | ||
**Automata | **Automata | ||
| − | *** | + | ***Deterministic Finite Automata(DFA) -> Used to recognise "Regular Grammars" |
| − | *** | + | ***Push Down Automata(PDA) -> Used to recognise "Context-free Grammars" |
| − | *** | + | ***Linear Bounded Automata(LBA) -> Used to recognise "Context-sensitive Grammars" |
| − | *** | + | ***Turing Machine(TM) -> Used to recognise "Recursively Enumerable" |
| + | *http://2.bp.blogspot.com/-5O4JvmXUc7g/UFmvpjND-gI/AAAAAAAAADY/GK5FdRbO6VY/s1600/image006.gif | ||
**Rules & Symbols | **Rules & Symbols | ||
***Terminals | ***Terminals | ||
Latest revision as of 13:27, 20 June 2013
 |
Starts | Organizer |
|---|---|---|
| Fri 14 Jun 2013 19:00 | Everyone interested | |
| Ends | Event Owner | |
| Fri 14 Jun 2013 21:00 | User:Ododos |
Let the skynet begin
- Presentation by Timos
- Automata
- Deterministic Finite Automata(DFA) -> Used to recognise "Regular Grammars"
- Push Down Automata(PDA) -> Used to recognise "Context-free Grammars"
- Linear Bounded Automata(LBA) -> Used to recognise "Context-sensitive Grammars"
- Turing Machine(TM) -> Used to recognise "Recursively Enumerable"
- Automata
- Rules & Symbols
- Terminals
- Non-Terminals
- Parsers
- Rules & Symbols
- Presentation by Panagiotis
- Syntactic Parsers
- POS-Taggers
- Named-Entity Recognizers
- Lexical Resources
- Language Modeling
- Sentiment Analysis
- Natural Language Generation
- General NLP Libraries
