Stanford Parser

Please enter a sentence to be parsed:
Language:
Sample Sentence

Your query

What would be the best regular expression for tokenizing an

Tagging

What/WP
would/MD
be/VB
the/DT
best/JJS
regular/JJ
expression/NN
for/IN
tokenizing/NN
an/DT

Parse

(ROOT
  (SBARQ
    (WHNP (WP What))
    (SQ (MD would)
      (VP (VB be)
        (NP
          (NP (DT the) (JJS best) (JJ regular) (NN expression))
          (PP (IN for)
            (NP (NN tokenizing) (DT an))))))))

Universal dependencies

nsubj(expression-7, What-1)
aux(expression-7, would-2)
cop(expression-7, be-3)
det(expression-7, the-4)
amod(expression-7, best-5)
amod(expression-7, regular-6)
root(ROOT-0, expression-7)
case(tokenizing-9, for-8)
nmod(expression-7, tokenizing-9)
dep(tokenizing-9, an-10)

Universal dependencies, enhanced

nsubj(expression-7, What-1)
aux(expression-7, would-2)
cop(expression-7, be-3)
det(expression-7, the-4)
amod(expression-7, best-5)
amod(expression-7, regular-6)
root(ROOT-0, expression-7)
case(tokenizing-9, for-8)
nmod:for(expression-7, tokenizing-9)
dep(tokenizing-9, an-10)

Statistics


Tokens: 10
Time: 0.056 s
Parser: englishPCFG.ser.gz

Back to parser home
Last updated 2022-11-24

Valid XHTML 1.0 Strict