Difference between revisions of "A.I. Natural Language Processing 1.1"

From Hackerspace.gr
Jump to: navigation, search
(Created page with "{{Event |logo=Natural language processing.jpg |what=A.I. Natural Language Processing |tagline=Let the skynet begin |eventowner=User:Skmp |who=Everyone interested |from=2013/06/01...")
 
 
(8 intermediate revisions by 4 users not shown)
Line 1: Line 1:
 
{{Event
 
{{Event
 
|logo=Natural language processing.jpg
 
|logo=Natural language processing.jpg
−
|what=A.I. Natural Language Processing
+
|what=A.I. Natural Language Processing 1.1
 
|tagline=Let the skynet begin
 
|tagline=Let the skynet begin
−
|eventowner=User:Skmp
+
|eventowner=User:Ododos
 
|who=Everyone interested
 
|who=Everyone interested
−
|from=2013/06/01 15:00:00
+
|from=2013/06/14 19:00:00
−
|till=2013/06/01 16:00:00
+
|till=2013/06/14 21:00:00
 
|where=Hackerspace.gr (πίσω χώρος)
 
|where=Hackerspace.gr (πίσω χώρος)
 
|city=Athens
 
|city=Athens
Line 12: Line 12:
 
|country=Greece
 
|country=Greece
 
}}
 
}}
 +
 +
 +
*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"
 +
*http://2.bp.blogspot.com/-5O4JvmXUc7g/UFmvpjND-gI/AAAAAAAAADY/GK5FdRbO6VY/s1600/image006.gif
 +
**Rules & Symbols
 +
***Terminals
 +
***Non-Terminals
 +
**Parsers
 +
*[[Media:NLP_Tools.pdf | Presentation]] by Panagiotis
 +
**Syntactic Parsers
 +
**POS-Taggers
 +
**Named-Entity Recognizers
 +
**Lexical Resources
 +
**Language Modeling
 +
**Sentiment Analysis
 +
**Natural Language Generation
 +
**General NLP Libraries

Latest revision as of 13:27, 20 June 2013

Natural language processing.jpg
 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"
  • image006.gif
    • Rules & Symbols
      • Terminals
      • Non-Terminals
    • Parsers
  • Presentation by Panagiotis
    • Syntactic Parsers
    • POS-Taggers
    • Named-Entity Recognizers
    • Lexical Resources
    • Language Modeling
    • Sentiment Analysis
    • Natural Language Generation
    • General NLP Libraries
Retrieved from "https://www.hackerspace.gr/wiki/index.php?title=A.I._Natural_Language_Processing_1.1&oldid=35072"