Fast String Matching using an $n$-gram Algorithm

Kim, J.Y. and Shawe-Taylor, J. (1994) Fast String Matching using an $n$-gram Algorithm. Software: Practice and Experience, 24 (1), 79-88.

Record type: Article

This record has no associated files available for download.

More information

Published date: January 1994

Organisations: Electronics & Computer Science

Local EPrints ID: 259811

URI: http://eprints.soton.ac.uk/id/eprint/259811

ISSN: 0038-0644

PURE UUID: d77df688-63c0-4906-9abb-8b56480ceddf

Date deposited: 23 Aug 2004

Last modified: 10 Dec 2021 21:06

Author: J.Y. Kim

Author: J. Shawe-Taylor

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.