Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    text
    copied!<p>You can read about regexes in <em><a href="http://books.google.com/books?id=dlzthEZGkmsC&amp;pg=PA477#v=onepage&amp;q&amp;f=false" rel="nofollow noreferrer">An Introduction to Language And Linguistics By Ralph W. Fasold, Jeff Connor-Linton P.477</a></em></p> <p><strong>Chomsky Hierarchy</strong>:</p> <p>Type0 >= Type1 >= Type2 >= Type3</p> <p>Computational Linguistics mainly features Type 2 &amp; 3 Grammars</p> <p>• <em>Type 3 grammars</em>:</p> <p>–Include <strong>regular expressions</strong> and finite state automata (aka, finite state machines)</p> <p>–The focal point of the rest of this talk</p> <p>• <em>Type 2 grammars</em>:</p> <p>–Commonly used for natural language parsers</p> <p>–Used to model syntactic structure in many linguistic theories (often supplemented by other mechanisms)</p> <p>–We will play a key roll in the next talk on parsing.</p> <hr> <p>most XMLs like <a href="http://en.wikipedia.org/wiki/DGML" rel="nofollow noreferrer">Microsoft DGML</a> (Directed Graph Markup Language) that has inter-relational links are samples that Regex are useless.</p> <hr> <p>and this three answers may be useful:</p> <p>1 - <a href="https://stackoverflow.com/questions/2974210/does-lookaround-affect-which-languages-can-be-matched-by-regular-expressions/2991587#2991587">does-lookaround-affect-which-languages-can-be-matched-by-regular-expressions</a></p> <p>2 - <a href="https://cstheory.stackexchange.com/questions/448/regular-expressions-arent">regular-expressions-arent</a></p> <p>3 - <a href="https://cstheory.stackexchange.com/questions/1047/where-do-most-regex-implementations-fall-on-the-complexity-scale">where-do-most-regex-implementations-fall-on-the-complexity-scale</a></p>
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload