4 ms·
Stanford Parser (http://nlp.stanford.edu:8080/parser/index.jsp http://nlp.stanford.edu:8080/parser/index.jsp) actually parses it correctly! (ROOT (S (N
by zodiac 11y ago
Stanford Parser (http://nlp.stanford.edu:8080/parser/index.jsp http://nlp.stanford.edu:8080/parser/index.jsp) actually parses it correctly!
(ROOT
(S
(NP
(NP (PRP$ my) (JJ complete) (NN shock))
(SBAR (IN that)
(S
(NP
(NP (NN anything))
(PP (IN in)
(NP (DT this) (NN article))))
(VP (VBZ is)
(ADJP (JJ unknown)
(PP (TO to)
(NP (DT all))))))))
(VP (VBZ is)
(ADVP (RB inversely))
(VP (VBG proportional)
(PP (TO to)
(NP (PRP$ my) (NN programming) (NNS abilities)))))
(. .)))
I agree that it's quite convoluted, but surprisingly it's not incorrect
- SilasX 11y agoFunny how they can write a parser that converts natural language strings into a syntax tree, but they can't configure an nginx proxy on port 80 :-p