Sequitur algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 01:06, 9 February 2019 edit Citation bot (talk \| contribs) Bots 5,861,362 edits m Alter: title, template type. Add: citeseerx, isbn, chapter, pages. Formatted dashes. \| You can use this bot yourself. Report bugs here. \| User-activated. ← Previous edit		Latest revision as of 00:53, 6 December 2024 edit undo IznoRepeat (talk \| contribs) Extended confirmed users 50,782 edits m →External links: add WP:TEMPLATECAT to remove from template; genfixes Tag: AWB
(6 intermediate revisions by 6 users not shown)
Line 1: '''Sequitur''' (or '''Nevill-~~Manning~~Manning–Witten algorithm''') is a recursive algorithm developed by [[Craig Nevill-Manning]] and [[Ian H. Witten]] in 1997<ref name=Nevill-manning1997>{{cite journal \| author = ~~[[Craig Nevill-Manning\|~~Nevill-Manning, C.G.]] \| author-link = Craig Nevill-Manning \| author2 = Witten, I.H. \| year = 1997 Line 8 ⟶ 9: }}</ref> that infers a hierarchical structure ([[context-free grammar]]) from a sequence of discrete symbols. The algorithm operates in linear space and time. It can be used in [[data compression]] software applications.<ref name=Nevill-manning1997_2>{{cite book \| doi = 10.1109/DCC.1997.581951 \| author = ~~[[Craig Nevill-Manning\|~~Nevill-Manning, C.G.]] \| author-link = Craig Nevill-Manning \| title = Proceedings DCC '97. Data Compression Conference \| pages = 3–11 Line 16 ⟶ 18: \| isbn = 978-0-8186-7761-8 \| citeseerx = 10.1.1.30.2305 \| s2cid = 14324301 }}</ref> Line 42 ⟶ 45: * [[Lossless compression\|Lossless data compression]] * [[Straight-line grammar]] * [[Byte pair encoding]] ==References== {{~~reflist~~Reflist}} ==External links== * [http://www.sequitur.info/ sequitur.info – the reference Sequitur algorithm implementation in C++, Java, and other languages] {{Compression methods}} [[Category:Lossless compression algorithms]] [[Category:Data compression]]