Building a phrase structure of “On the weekend …”












4














I'm reading Foundations of Statistical Natural Language Processing, and I'm doing one of the early exercises, trying to work out some of the language infliction about the word 'fun'.





  1. On the weekend the children had fun.




Trying to make a phrase structure parse of the above sentece, I'm not sure how to structure it. All formal grammars I've read describe a sentence as:



S → NP + VP


But I don't see how "on the weekend" could be a noun phrase? So far I've got this, but it doesn't seem right:



(PP On)(NP (D the)(N weekend))(S (NP (D the)(N children))(VP (V had)(NP (N fun))))


Resulting in this parse tree:



parse tree



So my question is: What's the correct Part-of-speech tagging for (1)?










share|improve this question
























  • I don’t understand what you think is amiss with the current POS assignments. Why would “the weekend” be anything but an NP? Is the problem that you don’t know to which element the whole PP attaches/applies/modifies? It’s a “when” phrase, which usually attaches to a VP.
    – tchrist
    Dec 11 '12 at 12:26










  • Well the weekend is obviously an NP, but I was missing the fact that the on/IN would give me a prepositional phrase PP.
    – Saebekassebil
    Dec 11 '12 at 15:21
















4














I'm reading Foundations of Statistical Natural Language Processing, and I'm doing one of the early exercises, trying to work out some of the language infliction about the word 'fun'.





  1. On the weekend the children had fun.




Trying to make a phrase structure parse of the above sentece, I'm not sure how to structure it. All formal grammars I've read describe a sentence as:



S → NP + VP


But I don't see how "on the weekend" could be a noun phrase? So far I've got this, but it doesn't seem right:



(PP On)(NP (D the)(N weekend))(S (NP (D the)(N children))(VP (V had)(NP (N fun))))


Resulting in this parse tree:



parse tree



So my question is: What's the correct Part-of-speech tagging for (1)?










share|improve this question
























  • I don’t understand what you think is amiss with the current POS assignments. Why would “the weekend” be anything but an NP? Is the problem that you don’t know to which element the whole PP attaches/applies/modifies? It’s a “when” phrase, which usually attaches to a VP.
    – tchrist
    Dec 11 '12 at 12:26










  • Well the weekend is obviously an NP, but I was missing the fact that the on/IN would give me a prepositional phrase PP.
    – Saebekassebil
    Dec 11 '12 at 15:21














4












4








4


1





I'm reading Foundations of Statistical Natural Language Processing, and I'm doing one of the early exercises, trying to work out some of the language infliction about the word 'fun'.





  1. On the weekend the children had fun.




Trying to make a phrase structure parse of the above sentece, I'm not sure how to structure it. All formal grammars I've read describe a sentence as:



S → NP + VP


But I don't see how "on the weekend" could be a noun phrase? So far I've got this, but it doesn't seem right:



(PP On)(NP (D the)(N weekend))(S (NP (D the)(N children))(VP (V had)(NP (N fun))))


Resulting in this parse tree:



parse tree



So my question is: What's the correct Part-of-speech tagging for (1)?










share|improve this question















I'm reading Foundations of Statistical Natural Language Processing, and I'm doing one of the early exercises, trying to work out some of the language infliction about the word 'fun'.





  1. On the weekend the children had fun.




Trying to make a phrase structure parse of the above sentece, I'm not sure how to structure it. All formal grammars I've read describe a sentence as:



S → NP + VP


But I don't see how "on the weekend" could be a noun phrase? So far I've got this, but it doesn't seem right:



(PP On)(NP (D the)(N weekend))(S (NP (D the)(N children))(VP (V had)(NP (N fun))))


Resulting in this parse tree:



parse tree



So my question is: What's the correct Part-of-speech tagging for (1)?







parts-of-speech structure






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 2 days ago









Glorfindel

6,01483338




6,01483338










asked Dec 11 '12 at 12:14









Saebekassebil

1234




1234












  • I don’t understand what you think is amiss with the current POS assignments. Why would “the weekend” be anything but an NP? Is the problem that you don’t know to which element the whole PP attaches/applies/modifies? It’s a “when” phrase, which usually attaches to a VP.
    – tchrist
    Dec 11 '12 at 12:26










  • Well the weekend is obviously an NP, but I was missing the fact that the on/IN would give me a prepositional phrase PP.
    – Saebekassebil
    Dec 11 '12 at 15:21


















  • I don’t understand what you think is amiss with the current POS assignments. Why would “the weekend” be anything but an NP? Is the problem that you don’t know to which element the whole PP attaches/applies/modifies? It’s a “when” phrase, which usually attaches to a VP.
    – tchrist
    Dec 11 '12 at 12:26










  • Well the weekend is obviously an NP, but I was missing the fact that the on/IN would give me a prepositional phrase PP.
    – Saebekassebil
    Dec 11 '12 at 15:21
















I don’t understand what you think is amiss with the current POS assignments. Why would “the weekend” be anything but an NP? Is the problem that you don’t know to which element the whole PP attaches/applies/modifies? It’s a “when” phrase, which usually attaches to a VP.
– tchrist
Dec 11 '12 at 12:26




I don’t understand what you think is amiss with the current POS assignments. Why would “the weekend” be anything but an NP? Is the problem that you don’t know to which element the whole PP attaches/applies/modifies? It’s a “when” phrase, which usually attaches to a VP.
– tchrist
Dec 11 '12 at 12:26












Well the weekend is obviously an NP, but I was missing the fact that the on/IN would give me a prepositional phrase PP.
– Saebekassebil
Dec 11 '12 at 15:21




Well the weekend is obviously an NP, but I was missing the fact that the on/IN would give me a prepositional phrase PP.
– Saebekassebil
Dec 11 '12 at 15:21










1 Answer
1






active

oldest

votes


















4














EDIT: Given the sentence:




On the weekend the children had fun.




You can get a dependency parse (described at the bottom of this posting) that looks like this:



dependency graph



Which I believe may be more of what you are looking for.





The Berkeley parser produces this parse using its simple online interface:



(ROOT
(S
(PP (IN On)
(NP (DT the) (NN weekend)))
(NP (DT the) (NNS children))
(VP (VBD had)
(NP (NN fun)))
(. .)))


Which can be diagrammed this way:



sentence 1 parse tree



On the other hand, if you rearrange the sentence slightly:




The children had fun on the weekend.




You get this tree:



(ROOT
(S
(NP (DT The) (NNS children))
(VP (VBD had)
(NP
(NP (NN fun))
(PP (IN on)
(NP (DT the) (NN weekend)))))
(. .)))


Whose diagram is this:



parse tree for sentence 2



For a simple parse, I think that is as good as you are going to get it. But you wish to try a constituency parser that can show linkages more complex that the simple tree above illustrates. For example, using CMU’s Link Grammar Parser:



    +------------------------Xp-----------------------+
+---------------Wd--------------+ |
| +-----------CO-----------+ |
| +----Js---+ | |
| | +--Ds--+ +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | |
LEFT-WALL on the weekend.n the children.n had.v fun.n .


Notice the CO link applies that opener to the entire rest of the sentence. If you follow the [CO link]’s docs(http://www.link.cs.cmu.edu/link/dict/section-CO.html), you find that this is “sentence opener” link, used to connect sentence openers to the subjects of sentences. It mentions, amongst other things:




Openers may take commas; almost all words with CO+ therefore
have "({{Xd-} & Xc+} & CO+)". With participles and adjectives,
the comma is obligatory; "*Still upset about Joe they went to
a movie" seems wrong. The Xd- allows a comma before the phrase
as well as after. This frequently happens if the opener is not
at the beginning of the phrase: "They claimed that, on
Tuesday, they went to a movie." If the opener begins the
sentence, then a comma before the opener is of course
incorrect, but we allow it. See "X: Comma phrases".




And indeed, if you add the comma, you get another element in the parse (the Xc element), but nothing else changes, showing that these are equivalent:



    +-------------------------Xp------------------------+
+----------------Wd---------------+ |
| +------------CO------------+ |
| +-------Xc------+ | |
| +----Js---+ | | |
| | +--Ds--+ | +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | | |
LEFT-WALL on the weekend.n , the children.n had.v fun.n .


For more details, check out the Standford NLP Group’s page here. I have used some of those tools, and they take a fair bit of set-up that I would never wish on a non-programmer, but they can be quite interesting.



You may wish to also try a dependency parse. These can be harder to read, but provide better linkages. One dependency parse visualization tool can be downloaded from here.



If you jump through all their hoops, you get the following output:



dependency graph



Notice that at last we can see that the PP at the start of the sentence correctly applies to the VP.






share|improve this answer























  • Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
    – Saebekassebil
    Dec 11 '12 at 15:20










  • BTW: Why is Berkeleys parser making those (...) markings?
    – Saebekassebil
    Dec 11 '12 at 15:22










  • @Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
    – tchrist
    Dec 11 '12 at 15:25










  • Haven't got up to transformations, yet, eh? See here for an abbreviated list.
    – John Lawler
    Dec 11 '12 at 16:26






  • 1




    The DependenSee link gives a 500 at the moment but the source for it is here.
    – Jason C
    Dec 20 '15 at 3:29











Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "97"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fenglish.stackexchange.com%2fquestions%2f93989%2fbuilding-a-phrase-structure-of-on-the-weekend%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









4














EDIT: Given the sentence:




On the weekend the children had fun.




You can get a dependency parse (described at the bottom of this posting) that looks like this:



dependency graph



Which I believe may be more of what you are looking for.





The Berkeley parser produces this parse using its simple online interface:



(ROOT
(S
(PP (IN On)
(NP (DT the) (NN weekend)))
(NP (DT the) (NNS children))
(VP (VBD had)
(NP (NN fun)))
(. .)))


Which can be diagrammed this way:



sentence 1 parse tree



On the other hand, if you rearrange the sentence slightly:




The children had fun on the weekend.




You get this tree:



(ROOT
(S
(NP (DT The) (NNS children))
(VP (VBD had)
(NP
(NP (NN fun))
(PP (IN on)
(NP (DT the) (NN weekend)))))
(. .)))


Whose diagram is this:



parse tree for sentence 2



For a simple parse, I think that is as good as you are going to get it. But you wish to try a constituency parser that can show linkages more complex that the simple tree above illustrates. For example, using CMU’s Link Grammar Parser:



    +------------------------Xp-----------------------+
+---------------Wd--------------+ |
| +-----------CO-----------+ |
| +----Js---+ | |
| | +--Ds--+ +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | |
LEFT-WALL on the weekend.n the children.n had.v fun.n .


Notice the CO link applies that opener to the entire rest of the sentence. If you follow the [CO link]’s docs(http://www.link.cs.cmu.edu/link/dict/section-CO.html), you find that this is “sentence opener” link, used to connect sentence openers to the subjects of sentences. It mentions, amongst other things:




Openers may take commas; almost all words with CO+ therefore
have "({{Xd-} & Xc+} & CO+)". With participles and adjectives,
the comma is obligatory; "*Still upset about Joe they went to
a movie" seems wrong. The Xd- allows a comma before the phrase
as well as after. This frequently happens if the opener is not
at the beginning of the phrase: "They claimed that, on
Tuesday, they went to a movie." If the opener begins the
sentence, then a comma before the opener is of course
incorrect, but we allow it. See "X: Comma phrases".




And indeed, if you add the comma, you get another element in the parse (the Xc element), but nothing else changes, showing that these are equivalent:



    +-------------------------Xp------------------------+
+----------------Wd---------------+ |
| +------------CO------------+ |
| +-------Xc------+ | |
| +----Js---+ | | |
| | +--Ds--+ | +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | | |
LEFT-WALL on the weekend.n , the children.n had.v fun.n .


For more details, check out the Standford NLP Group’s page here. I have used some of those tools, and they take a fair bit of set-up that I would never wish on a non-programmer, but they can be quite interesting.



You may wish to also try a dependency parse. These can be harder to read, but provide better linkages. One dependency parse visualization tool can be downloaded from here.



If you jump through all their hoops, you get the following output:



dependency graph



Notice that at last we can see that the PP at the start of the sentence correctly applies to the VP.






share|improve this answer























  • Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
    – Saebekassebil
    Dec 11 '12 at 15:20










  • BTW: Why is Berkeleys parser making those (...) markings?
    – Saebekassebil
    Dec 11 '12 at 15:22










  • @Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
    – tchrist
    Dec 11 '12 at 15:25










  • Haven't got up to transformations, yet, eh? See here for an abbreviated list.
    – John Lawler
    Dec 11 '12 at 16:26






  • 1




    The DependenSee link gives a 500 at the moment but the source for it is here.
    – Jason C
    Dec 20 '15 at 3:29
















4














EDIT: Given the sentence:




On the weekend the children had fun.




You can get a dependency parse (described at the bottom of this posting) that looks like this:



dependency graph



Which I believe may be more of what you are looking for.





The Berkeley parser produces this parse using its simple online interface:



(ROOT
(S
(PP (IN On)
(NP (DT the) (NN weekend)))
(NP (DT the) (NNS children))
(VP (VBD had)
(NP (NN fun)))
(. .)))


Which can be diagrammed this way:



sentence 1 parse tree



On the other hand, if you rearrange the sentence slightly:




The children had fun on the weekend.




You get this tree:



(ROOT
(S
(NP (DT The) (NNS children))
(VP (VBD had)
(NP
(NP (NN fun))
(PP (IN on)
(NP (DT the) (NN weekend)))))
(. .)))


Whose diagram is this:



parse tree for sentence 2



For a simple parse, I think that is as good as you are going to get it. But you wish to try a constituency parser that can show linkages more complex that the simple tree above illustrates. For example, using CMU’s Link Grammar Parser:



    +------------------------Xp-----------------------+
+---------------Wd--------------+ |
| +-----------CO-----------+ |
| +----Js---+ | |
| | +--Ds--+ +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | |
LEFT-WALL on the weekend.n the children.n had.v fun.n .


Notice the CO link applies that opener to the entire rest of the sentence. If you follow the [CO link]’s docs(http://www.link.cs.cmu.edu/link/dict/section-CO.html), you find that this is “sentence opener” link, used to connect sentence openers to the subjects of sentences. It mentions, amongst other things:




Openers may take commas; almost all words with CO+ therefore
have "({{Xd-} & Xc+} & CO+)". With participles and adjectives,
the comma is obligatory; "*Still upset about Joe they went to
a movie" seems wrong. The Xd- allows a comma before the phrase
as well as after. This frequently happens if the opener is not
at the beginning of the phrase: "They claimed that, on
Tuesday, they went to a movie." If the opener begins the
sentence, then a comma before the opener is of course
incorrect, but we allow it. See "X: Comma phrases".




And indeed, if you add the comma, you get another element in the parse (the Xc element), but nothing else changes, showing that these are equivalent:



    +-------------------------Xp------------------------+
+----------------Wd---------------+ |
| +------------CO------------+ |
| +-------Xc------+ | |
| +----Js---+ | | |
| | +--Ds--+ | +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | | |
LEFT-WALL on the weekend.n , the children.n had.v fun.n .


For more details, check out the Standford NLP Group’s page here. I have used some of those tools, and they take a fair bit of set-up that I would never wish on a non-programmer, but they can be quite interesting.



You may wish to also try a dependency parse. These can be harder to read, but provide better linkages. One dependency parse visualization tool can be downloaded from here.



If you jump through all their hoops, you get the following output:



dependency graph



Notice that at last we can see that the PP at the start of the sentence correctly applies to the VP.






share|improve this answer























  • Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
    – Saebekassebil
    Dec 11 '12 at 15:20










  • BTW: Why is Berkeleys parser making those (...) markings?
    – Saebekassebil
    Dec 11 '12 at 15:22










  • @Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
    – tchrist
    Dec 11 '12 at 15:25










  • Haven't got up to transformations, yet, eh? See here for an abbreviated list.
    – John Lawler
    Dec 11 '12 at 16:26






  • 1




    The DependenSee link gives a 500 at the moment but the source for it is here.
    – Jason C
    Dec 20 '15 at 3:29














4












4








4






EDIT: Given the sentence:




On the weekend the children had fun.




You can get a dependency parse (described at the bottom of this posting) that looks like this:



dependency graph



Which I believe may be more of what you are looking for.





The Berkeley parser produces this parse using its simple online interface:



(ROOT
(S
(PP (IN On)
(NP (DT the) (NN weekend)))
(NP (DT the) (NNS children))
(VP (VBD had)
(NP (NN fun)))
(. .)))


Which can be diagrammed this way:



sentence 1 parse tree



On the other hand, if you rearrange the sentence slightly:




The children had fun on the weekend.




You get this tree:



(ROOT
(S
(NP (DT The) (NNS children))
(VP (VBD had)
(NP
(NP (NN fun))
(PP (IN on)
(NP (DT the) (NN weekend)))))
(. .)))


Whose diagram is this:



parse tree for sentence 2



For a simple parse, I think that is as good as you are going to get it. But you wish to try a constituency parser that can show linkages more complex that the simple tree above illustrates. For example, using CMU’s Link Grammar Parser:



    +------------------------Xp-----------------------+
+---------------Wd--------------+ |
| +-----------CO-----------+ |
| +----Js---+ | |
| | +--Ds--+ +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | |
LEFT-WALL on the weekend.n the children.n had.v fun.n .


Notice the CO link applies that opener to the entire rest of the sentence. If you follow the [CO link]’s docs(http://www.link.cs.cmu.edu/link/dict/section-CO.html), you find that this is “sentence opener” link, used to connect sentence openers to the subjects of sentences. It mentions, amongst other things:




Openers may take commas; almost all words with CO+ therefore
have "({{Xd-} & Xc+} & CO+)". With participles and adjectives,
the comma is obligatory; "*Still upset about Joe they went to
a movie" seems wrong. The Xd- allows a comma before the phrase
as well as after. This frequently happens if the opener is not
at the beginning of the phrase: "They claimed that, on
Tuesday, they went to a movie." If the opener begins the
sentence, then a comma before the opener is of course
incorrect, but we allow it. See "X: Comma phrases".




And indeed, if you add the comma, you get another element in the parse (the Xc element), but nothing else changes, showing that these are equivalent:



    +-------------------------Xp------------------------+
+----------------Wd---------------+ |
| +------------CO------------+ |
| +-------Xc------+ | |
| +----Js---+ | | |
| | +--Ds--+ | +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | | |
LEFT-WALL on the weekend.n , the children.n had.v fun.n .


For more details, check out the Standford NLP Group’s page here. I have used some of those tools, and they take a fair bit of set-up that I would never wish on a non-programmer, but they can be quite interesting.



You may wish to also try a dependency parse. These can be harder to read, but provide better linkages. One dependency parse visualization tool can be downloaded from here.



If you jump through all their hoops, you get the following output:



dependency graph



Notice that at last we can see that the PP at the start of the sentence correctly applies to the VP.






share|improve this answer














EDIT: Given the sentence:




On the weekend the children had fun.




You can get a dependency parse (described at the bottom of this posting) that looks like this:



dependency graph



Which I believe may be more of what you are looking for.





The Berkeley parser produces this parse using its simple online interface:



(ROOT
(S
(PP (IN On)
(NP (DT the) (NN weekend)))
(NP (DT the) (NNS children))
(VP (VBD had)
(NP (NN fun)))
(. .)))


Which can be diagrammed this way:



sentence 1 parse tree



On the other hand, if you rearrange the sentence slightly:




The children had fun on the weekend.




You get this tree:



(ROOT
(S
(NP (DT The) (NNS children))
(VP (VBD had)
(NP
(NP (NN fun))
(PP (IN on)
(NP (DT the) (NN weekend)))))
(. .)))


Whose diagram is this:



parse tree for sentence 2



For a simple parse, I think that is as good as you are going to get it. But you wish to try a constituency parser that can show linkages more complex that the simple tree above illustrates. For example, using CMU’s Link Grammar Parser:



    +------------------------Xp-----------------------+
+---------------Wd--------------+ |
| +-----------CO-----------+ |
| +----Js---+ | |
| | +--Ds--+ +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | |
LEFT-WALL on the weekend.n the children.n had.v fun.n .


Notice the CO link applies that opener to the entire rest of the sentence. If you follow the [CO link]’s docs(http://www.link.cs.cmu.edu/link/dict/section-CO.html), you find that this is “sentence opener” link, used to connect sentence openers to the subjects of sentences. It mentions, amongst other things:




Openers may take commas; almost all words with CO+ therefore
have "({{Xd-} & Xc+} & CO+)". With participles and adjectives,
the comma is obligatory; "*Still upset about Joe they went to
a movie" seems wrong. The Xd- allows a comma before the phrase
as well as after. This frequently happens if the opener is not
at the beginning of the phrase: "They claimed that, on
Tuesday, they went to a movie." If the opener begins the
sentence, then a comma before the opener is of course
incorrect, but we allow it. See "X: Comma phrases".




And indeed, if you add the comma, you get another element in the parse (the Xc element), but nothing else changes, showing that these are equivalent:



    +-------------------------Xp------------------------+
+----------------Wd---------------+ |
| +------------CO------------+ |
| +-------Xc------+ | |
| +----Js---+ | | |
| | +--Ds--+ | +--Dmc--+---Sp--+--Os-+ |
| | | | | | | | | |
LEFT-WALL on the weekend.n , the children.n had.v fun.n .


For more details, check out the Standford NLP Group’s page here. I have used some of those tools, and they take a fair bit of set-up that I would never wish on a non-programmer, but they can be quite interesting.



You may wish to also try a dependency parse. These can be harder to read, but provide better linkages. One dependency parse visualization tool can be downloaded from here.



If you jump through all their hoops, you get the following output:



dependency graph



Notice that at last we can see that the PP at the start of the sentence correctly applies to the VP.







share|improve this answer














share|improve this answer



share|improve this answer








edited Dec 11 '12 at 14:52

























answered Dec 11 '12 at 13:32









tchrist

108k28290463




108k28290463












  • Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
    – Saebekassebil
    Dec 11 '12 at 15:20










  • BTW: Why is Berkeleys parser making those (...) markings?
    – Saebekassebil
    Dec 11 '12 at 15:22










  • @Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
    – tchrist
    Dec 11 '12 at 15:25










  • Haven't got up to transformations, yet, eh? See here for an abbreviated list.
    – John Lawler
    Dec 11 '12 at 16:26






  • 1




    The DependenSee link gives a 500 at the moment but the source for it is here.
    – Jason C
    Dec 20 '15 at 3:29


















  • Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
    – Saebekassebil
    Dec 11 '12 at 15:20










  • BTW: Why is Berkeleys parser making those (...) markings?
    – Saebekassebil
    Dec 11 '12 at 15:22










  • @Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
    – tchrist
    Dec 11 '12 at 15:25










  • Haven't got up to transformations, yet, eh? See here for an abbreviated list.
    – John Lawler
    Dec 11 '12 at 16:26






  • 1




    The DependenSee link gives a 500 at the moment but the source for it is here.
    – Jason C
    Dec 20 '15 at 3:29
















Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
– Saebekassebil
Dec 11 '12 at 15:20




Thanks for the answer, it hadn't even occurred to me that I could just rearrange the sentence to get a much better understanding of it. I was looking for a phrase structure parse, and not a dependency parse, but you might be right that it's more expressive.
– Saebekassebil
Dec 11 '12 at 15:20












BTW: Why is Berkeleys parser making those (...) markings?
– Saebekassebil
Dec 11 '12 at 15:22




BTW: Why is Berkeleys parser making those (...) markings?
– Saebekassebil
Dec 11 '12 at 15:22












@Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
– tchrist
Dec 11 '12 at 15:25




@Saebekassebil If you mean the (. .) at the end, it is for the final stop / period at the end. If you just mean parens in general, it’s because that’s the way people write their trees in NLP.
– tchrist
Dec 11 '12 at 15:25












Haven't got up to transformations, yet, eh? See here for an abbreviated list.
– John Lawler
Dec 11 '12 at 16:26




Haven't got up to transformations, yet, eh? See here for an abbreviated list.
– John Lawler
Dec 11 '12 at 16:26




1




1




The DependenSee link gives a 500 at the moment but the source for it is here.
– Jason C
Dec 20 '15 at 3:29




The DependenSee link gives a 500 at the moment but the source for it is here.
– Jason C
Dec 20 '15 at 3:29


















draft saved

draft discarded




















































Thanks for contributing an answer to English Language & Usage Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fenglish.stackexchange.com%2fquestions%2f93989%2fbuilding-a-phrase-structure-of-on-the-weekend%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

If I really need a card on my start hand, how many mulligans make sense? [duplicate]

Alcedinidae

Can an atomic nucleus contain both particles and antiparticles? [duplicate]