Story

Have you seen this post from 9gag?
Maybe you got the feeling to make your own sentences. But then you realize that you could just golf a script in half an hour, and you will never have to deal time with that.

The submission

Your program will get an input string which it will return with quation marks as explained bellow.
Standard loopholes are forbidden. Output as list of lines is allowed. Trailing spaces, empty lines that doesn't break the output are allowed.

The rules of input

The input only contains printable ASCII characters.
The input may contain spaces. The words are determined with them.
If one word is given then the program has to return the string between quation marks.

Example of one word:

test -> "test"

If the input string has 2 or more words then it returns first with the whole input, but the first word in quation, on the second time, all the input but the second word between quation marks and so on.

In general, the program has to return as many lines, as many words are in the input.

Example of three words:

This is codegolf -> "This" is codegolf
 This "is" codegolf
 This is "codegolf"

The case of no input, or empty string doesn't matter.

Examples:

This is a significantly longer, but not the longest testcase -> "This" is a significantly longer, but not the longest testcase
 This "is" a significantly longer, but not the longest testcase
 This is "a" significantly longer, but not the longest testcase
 This is a "significantly" longer, but not the longest testcase
 This is a significantly "longer," but not the longest testcase
 This is a significantly longer, "but" not the longest testcase
 This is a significantly longer, but "not" the longest testcase
 This is a significantly longer, but not "the" longest testcase
 This is a significantly longer, but not the "longest" testcase
 This is a significantly longer, but not the longest "testcase"

Here is an another one -> "Here" is an another one
 Here "is" an another one
 Here is "an" another one
 Here is an "another" one
 Here is an another "one"

This is codegolf, so the least byte answer wins!

Retina 0.8.2, 17 bytes

 
" $'¶$` "
^|$
"

Try it online! Link includes test suite. Explanation:

 
" $'¶$` "

Expand each space by duplicating the line and then inserting quotation marks.

^|$
"

Fix the first and last lines.

PowerShell, 70 65 bytes

param($a)$a.Split()|%$a-replace[regex]"( 

Try it online!

Has test suite in trial. Has 1 leading space on first row, and 1 trailing space on last row. Attempting to refactor.

Charcoal, 19 bytes

Ｅ⪪θ ⪫Ｅ⪪θ ⎇⁼κμ⪫""λλ 

Try it online! Link is to verbose version of code. Note: Trailing space. Explanation:

 θ Input string
 ⪪ Split on literal space
Ｅ Map over words
 θ Input string
 ⪪ Split on literal space
 Ｅ Map over words
 μ Inner index
 ⁼ Equals
 κ Outer index
 ⎇ If true then
 "" Literal string `""`
 ⪫ Joined i.e. wrapping
 λ Current word
 λ Otherwise current word
 ⪫ Joined with literal space
 Implicitly print each result on its own line

05AB1E, 14 bytes

#©v®y…"ÿ"Nǝðý=

Try it online!

R, 94 bytes

m=matrix(s<-scan(t=scan(,a<-'"'),w=a),n<-length(s),n)
diag(m)=paste0(a,s,a)
cat(rbind(m,"n"))

Try it online!

I can't get it to work on TIO yet, because of the scan(scan()) business. On my machine, it takes in e.g. This is codegolf and outputs correctly

"This" is codegolf 
 This "is" codegolf 
 This is "codegolf" 

It uses a matrix format to easily change the diagonal entries. Note that usually, in R code-golf, strings are read in with scan(,""), but any string can be used instead of the empty string as second parameter. Using a (defined as '"') which will also be needed afterwards saves 1 byte.

Explanation of ungolfed version:

a <- '"' # string made of a single quote
s <- scan(t=scan(,a),w=a) # read in input and separate by spaces
n <- length(s) # number of words
m = matrix(s, n, n) # fill a matrix, one word per entry, each column corresponds to the whole sentence. The sentence is repeated n times.
diag(m) = paste0(a, s, a) # replace diagonal entries with the corresponding word surrounded by quotes
cat(rbind(m,"n")) # add a n at the end of each column, then print column-wise