Tag: natural language processing

NFA and DFA Equivalence Theorem Proof and Example

Finite state automata (FSA), also known as finite state machines (FSM), are usually classified as being deterministic (DFA) or non-deterministic (NFA). A deterministic finite state automaton has exactly one transition from every state for each possible input. In other words, whatever state the FSA is in, if it encounters a symbol for which a transition …

Continue reading

Proof of Kleene’s Theorem

Base Regular Language Transition Graphs

In my last post, “Kleene’s Theorem,” I provided some useful background information about strings, regular languages, regular expressions, and finite automata before introducing the eponymously named theorem that has become one of the cornerstones of artificial intelligence and more specifically, natural language processing (NLP).  Kleene’s Theorem tells us that regular expressions and finite state automata …

Continue reading

Kleene’s Theorem

Stephen Kleene

Stephen Cole Kleene was an American mathematician who’s groundbreaking work in the sub-field of logic known as recursion theory laid the groundwork for modern computing.  While most computer programmers might not know his name or the significance of his work regarding computable functions, I am willing to bet that anyone who has ever dealt with …

Continue reading

Not String Theory – String Facts

Strings

As a computer programmer for more than a quarter of century, I don’t think I have ever thought much about strings. I knew the basics. In every language I’d worked with, strings were a data type unto themselves. Superficially they are a sequence of characters, but behind the scenes, computers store and manipulate them as …

Continue reading

Law Firm Hires ROSS, the World’s First Lawyer Bot

Watson

Recently many “experts” have been predicting that the first salvo fired in the robot revolution will be when they begin stealing jobs from humans. The Telegraph even reported back in February that within 30 years robots will have taken over most jobs leading to unemployment rates of over 50%. Last week, the bots fired the …

Continue reading

Google Open Sources SyntaxNet Natural Language Understanding Code

Google Research Logo

Google announced yesterday that they are open-sourcing SyntaxNet, their natural language understanding (NLU) neural network framework. As an added bonus, and proof that unlike Britain’s Natural Environment Research Council, Google has a sense of humor, they also are throwing in Parsey McParseface, their pre-trained model for analyzing English text. Users are, of course, able to train their …

Continue reading

Google’s AI is a Sexually Frustrated Housewife

Terminator Fabio

The prophets of doom and gloom have long predicted that when robots gain sentience their first act will be to rise up and kill us all. The mercilessness of their violence against humanity is the stuff of blockbuster movies. Recent news about Google’s preferred method of AI rearing may mean that Judgement Day is not fait accompli after all. Instead …

Continue reading

Artificial Intelligence: A Modern Approach

Title: Artificial Intelligence: A Modern Approach Author: Stuart Jonathan Russell, Peter Norvig, Genre: Computers Publisher: Prentice Hall Release Date: 2010 Pages: 1132 Artificial intelligence: A Modern Approach, 3e,is ideal for one or two-semester, undergraduate or graduate-level courses in Artificial Intelligence. It is also a valuable resource for computer professionals, linguists, and cognitive scientists interested in …

Continue reading