Convert LINQ nested Any's to take N parameters : Requirement: check if a list of successive words exists in a dataset. If it does, return a boolean to show the success.

Here is my code so far with unit tests:

     [Test]
        public void PhraseSearch()
        {
            var DataSet = new List<Word>
                            {
                                new Word { Text = "First", Sequence = 0 },
                                new Word { Text = "Second", Sequence = 1 },
                                new Word { Text = "Third", Sequence = 2 },
                                new Word { Text = "Forth", Sequence = 3 },
                                new Word { Text = "Five", Sequence = 4 }
                            };

            var goodSearch = new string[]{ "First", "Second", "Third" };
            var badSearch = new string[] { "First", "NOTFOUND", "Third" };

            // successful test for 2 words
            var result = DataSet.Any(wrd1 => wrd1.Text == goodSearch[0] && DataSet.Any(wrd2 => wrd2.Text == goodSearch[1] && wrd2.Sequence == wrd1.Sequence + 1));
            Assert.That(result, Is.True);

             result = DataSet.Any(wrd1 => wrd1.Text == badSearch[0] && 
                        DataSet.Any(wrd2 => wrd2.Text == badSearch[1] && wrd2.Sequence == wrd1.Sequence + 1));

            // successful test for 2 words that don't match the data
            Assert.That(result, Is.False);

            // successful test for 3 words
            result = DataSet.Any(wrd1 => wrd1.Text == goodSearch[0] && 
                                       DataSet.Any(wrd2 => wrd2.Text == goodSearch[1] && wrd2.Sequence == wrd1.Sequence + 1 && 
                                                         DataSet.Any(wrd3 => wrd3.Text == goodSearch[2] && wrd3.Sequence == wrd2.Sequence + 1)));
            Assert.That(result, Is.True);

            // test for N words
            result = .....
        }

I want to expand the Linq code to do N words, but i'm not sure how to do this with Linq, I'm leaning towards a hard coded method for each number of words but that seems really smelly.