State-space models have been used in many applications, including econometrics, engi- neering, medical research, etc. The maximum likelihood estimation (MLE) of the static pa- rameter of general state-space models is not straightforward because the likelihood func- tion is intractable. It is popular to use the sequential Monte Carlo(SMC) method to per- form gradient ascent optimisation in either offline or online fashion. One problem with existing online SMC methods for MLE is that the score estimators are inconsistent, i.e. the bias does not vanish with increasing particle size. In this paper, two SMC algorithms are proposed based on an importance sampling weight function to use each set of generated particles more efficiently. The first one is an offline algorithm that locally approximates the likelihood function using importance sam- pling, where the locality is adapted by the effective sample size (ESS). The second one is a semi-online algorithm that has a compu- tational cost linear in the particle size and uses score estimators that are consistent. We study its consistency and asymptotic normal- ity. Their computational superiority is illus- trated in numerical studies for long time se- ries.