Skip to main content
Conference Proceedings

Longest-match pattern matching with weighted finite state automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4002 LNAI 78-85
DOI: 10.1007/11780885_9
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

I present a new method of longest match pattern matching based on weighted finite state automata. Contrary to the approach of Karttunen [9] we do not need expensive complementation operations to construct the pattern matching transducer.

Cite

CITATION STYLE

APA

Hanneforth, T. (2006). Longest-match pattern matching with weighted finite state automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4002 LNAI, pp. 78–85). Springer Verlag. https://doi.org/10.1007/11780885_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free