text:
Kleinburg

Kleinburg is an unincorporated village in the city of Vaughan, Ontario, Canada. It is home to the McMichael Canadian Art Collection, an art gallery with a focus on the Group of Seven, and the Kortright Centre for Conservation. In 2001, the village and its surrounding communities had a population of 4,595; the village itself has 282 dwellings, with a population of 952. Kleinburg comprises a narrow section of hilly landscape situated between two branches of the Humber River. The historic village is bounded by Highway 27 on the west and Stegman’s Mill Road to the east. Kleinburg has subsumed the nearby hamlet of Nashville, but it has not itself been fully subsumed into the main urban area of Vaughan.

Geography
The village is located between two branches of the Humber River, and features dense forests throughout its 1.05 km² of land area. Its northern and western peripheries are primarily agricultural.

History
The community was founded in 1848 by John Nicholas Kline (1825–1854), a German-Canadian settler. A direct translation of the German word Kleinburg is 'small castle'. Residents argue that the community of Kleinburg could be named after its founder or after its landscape (although the latter would necessitate the spelling Kleinberg, which is German for 'small mountain').

In its early days, Kleinburg was dependent on its many flour and wheat mills, located off the Humber River.

Kleinburg has historically been a small, quiet town, but it now attracts many affluent visitors and residents. Housing developments began during the 1950s in the west and continued during the 1970s in the southeast of Kleinburg. Other developments occurred during 1993 in the south, 1998 in the northeast, and during the 2000s in the north. During its major expansion in the 1990s and early 2000s, many new large homes were built.

Main Street
The historic commercial district of Kleinburg along Islington Avenue has many heritage buildings, as well as modern developments with mixed residential and commercial uses. Main street has local shops, restaurants, and national chains including Royal Bank. Its oldest extant building, built in 1867, is home of The Doctor's House restaurant.

Local attractions include the McMichael Art Gallery, Kortright Centre, Humber River Trails, Bindertwine Park, Pierre Berton Heritage Centre, and Copper Creek Golf Course.

Politics
Kleinburg is not an incorporated entity; it has no political jurisdiction and no geopolitically-defined boundaries. Residents vote for a councillor in ward 1 of Vaughan City Council.

The community of Nashville, though distinct from Kleinburg, is considered part of Kleinburg. Residents of Nashville receive many of their services, such as postal and medical services, within Kleinburg.

Education
Most non-Catholic students were once bused to nearby King City Secondary School in King City. Since the opening of Emily Carr Secondary School, busing was eliminated, forcing students to walk far to get to the school as not even public busing services the area. There are not enough students for Kleinburg's own secondary school. In 2008, the oldest and most historical school, Kleinburg Public Elementary school, was demolished and a new public elementary school by the same name was built and opened in September 2009. There are 5 schools in Kleinburg:
 * Kleinburg Christian Academy (Private Elementary)
 * Kleinburg Public Elementary School (Public Elementary)
 * Ecole La Fontaine (French Public Elementary School)
 * Montessori School of Kleinburg (Private School)
 * The Hill Academy (Private Secondary for student-athletes)- moved to Caledon
 * Pope Francis Catholic School (Public Catholic School)

Parks and recreation
Kleinburg is home to several parks, all of which are operated by the city of Vaughan's Parks and Forestry Operations.

While Kleinburg does not have its own community centre, its residents make use of the Al Palladini Community Centre, located in nearby Woodbridge.
 * Bindertwine Park
 * Butterfly Heights
 * East Corners Park
 * Ross Gurreri Park
 * Secord Park
 * Summit Park
 * Tinsmith Parkette
 * Treelawn Parkette
 * Wishing Well Park
 * Woodgate Park

Culture
Binder Twine is a festival held annually that attracts 25,000 people on average. This tradition began in 1890 by Charles Shaw Jr. who distributed binder twine to local farmers. Kleinburg also has a Christmas tree lighting celebration where the community comes together to donate to The Red Bow Campaign and the KARA Holiday Food Drive while waiting for the lighting of the tree in front of the Kline house. There is also Canada Day in Kleinburg and Cartunes in Kleinburg events which allow the community to celebrate the history of the village.

In film
Kleinburg is home to the Cinespace Film Studios (formerly Toronto International Film Studios), a centre for television and motion picture production. The TV show The Forest Rangers was filmed here from 1963 to 1965. A reunion was held at the studios in June, 2013 with Gordon Pinsent and nine junior rangers in attendance.

Other films shot at the studio between 1960 and 1990 include: The Fox, The First Time, Recommendation for Mercy, Shoot, Welcome to Blood City, Death Weekend, The Shape of Things to Come, Rituals, Riel, Fish Hawk, The Amateur, Sesame Street Presents Follow That Bird, The Fly and Love at Stake. Television shows filmed here include: Hudson's Bay, Hatch's Mill, The Adventures of Timothy Pilgrim, Search and Rescue, Matt and Jenny, The Great Detective and The Littlest Hobo.

Downtown Kleinburg and the farmland surrounding it featured significantly in the 1st season of the 1971 television series, Dr. Simon Locke.

In 2006, the movie The Sentinel was filmed at the McMichael Art Gallery. In the movie, all of the Camp David scenes, both indoor and outdoor, were filmed on the grounds of the McMichael Art Gallery, most notably the scene on the "Wedding Hill" where they filmed the president's helicopter taking off and being shot down by a missile (the explosion was added in after using special effects).

In 2015, Cinespace moved out of the studios they had been renting. The Vaughan Sports Centre, a private company, has repurposed them as baseball training facilities.

Notable residents
Kleinburg was home to Canadian author Pierre Berton for nearly 50 years until his death in 2004, and to his friend and business associate John G. McClelland, co-founder of McClelland & Stewart. Kleinburg was also the home of former prime minister Lester B. Pearson. Stephen Lecce, an Ontario MPP and minister of various portfolios first elected in 2018, lived in Kleinburg at the time of his service as a provincial politician.

title: Kleinburg


text:
Talk:Baker Street

There is another article 221B Baker Street with largely indentical material. We should at least consider merging the two articles and redirecting one entry to the other. I withdraw the suggestion. RJFJR 16:46, Dec 24, 2004 (UTC)

Untitled
According to the article 221B Baker Street Baker street wasn't numbered until 1930, which is why we can't have a street number for Madame Tussauds. (I went looking for the address in Madame Tussauds and then realized why I'd never find it). RJFJR 16:46, Dec 24, 2004 (UTC)

The part about pedants and Paddington is odd since the Hammersmith and City line at Paddington is above ground, so of course you need to go above ground to transfer.

"pleasant smell of freshly baked bread (and freshly rolled cigars)"
I lived just off Baker Street for a year and never noticed that. Maybe this sentence refers to some period in the past? --Jcmo 15:01, 23 December 2005 (UTC)

 * Me neither. Gone.

 * There used to be a Europa store near McDonalds which had that fresh bread smell for a while - maybe that's what was being referred to. Not sure about the cigars though.--Popeyedoyle 14:13, 5 May 2006 (UTC)

Selfridges
Actually, Selfridges is on the corner of Oxford Street and Orchard Street. Baker Street only starts north of Portman Square.--Jcmo (talk) 13:50, 1 September 2010 (UTC)

Confusing Geography Bit.
The second paragraph of the lede is incredibly confusing to me. Maybe it is more clear for people who know the area but I read it four times and am still very lost. Is anyone capable of cleaning it up? Ayzmo (talk) 22:41, 12 November 2012 (UTC)

Constituency query
Was Baker Street in Marylebone East or Marylebone West in the late 19th century? Jackiespeel (talk) 14:02, 18 July 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Baker Street. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20131211155353/https://www.gov.uk/government/uploads/system/uploads/attachment_data/file/263519/LDL_December_2013.pdf to https://www.gov.uk/government/uploads/system/uploads/attachment_data/file/263519/LDL_December_2013.pdf

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.— InternetArchiveBot  (Report bug) 10:40, 24 October 2016 (UTC)

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Talk:Baker Street


text:
Indian Trail

Indian Trail may refer to:

 * A part of or the whole of the Great Trail created by Native Americans
 * Indian Trail, North Carolina
 * Indian Trails, an intercity bus service provider in and around Michigan

title: Indian Trail


text:
User talk:Christian.ispir

Welcome!

Hello,, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers: I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~); this will automatically produce your name and the date. If you need help, check out Where to ask a question, ask me on my talk page, or place  on your talk page and someone will show up shortly to answer your questions. Again, welcome!
 * The five pillars of Wikipedia
 * How to edit a page
 * Help pages
 * Tutorial
 * How to write a great article
 * Manual of Style

 * Hello Christian.ispir. I love your photo of Holyhead from the air. I help run a small website about Holyhead - Caergybi.com and would love to be able to use the photo if you are the copyright owner. If you have a minute could you go along to the site and leave a message with your email address from the contact page (link to your site doesn't work).  Thanks.  Cod 19:18, 11 August 2005 (UTC)
 * Bine aţi venit. I figured that rather than just edit your recent addition at Palace of the Parliament, I'd discuss the edits I want to make; I see this is a brand new account, and I don't want you to think I'm just being arbitrary. Please see my comments at Talk:Palace_of_the_Parliament; feel free to respond (or not). -- Jmabel | Talk 04:51, Dec 19, 2004 (UTC)
 * Good work. I've added some further comments. Have you got the hang of the watchlist yet? I've been dropping these notes because as a new user I'm not sure you know yet how to watchlist the article. If not, check out Watchlist help. -- Jmabel | Talk 19:24, Dec 19, 2004 (UTC)
 * Also, a more specific citation from Gardianul would be good. Not that failing to do so would be unusual, it's just that it is a great defense against later disputes. -- Jmabel | Talk 19:27, Dec 19, 2004 (UTC)

Image Tagging Image:Fuchsia in full bloom.jpg
Thanks for uploading Image:Fuchsia in full bloom.jpg. I notice the 'image' page currently doesn't specify who created the content, so the copyright status is unclear. If you have not created this media yourself then you need to argue that we have the right to use the media on Wikipedia (see copyright tagging below). If you have not created the media yourself then you should also specify where you found it, i.e., in most cases link to the website where you got it, and the terms of use for content from that page.

If the media also doesn't have a copyright tag then you must also add one. If you created/took the picture, audio, or video then you can use GFDL-self to release it under the GFDL. If you believe the media qualifies as fair use, please read fair use, and then use a tag such as or one of the other tags listed at Image copyright tags. See Image copyright tags for the full list of copyright tags that you can use.

If you have uploaded other media, please check that you have specified their source and copyright tagged them, too. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that any unsourced and untagged images will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. Thank you. Shyam ( T / C ) 13:55, 12 March 2006 (UTC)

Image Tagging Image:Honterus.JPG
Thanks for uploading Image:Honterus.JPG. I notice the 'image' page currently doesn't specify who created the content, so the copyright status is unclear. If you have not created this media yourself then there needs to be an argument why we have the right to use the media on Wikipedia (see copyright tagging below). If you have not created the media yourself then it needs to be specified where it was found, i.e., in most cases link to the website where it was taken from, and the terms of use for content from that page.

If the media also doesn't have a copyright tag then one should be added. If you created/took the picture, audio, or video then the GFDL-self tag can be used to release it under the GFDL. If you believe the media qualifies as fair use, consider reading fair use, and then use a tag such as or one of the other tags listed at Image copyright tags. See Image copyright tags for the full list of copyright tags that you can use.

If you have uploaded other media, consider checking that you have specified their source and copyright tagged them, too. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that any unsourced and untagged images will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. --Hetar 04:47, 3 May 2006 (UTC)

Image Tagging for Image:JHonterus.JPG
Thanks for uploading Image:JHonterus.JPG. The image has been identified as not specifying the source and creator of the image, which is required by Wikipedia's policy on images. If you don't indicate the source and creator of the image on the image's description page, it may be deleted some time in the next seven days. If you have uploaded other images, please verify that you have provided source information for them as well.

For more information on using images, see the following pages:
 * Image use policy
 * Image copyright tags

This is an automated notice by OrphanBot. For assistance on the image use policy, see Media copyright questions. 16:08, 4 May 2006 (UTC)

Speedy deletion nomination of Fish Smarty

A tag has been placed on Fish Smarty, requesting that it be speedily deleted from Wikipedia. This has been done under the criteria for speedy deletion, because the article seems to be unambiguous advertising that only promotes a company, product, group, service or person and would need to be fundamentally rewritten in order to become an encyclopedia article. Please read the general criteria for speedy deletion, particularly item 11, as well as the guidelines on spam.

If you can indicate why the subject of this article is not blatant advertising, you may contest the tagging. To do this, please add  on the top of Fish Smarty and leave a note on |the article's talk page explaining your position. Please do not remove the speedy deletion tag yourself, but don't hesitate to add information to the article that would help make it encyclopedic, as well as adding any citations from independent reliable sources to ensure that the article will be verifiable. Feel free to leave a note on my talk page if you have any questions about this. LordVetinari (talk) 05:52, 7 February 2011 (UTC)

Orphaned non-free image File:Fish Smarty logo.jpg
 Thanks for uploading File:Fish Smarty logo.jpg. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of "file" pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free images not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. Skier Dude2 (talk) 06:32, 7 March 2011 (UTC)

Nomination of Fish Smarty for deletion
A discussion is taking place as to whether the article Fish Smarty is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Articles for deletion/Fish Smarty until a consensus is reached, and anyone is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on good quality evidence, and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion template from the top of the article. Wuh Wuz  Dat  14:46, 4 April 2011 (UTC)

Orphaned non-free image File:Fish-Smarty-logo-3.png
 Thanks for uploading File:Fish-Smarty-logo-3.png. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of "file" pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free images not used in any articles will be deleted after seven days, as described in the criteria for speedy deletion. Thank you. Courcelles 04:29, 27 April 2011 (UTC)

Orphaned non-free image File:FishSmartyLogo.png
 Thanks for uploading File:FishSmartyLogo.png. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of "file" pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free images not used in any articles will be deleted after seven days, as described in the criteria for speedy deletion. Thank you. Courcelles 06:14, 1 May 2011 (UTC)

title: User talk:Christian.ispir


text:
Talk:Sweetnighter

Fair use rationale for Image:WRsweetnighter.jpg
Image:WRsweetnighter.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images uploaded after 4 May, 2006, and lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot 05:20, 14 July 2007 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Sweetnighter. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Corrected formatting/usage for http://www.rollingstone.com/artists/weatherreport

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.—cyberbot II  Talk to my owner :Online 22:12, 4 April 2016 (UTC)

title: Talk:Sweetnighter


text:
Indian Village

Indian Village may refer to several places in the United States:

 * Indian Village, California
 * Indian Village, Chicago, Illinois
 * Indian Village, Indiana
 * Indian Village Historic District (Fort Wayne, Indiana), listed on the National Register of Historic Places (NRHP)
 * Indian Village, Noble County, Indiana
 * Indian Village, Tippecanoe County, Indiana
 * Indian Village on Pawnee Fork, NRHP-listed in Ness County, Kansas
 * Indian Village, Louisiana, in Iberville Parish, Louisiana
 * Indian Village, Detroit, Michigan
 * Indian Village, Bronx, New York
 * Indian Village, Oregon

title: Indian Village


text:
Talk:Jaco Pastorius (album)

Fair use rationale for Image:Jaco Pastorius album.jpg
Image:Jaco Pastorius album.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to ensure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images lacking such an explanation can be deleted one week after being tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot (talk) 22:49, 13 February 2008 (UTC)

A stupid statement
There's something in the first paragraph about the album being popular among fans of jazz. This is a stupid comment. 65.95.54.177 (talk) —Preceding undated comment added 03:52, 31 October 2009 (UTC).

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Jaco Pastorius (album). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20110719112816/http://www.allaboutjazz.com/php/musician.php?id=10148 to http://www.allaboutjazz.com/php/musician.php?id=10148

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 20:31, 25 December 2017 (UTC)

title: Talk:Jaco Pastorius (album)


text:
User:TrentBuck

Trent Buck is a Computer Science student at Monash University, Australia.

He runs his own wiki, which has a more detailed personal page.

title: User:TrentBuck


text: Category:Jaco Pastorius albums

title: Category:Jaco Pastorius albums


text:
Yehuda Krinsky

Chaim Yehuda ("Yudel") Krinsky (born December 3, 1933, in Boston, Massachusetts) is a rabbi and a leader in the Chabad-Lubavitch movement. He served in various positions of the movement's administrative staff since 1954, and as a personal secretary to its chief rabbi, Menachem Mendel Schneerson (along with Leib Groner and Binyomin Klein) and is chairman of the movement's main institutions.

Krinsky claims that in 1988, after Schneerson's wife died, he named Krinsky an executor of his will.

As of 2004, Krinsky was among the most influential figures within the Chabad movement.

Biography
Krinsky grew up in Dorchester, Massachusetts and was educated at the Boston Latin School. At the age of 12, he was sent by his parents to study at the Central Lubavitch Yeshiva in Brooklyn, where he received his rabbinic ordination. He joined the Lubavitcher Rebbe's staff in 1952 as a driver.

Activities
In 1956 Krinsky was invited by Schneerson to join his secretariat, then headed by Chaim Mordechai Aizik Hodakov. Krinsky's position included work on behalf of the Merkos L'Inyonei Chinuch, the educational arm of the Chabad-Lubavitch movement. At that time, Schneerson also appointed Krinsky to direct the Lubavitch News Service, including disseminating Schneerson's talks around the world via satellite.

In 1972, Shneerson appointed Krinsky to the administrative boards of the movement's umbrella organization, Agudas Chasidei Chabad, and its educational arm, Merkos L'Inyonei Chinuch.

In 1990, Schneerson selected Krinsky to serve as the official secretary of the movement's three central organizations, Agudas Chasidei Chabad, Merkos L'Inyonei Chinuch, and Machneh Israel, the movement's social services arm.

Family
Krinsky married Devorah Kasinetz, daughter of Rabbi Zev and Ethel Kasinetz. Their children are:
 * Rabbi Levi Krinsky, director of Chabad of New Hampshire
 * Rabbi Hillel David Krinsky, who is married to Shterna Sarah Garelik, daughter of Rabbi Gershon Mendel Garelik, Chief Chabad Emissary of Milan, Italy. And is the founder of Jewish Educational Media.
 * Menachem Mendel Krinsky, who is married to Miriam Turner of Chicago
 * Rabbi Shmaya Krinsky, who is married to Rivkah Gutnick, daughter of Australian commodities magnate Joseph Gutnick
 * Sheine B. Krinsky, who is married to Rabbi Yosef B. Friedman, associate director of the Kehot Publication Society
 * Chana Krinsky, who is married to Rabbi Joseph Futerfas, director of Camp Gan Israel, New York

Recognition
Krinsky appeared in several lists of influential American Jews, including the Forward 50 in 2005.

From 2007 to 2013, Newsweek magazine compiled an annual list of the fifty most influential rabbis in the United States. Krinsky was in the top five every year.

title: Yehuda Krinsky


text:
Category:Emergency vehicles

This category lists different types of vehicles used to deal with emergency situiations.

title: Category:Emergency vehicles


text:
Talk:Word of Mouth (Jaco Pastorius album)

Untitled
This should probably be disambiguated to Word of Mouth (Jaco Pastorius album) since there is also a Kinks album by this name. gren グレン 17:56, 23 August 2005 (UTC)

Fair use rationale for Image:Jacowordofmouth.jpg
Image:Jacowordofmouth.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to ensure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images lacking such an explanation can be deleted one week after being tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot (talk) 23:05, 13 February 2008 (UTC)


text:
Rock music in Norway

Rock music arrived in Norway following the rock'n'roll musical revolution in the USA and Great Britain in the late 1950s. Norwegian rock quickly fostered capable musicians, but was strongly influenced by the Anglo-American starting point for the musical form. The leading Norwegian rock groups in the 1960s and 1970s largely expressed themselves in English, while Norwegian was long only used in the more traditional hit and pop music. Notable Norwegian rock bands include Titanic, a-ha, and Kaizers Orchestra.

1950s and 1960s
The most known rock and roll performers in the 1950s were Per Granberg, Per Hartvig (Rocke-Pelle), Jan Rohde and Odd Gisløy (Smiling Tommy). Gisløy even penned his own rock and roll composition: "Dancing with My Rockin' Shoes".

In the early 1960s the so-called Shadow bands (named after the British instrumental group The Shadows) were popular. Among the most notable were The Beatniks and The Vanguards. In the mid-1960s The Pussycats recorded two albums: one in Great Britain and one in West Germany, both produced by Sven-Erik Børja. Most of the songs were composed by group member Trond Graff.

1970s and 1980s
Titanic reached # 5 on the UK singles chart in 1971. Norway also has a notable progressive rock scene, which began in 1971 with the release of Junipher Greene's Friendship, the country's first double album.

Beginning in the mid-1970s it slowly became more acceptable to sing in Norwegian. One of the foremost pioneers of rock in Norwegian was the "trønder rocker" Åge Aleksandersen. This movement was also combined with experimentation in combining elements from folk and old dance music into rock. More progressive bands like Folque incorporated elements of traditional Norwegian folk music in their recordings. Other bands include Ruphus, Aunt Mary and Høst. This scene was in large part fueled by the success Frank Zappa had in Norway.

On July 20, 1977, the Sex Pistols played a concert at the Penguin Club in Oslo; they also played in Trondheim that month. These shows brought punk to Norway, inspiring a Norwegian punk rock scene. The first Norwegian punk bands make their record debuts during 1979. In the punk scene it is not clear which band released the first Norwegian punk single release; the top candidates are Pink Dirt, Graxelaget, Front Page, and Børres Kork. Trygve Mathiesen concludes that it was Børres Kork who's single had the earliest release date. In 1982 the Blitz-huset in Oslo was established, and that remained a center of the punk scene throughout the 1980s. There was also a punk milieu in Trondheim associated with the Hard Rock Kafé, which produced bands like Wannskrækk and Liliedugg. Punk continues to have an active scene in Norway, centered around the Blitz in Oslo and the UFFA house in Trondheim. Other cities including Bergen, Stavanger, Bodø, and Tromsø have also had smaller but active scenes. Bands such as Raga Rockers, DumDum Boys, Honningbarna, and Kvelertak have clear influences from the punk scene.

In the 80s Norway had A-Ha, Artch, Return, Stage Dolls and TNT, the first Norwegian band to be featured on the American Billboard charts. In the latter years of this decade a new generation of bands started to gain popularity. These were bands who sang in Norwegian. Here Norway got the "4 great ones": DumDum Boys, DeLillos, Raga Rockers and Jokke & Valentinerne. All these bands except Jokke (Joachim "Jokke" Nielsen died in 2000) are still active.

Since 1990
More recently, the Norwegian rock-scene has been dominated internationally by bands such as Turbonegro, Gluecifer and Madrugada, but several bands (like BigBang, Euroboys and Span) concentrate on the domestic market. The Stavanger hard rock band Kvelertak has been touring around the world with Purified in Blood among others since the release of their self-titled debut album in 2010.

In the 1990s, Norway saw the growing of the underground black metal scene,  with bands including Mayhem, Immortal, Enslaved, Darkthrone, Burzum, Gorgoroth, Satyricon, Solefald, and Dimmu Borgir. Industrial rock band Zeromancer was formed in 1999. A few members were formerly in the band Seigmen.

Since 2001, Kaizers Orchestra has been among the most important rock bands in Norway. The band employs a variety of unusual instruments including a pump organ and an accordion. They are known for their use of oil barrels, car wheels, and garbage cans as percussion instruments.

Literature

 * Trygve Mathisen. Tre grep og sannheten - Norsk punk 1977-1980. Vega forlag 2007. ISBN 9788282115445 (republished 2017).
 * Trygve Mathisen. Norsk postpunk 1980-1985 - Fra hardcore til A-ha. Vega forlag 2011. ISBN 9788282112055.

title: Rock music in Norway


text:
Jacko

Jacko may refer to:

First name

 * Jacko Eisenberg (born 1980), Israeli singer
 * Jacko McDonagh (born 1962), Irish footballer

Nickname

 * Jacko Barry (born 1975), Irish darts player
 * Jacko Fossett (1922–2004), English clown
 * Jacko Gill (born 1994), New Zealand shot putter
 * Jacko Heaslip (1899–1966), Irish cricketer
 * Mark Jackson (Australian footballer) (born 1959), Australian rules footballer
 * Michael Jackson (1958–2009), American entertainer nicknamed "Wacko Jacko"
 * Hidalgo Moya (1920–1994), American architect
 * Jacko Page (born 1959), British Army general

Surname

 * Edward W. Jacko (1916–1979) American civil rights attorney
 * Mário Jacko (born 1996), Slovak footballer
 * Patrik Jacko (born 1992), Slovak footballer, cousin of Mário Jacko

Ring name

 * Ali Jacko, ring name of English kickboxer Abdul Ali (born 1969)

Other uses

 * Jacko, claimed world record-holding rat-baiting terrier
 * The Jacko or The Dartmouth Jack-O-Lantern, American college humor magazine

title: Jacko


text:
User talk:Kyven

Your note
Hi, Kyven. Thanks for your note. I have replied. :) --Moonriddengirl (talk) 12:40, 7 January 2008 (UTC)

ArbCom elections are now open!
MediaWiki message delivery (talk) 12:54, 23 November 2015 (UTC)

title: User talk:Kyven


text:
User talk:Anthony/Current VfD

first try at this was deleted... so if this is redundant, sorry...

When I tried to create a redirect (my first) for Vermont Teddy Bear to go to Vermont Teddy Bear Company, I made an error. There were two made. One says Vermont Teddy Bear and the other is Vermont Teddy bear. I'd like the second one deleted since it's not grammatically correct.

Dismas

Jeez, Anthony, please try to fix it. I'm sure I'm not the only person who uses it to keep up to date on what the destructionists are trying to get rid of. Dr Zen 23:56, 3 Jan 2005 (UTC)

title: User talk:Anthony/Current VfD


text:
List of radio stations in Nebraska

The following is a list of FCC-licensed radio stations in the U.S. state of Nebraska which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.

Defunct

 * KFKX
 * KIMB

title: List of radio stations in Nebraska


text:
User talk:Revived

Welcome to my talk page.

Comments related to Phonebooking or the VfD
... have been moved to User_talk:Revived/Phonebooking.

De Moivre's formula
wouldn't this more aptly be called De Moivre's Theorem?-- Revived 04:25, 27 Dec 2004 (UTC)

 * The standard name is De Moivre's formula and there is nothing we can do about it. You are right, it is a theorem. Oleg Alexandrov 04:29, 27 Dec 2004 (UTC)

Collaboration of the Week
League of Nations is the new Collaboration of the Week. Please join in helping make it a feature article.

Hello!
Just saying hello, from one Waterloo student to another. There are a few UW students around here, in case you're interested. Looking at the page history of the University of Waterloo article is a good place to find them! Good work on the Keith Geddes article. If you work with the Maple group you might want to seriously expand the article on Maple, as I think it's lacking a bit now. Cheers. CryptoDerk 03:02, Dec 28, 2004 (UTC)

Baron Black of Crossharbour
Hi! Agree with you about the CB article. Go for it. Caveat: this is ongoing news, so it's difficult to write a well-developed article. Perhaps limiting yourself to a chronology of events related to Hollinger. This would be factual and NPOV.

The article could be organized like this, for instance. (short intro) 1. Early life 2. Press career 3. Published works 4. Marriage to Barbara Amiel and social life 5. Hollinger chronology

You might want to examine different aspects of the man; he's fascinating. Got expelled from UCC (or LCC?) for selling essays to classmates. Black (an anglo!) wrote one of the best political bios of any French Canadian politician, "Duplessis". He (a right wing capitalist!) wrote perhaps the best single volume bio of FDR, in unabashed praise of the New Deal. He's also active on the social scenes attending lots of parties with the Rich and Famous. Infamously attended a costume party dressed as Cardinal Richelieu. People tend to avoid sitting next to him at dinner because he bores listeners with endless statistics on, say, the exact number of ships wrecked ashore when the Spanish Armada foundered in the 16th century. And then he names and descibes each ship. I'd consider doing it myself, but no time for the research. Good luck. Vincent 04:34, 28 Dec 2004 (UTC)

FEDS
Sorry, I am just a PhD student at UW, I did my undergrad in the states, so I know nothing about anything that goes on at UW. Good luck with the article, looks good thus far. CryptoDerk 03:10, Apr 14, 2005 (UTC)

Referring to students' unions
I would probably use they vs it, it sounds really... impersonal. Whichever you decide to use, make sure it's consistant in the article. --Spinboy 04:20, 16 Apr 2005 (UTC)

User:211.160.80.35
He got his warning, so I'm watching to see if he vandalizes again. If he does, I'll block him. – ClockworkSoul 03:10, 17 Apr 2005 (UTC)
 * Well, he didn't heed the warnings, so he's blocked for 24 hours. – ClockworkSoul 03:18, 17 Apr 2005 (UTC)

RuneScape cheats
Your help with fixing the vandalism is very appreciated. Currently JAGex is trying to delete the article with an AFD recommendation. Please take a minute and comment on the talk page so that the article can be improved instead of removed.Jonathan888 (talk) 15:18, 22 November 2005 (UTC)

Block on 129.97.58.55
I unblocked 129.97.58.55, so you should be safe to log in again. Owen× ☎  19:01, 17 December 2005 (UTC)
 * Sorry about that, 48 hours was definitely excessive. // Pathoschild 00:06, 18 December 2005 (UTC)

User:68.171.249.212
He stopped vandalizing after you warned him. If he continues, issue a final (test3 or test4) warning and alert me. Thanks! Owen× ☎  00:20, 21 December 2005 (UTC)

malo's RfA
Revived, thanks for your support on my RFA. I was rather suprised at the overwhelming support I received. Thank you for your confidence in me. I hope that I'll live up to your expectations in the future as well. -- malo (tlk) (cntrbtns) 05:42, 21 December 2005 (UTC)

Charlie Wolf
I reverted the article back to the original text by Harry Alexander Glockler, following vandalism by User:81.96.2.3. Please may I restore this original text. 195.92.67.68 17:56, 21 December 2005 (UTC)

 * I've done it anyway. 195.92.67.71 23:40, 21 December 2005 (UTC)

CVU CfD
Category:User_Wikipedia/Counter Vandalism Unit, which is related to this article, has been nominated for deletion or renaming at Categories for deletion. You are encouraged to join the discussion.

Katie Holmes
Greetings! You have edited the Katie Holmes page in the past. I've completely reworked the article and have posted it on WP:PR in the hopes of advancing it to WP:FAC. I would be grateful for your comments at Peer review/Katie Holmes/archive1. PedanticallySpeaking 18:44, 9 February 2006 (UTC)

Semi-automated link sorting

 * This page was semi-automatically modified to sort links to Pathoschild in a meaningful way. // Pathoschild (admin / talk) 06:41, 13 February 2006 (UTC)

Hi & feedback requested
You welcomed me to Wikipedia last year with a note on my talk page. I was wondering if you have any specific feedback or suggestions for me, as we haven't corresponded since. Peter C Talk! 13:31, 24 May 2006 (UTC)

WP:CVU status
The Counter-Vandalism Unit project is under consideration to be moved to and/or  status. Another proposal is to delete or redirect the project. You have been identified as a project member and your input as to this matter would be welcomed at WT:CVU and at the deletion debate. Thank you! Delivered on behalf of xaosflux 16:26, 10 August 2007 (UTC)

uwstudent.org
Hey, we noticed that you added links to uwstudent.org to the Federation of Student article. It's a long shot, but do you know who ran this site? it seems to be gone now but we like to get in contact with them. Cheers! --Catologing UW's pranks and spirit throughout the years. spiritofwtf.com (talk) 20:13, 25 September 2011 (UTC)

ArbCom elections are now open!
MediaWiki message delivery (talk) 12:55, 23 November 2015 (UTC)

RC Patrol-related Proposals in the 2016 Community Wishlist Survey
Greetings Recent Changes Patrollers!

This is a one-time-only message to inform you about technical proposals related to Recent Changes Patrol in the 2016 Community Wishlist Survey that I think you may be interested in reviewing and perhaps even voting for:

 * 1) Adjust number of entries and days at Last unpatrolled
 * 2) Editor-focused central editing dashboard
 * 3) "Hide trusted users" checkbox option on watchlists and related/recent changes (RC) pages
 * 4) Real-Time Recent Changes App for Android
 * 5) Shortcut for patrollers to last changes list

Further, there are more than 20 proposals related to Watchlists in general that you may be interested in reviewing. (and over 260 proposals in all, across many aspects of wikis)

Thank you for your consideration. Please note that voting for proposals continues through December 12, 2016.

Note: You received this message because you have transcluded User wikipedia/RC Patrol (user box) on your user page. Since this message is "one-time-only" there is no opt out for future mailings.

Best regards, — Delivered: 01:09, 8 December 2016 (UTC)

title: User talk:Revived


text:
Rock music in Portugal

Rock music and its subgenres are very popular in Portugal. The history of the Portuguese rock music scene spans several decades.

1950s to 1970s
In the late 1950s, singer Joaquim Costa was one of the first rock artists, but it was only during the 1960s that the genre's popularity began rising, with bands such as "Quinteto Académico" and "Sheiks", who played mostly in clubs and student associations. Most of these groups played covers of American and British bands or were influenced by artists such as the Beatles and The Shadows. The rock scene's development was limited in its commercial and creative scope due to the country's isolation, which was under a fascist dictatorship until 1974.

During the 1970s, and particularly after democracy was established after the 1974 Carnation Revolution, Portugal became home to an active progressive rock scene, which included bands like Tantra, Petrus Castrus, Banda do Casaco and the highly successful Quarteto 1111. During the latter part of the decade, José Cid, Quarteto 1111's vocalist and keyboardist, pursued a solo career, releasing the landmark symphonic album 10,000 Anos Depois Entre Venus E Marte before turning to mainstream pop music. Portugal's progressive rock epoch came to a close with the release of Ascenção e Queda, a rock opera by Petrus Castrus. Most of these records remain in short supply to this date.

Until the end of the 1970s, Portuguese folk music and protest songs were generally the most popular types of music - but gradually more rock bands and styles began to appear, benefiting from the country's new-found openness.

1980s
Rock music finally hit the mainstream in 1980 with the release of Ar de Rock by Rui Veloso, which was the first popular Portuguese rock album.

During the 1980s, Veloso's blues-rock sound achieved national success and inspired the creation of several rock and roll bands, which became popular with youths growing up in the post-1974 modernized Portugal. The success of groups like Taxi, Heróis do Mar and Trabalhadores do Comércio,and UHF with CAVALOS DE CORRIDAN,indicated that a solid rock scene was growing, despite the fact that these were all relatively ephemeral projects.

Xutos & Pontapés are arguably the biggest success case in the Portuguese rock scene, having become the first band in the country to celebrate 30 years of career. Their early works had close roots to punk rock and rockabilly, but later incorporated hard rock and folk influences into their sound, becoming more diverse. UHF, another band that started in the early 80s, visually resembled the hard rock-playing hair bands that popped up in America and Europe - however, like Xutos, their sound was derived mainly from punk rock and folk influences.

Other major projects from this period include GNR, Roxigénio, Taxi and Peste & Sida, which turned to ska as an inspiration and would later switch to punk. GNR abandoned ska after two years when they changed vocalists, adopting poetic, and nonsensical lyrics, and a bigger use of synthpop sounds.

Heavy Metal began building up a following among the younger generation living and bands proliferated, especially in the North of the country. Few made it to the studio and those that did released mostly low budget singles. 1982 saw the first release of a Heavy Metal LP in the country, Forte e Feio by NZZN, but the production was poor and the record was not well received by critics. The late 1980s saw the rise of Tarantula, probably the first Portuguese Heavy Metal band with relevant impact outside the country.

During the mid-1980s, synthpop became even more prevalent in Portuguese rock, with the success of Sétima Legião and Heróis do Mar, which were heavily influenced by acts such as Joy Division, New Order, Depeche Mode and Gary Numan. Combining synthesized sounds and beats with Portuguese lyrics exalting the country's history, they attracted controversy and were accused of being political reactionaries and supportive of the extinct dictatorial regime. Heróis do Mar disbanded in 1990, but their momentum was taken over by other projects influenced not only by new wave, but also alternative rock and indie rock: Rádio Macau, Mler Ife Dada and Pop Dell'Arte, among others.

Punk rock remained mostly an underground phenomenon, although a circuit of venues and events in the country's major cities grew during this decade. Relevant punk bands to emerge during this period include Censurados, Mata Ratos and Peste & Sida.

Although most bands from this period were short-lived and none achieved international success, 1980's Portuguese rock was extremely diverse - each major band developed their own signature sound, and the national rock scene became very rich, spanning a wide variety of themes and styles.

1990s
The 1990s were also a very creative and active decade, with openness to new trends and a growth in the music market marked by the increasing popularity of international music festivals that attracted major rock bands to the country. A handful of major 1980s rock artists (such as Rui Veloso, GNR, Xutos & Pontapés) managed to maintain and grow their careers and fan bases.

This decade was notable for the rise of very active heavy metal, underground and alternative rock scenes.

Several major bands from the 1990s achieved both national and international success and were able to continue their careers into the 21st century, including Moonspell (an internationally renowned gothic / heavy metal band from Lisbon), Mão Morta (alternative and experimental rock project with a considerable cult following), Blasted Mechanism (a theatrical, sci-fi themed band that mixes rock with electronica, reggae and dub), Zen (alternative rock band), Ena Pá 2000 (a comedy rock outfit) and Da Weasel (a rock/hip-hop fusion band).

While some of the 1990s signature rock genres such as grunge, industrial rock and nu metal were very popular with Portuguese youngsters, few Portuguese bands fully adopted these styles and none achieved great success. Exceptions include Da Weasel (who incorporated elements of nu metal in their later albums), Blind Zero (pop/rock band that started out as a grunge outfit) and Bizarra Locomotiva (industrial metal band with a sizable cult following).

On the mainstream front (pop/rock), Quinta do Bill, a folk-rock group, achieved some notoriety, and two other bands rose to prominence: Silence 4, an English-singing pop/rock act from Leiria, and Ornatos Violeta, a Portuguese-singing rock band from Porto. Despite huge national success, critical acclaim (particularly for Ornatos Violeta) and lasting influence, both groups disbanded at the turn of the millennium.

2000s
Much like in other European and Anglo-American countries, the decade starting in 2001 saw the rise of hip-hop, dance music and more pop-oriented acts, with audiences for rock music dwindling.

Established bands who had begun their careers during the 1980s (Rui Veloso, Xutos & Pontapés) and 1990s (Moonspell, Blasted Mechanism, Mão Morta) maintained thriving careers, although the rock music scene became more fragmented and directed at niche markets. Some popular groups and projects surfaced: Toranja (pop/rock, Lisbon), Wraygunn (blues-rock collective from Coimbra) and Legendary Tiger Man (WrayGunn vocalist Paulo Furtado's solo project), and pop/rock acts influenced by electronic music such as Micro Audio Waves and Mesa. Clã, another Portuguese-singing pop/rock act who had surfaced in Porto during the mid-1990s, scored their biggest commercial hits during the 2000s decade.

2010s
The trend continued into the 2010s, with new bands appearing and playing in a variety of rock subgenres including pop/rock (Amor Electro, Diabo na Cruz, Capitão Fausto, and Salvador Sobral's band Alexander Search), blues-rock (Black Mamba), alternative and indie rock (PAUS, peixe : avião, Linda Martini, WhosPuto), as well as heavy metal (Serrabulho, Okkultist). This decade also saw a niche revival of psychedelic and stoner rock with artists like Black Wizards, The Quartet of Woah! and krautrock-influenced band 10000 Russos.

title: Rock music in Portugal


text:
Talk:Boyer–Moore string-search algorithm

Second Table
The second table is poorly explained and may be incorrect. Can anyone look into this see if its done correctly on this page? Or better describe it. I have reread the description several times and still can't figure it out. Is the table correct?

 * No its not correct, I'm about to correct it right now -- Hurda

 * I have to disagree here, the original version was correct, it should be reverted. Consider the following scenario - you are looking for "ANPANMAN" in "xxxxAMANPANMANyy":

xxxxAMANPANMANyy ANPANMAN
 * If you now shift by 8 characters (as the current version of the second table says), you'll miss:

xxxxAMANPANMANyy ANPANMAN
 * The previous version of the second table correctly suggests shift by 6 characters leading to a find:

xxxxAMANPANMANyy ANPANMAN —Preceding unsigned comment added by 82.100.5.250 (talk) 22:37, 13 July 2008 (UTC)

 * Oki My fault, I did not notice this, I have reverted the changes --Hurda

Concrete Examples of second table
For the sake of newbies and clearity, I think that you should include a concrete example showing the search string and the text being searched for the string. The ANPANMAN example isn't clearly showing the formation of the second table. I am trying to clearly understand it, maybe I'll add the example.

First Table
''The first table ($$\delta_1$$) gives the next offset at which a match could possibly occur given the last (nonmatching) character encountered while comparing the pattern with the text; the second ($$\delta_2$$) gives a similar offset based on the number of characters that matched correctly. When a mismatch occurs, the largest of these two values is used to skip ahead to the next position where a match could potentially occur.''

 * Does anyone know the reason that the somewhat obscure references of $$\delta_1$$ and $$\delta_2$$ are used here? Were those perhaps the way they were referenced in the original publications about the algorithm?  I'm replacing this text with a (hopefully!) more straightforward explanation but I'm wondering why they were referenced that way. -- Antaeus Feldspar 05:04, 19 Dec 2004 (UTC)

 * Yes $$\delta_1$$ and $$\delta_2$$ are the names a lot of technical papers give to these functions. -- 14:03, 13 Feb 2007 (UTC)

who and when

 * Does anyone know when the Boyer-Moore algorithm was first published, so we can state it? I added the full names of Boyer and Moore. RJFJR 03:16, Jan 12, 2005 (UTC)

Yes, 1977. See R. BOYER AND S. MOORE, A fast string matching algorithm, CACM, 20 (1977), pp. 762-772.

What about Gosper? Sedgewick, in "Algorithms" says Gosper independently invented it at about the same time. I've occasionally heard the algorithm called Boyer-Moore-Gosper. Anyone know more? 203.164.223.88 11:05, 17 December 2006 (UTC)

No need for the second jump table.

 * Please refer to http://www.movsd.com/bm.htm -- 83.237.28.135 2005-05-02 16:33:20
 * The version without the second table is the Boyer-Moore-Horspool algorithm. The real Boyer-Moore algorithm requires both tables. --Bisqwit 11:01, 22 May 2006 (UTC)
 * Are you sure you don't mean "without the FIRST table"? I think the Horspool algorithm (looking at the code in that article) only uses the simpler character position table. If I'm right, we should correct the article (Variants section) Raduberinde (talk) 23:36, 17 August 2010 (UTC)

Worse-case performance is contradictory: Reference for 3n complexity proof
I cannot find the paper that proves it online, however http://www.cs.nyu.edu/cs/faculty/cole/papers/CHPZ95.ps refers to it. Someone may wish to edit the page to provide that information.
 * The only online sources for the 1991 paper I could find required payment, but the CHPZ295.ps paper does have this information:
 * that in 1977 it was shown that the Boyer-Moore algorithm (BM) makes at most 6n comparisions, this was reduced to 4n in 1980 by Guibas and Odlyzko (ref GO80), and that in 1991 Cole et al had further proven the upper bound to be $$3n - \Omega (n / m)$$. I don't understand the omega notation in this form. It goes on to cite paoers that show simple variants of BM have upper bounds of 2n. GO80 is A new proof of the linearity of the Boyer-Moore string searching algorithm, SIAM Journal of Computing 9 (1980) p672-682. And when I expanded the article's 3*N paragraph I noticed the preceeding paragraph talks about N*M which looks wrong, and contradicts the 3*N. -Wikibob 05:23, 18 December 2005 (UTC)

See the following two lines in the article:

"The worst-case performance of the algorithm to find all matches is approximately N*M."

and

"The worst-case to find all occurrences in a text needs approximately 3*N comparisons, hence the complexity is O(n), regardless whether the text contains a match or not."

I believe that, depending on the period of the pattern x, each of the above statements is true. If period(x) > |x|/2, then the worst case is O(3N) -> O(N). Otherwise, the worst case is O(N*M). I haven't posted this to the article page yet because I'm still learning about the algorithm. --Tekhnofiend 21:46, 2 December 2006 (UTC)

I beleive that the original paper has the good suffix rule correctly (strong form it is called in the wikipedia text), that is what is needed for linearity. Here is an excerpt from the paper:

"Roughly speaking, we can generalize the kind of reasoning used above and slide pat down by some amount so that the discovered occurence of subpat in string is aligned with the rightmost occurence of subpat in pat which is not preceded by the character preceding its terminal occurence in pat."

(See section 2 second column, third para on page 763 in Communications of the ACM Volume 20 Number 10, October 1977)

The above was in the introductory section for the algorithm. In section 4 (page 765, left column, first para) a definition using strict mathematical notation says:

"[pat(j+1) ... pat(patlen)] and [pat(k) ... pat(k + patlen - j - 1)] unify and either k <= 1 or pat(k - 1) not equal to pat(j)" (not equal with a sign in the original)

Appears completely matching the strong good suffix rule regarding the difference of the unmatched character. My suspicion is that someone made a mistake in an implementation and that started this rumor about the original paper having it wrong. I plan to make the correction, please comment here if you think I missed something.--Sustik (talk) 01:26, 3 February 2010 (UTC)

 * It is my understanding that Boyer-Moore runs in $$O(nm)$$ time in the worst case - consider a pattern and text which both consist of the same repeated character. The pattern will then shift by only one index between each phase, and all characters in the pattern will be explicitly checked for equality every phase. The $$O(nm)$$ limit is explicitly stated in the textbook Algorithms on Strings, Trees, and Sequences by Dan Gusfield in chapter 2. In chapter 3 it is explained that the comparison operation is made more efficient using the Apostolico-Giancarlo algorithm, which provably makes $$2m$$ comparisons in the worst case. Pending an in-depth look at the Boyer-Moore implementation described here, I will edit the article to reflect this information; it is my understanding the linear-time limits were only proved when the pattern does not occur in the text.

 * Andrew Helwer (talk) 18:43, 2 April 2012 (UTC)

 * In a 2010 book by Knuth "Selected Papers on Design of Algorithms" Chapter 9 it is not completely clear but I believe the text should be interpreted as: If there is no match, or if you only report the first occurrence of a match, then the algorithm runs in worst-case linear time. If you report all occurrences of a match then the worst case is quadratic. The distinction between first occurrence and all occurrences may be why there is some confusion. Aureooms (talk) 20:34, 12 May 2021 (UTC)

Wikipedia self-reference
I'm thinking that "WIKIPEDIA" should not be used as an example string, for the purpose of avoiding self-references. ~ Booyabazooka 20:06, 4 April 2006 (UTC)

Would be nice to have both example tables use the same word. 12.150.184.6 16:58, 10 April 2006 (UTC)
 * I agree that WIKIPEDIA should not be used as an example word, but that we should use the same word throughout. I'll fix it. Deco 06:03, 28 May 2006 (UTC)

About the example code
The example code I wrote on this page (the one with boyermoore_needlematch function) is quite slow.

I created it by literally translating the specs (the explanation how the algorithm works) into C code. I'm afraid it does not satisfy readers who are in search of a fast search algorithm example code. I would like it to be replaced with a code that is fast, but that is not unreadable.

The suffixes and preBmGs functions at are very obfuscated in my opinion; they (and derivatives thereof) are not suitable for example code.

Is it possible to come up with a reasonably fast example that is not obfuscated? For comparison, the code at Boyer-Moore-Horspool algorithm is quite simple. It is this extra step, i.e. calculation of the "skip" array that is at question. --Bisqwit 08:59, 11 December 2006 (UTC)

The python example code is wrong. For some inputs it doesn't have correct output and also its worst time complexity is O(nm) and not O(n+m). The galils rule is not implemented correctly. — Preceding unsigned comment added by 188.167.15.119 (talk) 21:20, 24 November 2016 (UTC)

better way to explain
I think the Boyer-Moore algorithm might be easier to understand if we: And finally summarize it by --68.0.120.35 14:49, 22 March 2007 (UTC)
 * explain how the first table works all by itself, Skip1 -- the Boyer-Moore-Horspool algorithm
 * explain how the second table works all by itself, Skip2 -- (or would it work all by itself? Is there a name for this algorithm? I suspect it might work well for searching bit-sequences or DNA base-pair sequences)
 * the Boyer-Moore algorithm, whenever it hits a mismatch, skips ahead the *maximum* of Skip1 and Skip2 (since all shorter skips have been ruled out).

First Table
Shouldn't the value of N be 3 in the first table in the article? If it's zero, then you get an infinite loop.

Sorry mangled text

Revised example programs
I revised the example functions for the Boyer-Moore and the Boyer-Moore-Horspool search algorithms and added a Turbo-Boyer-Moore example. However, I believe this code requires some refitting before it is suitable for an educational example. These are written in C++, and are fairly optimal. I have tested them extensively to ensure they produce correct results. --Bisqwit 08:27, 21 August 2007 (UTC)

Multiple byte character sets?
The example implementation in the article uses an auto-allocated array called occ to hold the first table. But how big will occ be for a string encoded in UTF-16 or UTF-32? Should the article clarify that the example is intended for use with 8-bit encodings? I'd imagine that occ would have to be an associative array in such cases because it will be filled so sparsely. --Damian Yerrick (talk | stalk) 21:55, 28 December 2007 (UTC)
 * That is a valid point. In 16-bit or 32-bit implementations, I would probably use an associative array of 256-element arrays, i.e. something like this:

 * For the reason that even in multilanguage content, characters tend to be clustered around some particular region of unicode. (For example, in Russian text; most of the symbols fall to the cyrillic range.) Then again, how effective is Boyer-Moore multibyte situations? --Bisqwit (talk) 09:18, 2 January 2008 (UTC)

memset
It appears that the behavior of  from the C standard library isn't well defined across platforms except edited the sample code to use  to fill an array of ssize_t objects with -1 values. This is not portable, and reverted the edit. Two months later, Thegeneralguy made the same change again, and I reverted it again. I guess Thegeneralguy's rationale for the changes is option 3:  with fill value of -1 works on most widespread 16-, 32-, and 64-bit platforms, all of which use a two's complement representation for <tt>ssize_t</tt>.
 * 1) when filling memory with a value of 0,
 * 2) when filling arrays of <tt>signed char</tt> or <tt>unsigned char</tt>, or
 * 3) when your platform's ABI guarantees that a type has a specific representation.

So here's my question: Do we require strictly conforming C, or do we relax C and assume two's complement? I propose we use ISO C, which works everywhere and is easier to understand, as opposed to what I view as premature optimization. --Damian Yerrick (talk | stalk) 23:23, 7 March 2008 (UTC)

Now that you bring this up (I was unaware of this portability issue) I would be in favor of removing memset. However, memset is not premature optimization in the sense that something like this (filling up memory with a particular value) is the purpose of memset;  should probably be used if it is decided to be used. If there is a wikipedia policy on this default to that.Thegeneralguy (talk) 23:46, 7 March 2008 (UTC)

I think the point of example code is to document the algorithm, and in my opinion, a for loop documents the purpose (setting each element of the array to some integer value) better than memset (setting each byte on a memory area to some byte value) does. That said, has anyone had a look at the replacement example code posted on this talk page? --Bisqwit (talk) 13:54, 11 March 2008 (UTC)

Correct code?
Is this code actually correct? It looks pretty buggy (or, at best, relies on a lucky bug to be functional). It isn't referenced--isn't it WP:OR and/or WP:NOT, then? -- Mikeblas (talk) 15:38, 4 May 2008 (UTC)
 * Can you please elaborate on what in it looks "pretty buggy" and what is the "lucky bug" it relies on? I wrote it based on the explanation in the article. A replacement suggestion is provided on this talk page, but nobody has commented on it. :-/ --Bisqwit (talk) 22:26, 4 May 2008 (UTC)
 * I've removed the implementation since it's your own creation and therefore OR. The bug involves sign wrapping in the matching loop, and the exit condition for that loop. I'm sorry it took so long for me to come back to the article... -- Mikeblas (talk) 23:57, 11 January 2009 (UTC)
 * I'm shocked at this definition of "original research". So for the purposes of teaching and demonstrating, one cannot use their own words to put into phrases (and in this case, code) to effectively explain it to Wikipedia readers, if that particular phrase (or code) does not exist anywhere in the web? Yet, simultaneously, one cannot verbatim-quote articles from other sites, because that would a copyright violation. There is a contradiction. I'm also not convinced of the existence of the "bug". Even after you wrote that, I checked the code and I cannot find evidence of what you claim. --Bisqwit (talk) 09:17, 13 January 2009 (UTC)
 * I'm sorry that you're surprised. You can read about the policies at WP:OR and WP:V, and kind of at WP:REF. -- Mikeblas (talk) 21:53, 13 January 2009 (UTC)
 * Here's how I see it: the code is there to illustrate the algorithm, and there are lots of user-made illustrations in Wikipedia, so including them is obviously generally accepted. But the claim that this code correctly implements the algorithm is original research - no reliable source supports this claim. While it's of course very useful to find a working implementation directly on the Wikipedia page, without having to follow the external links, I feel WP is not right the place to publish such things. I'd prefer having only an explanation and pseudocode (the latter can be cited from a textbook or a paper) in the article. A correct implementation would then be found by following external links. Offliner (talk) 02:14, 14 January 2009 (UTC)
 * Unfortunately, illustrations are granted special leeway. That leeway hasn't been challenged, and might be restricted soon because anyone can draw anything and say that it's what it is not. -- Mikeblas (talk) 17:03, 14 January 2009 (UTC)
 * What's the difference if i put my example code up here or on my webpage and then put it up here as reference? It's true, wikipedia starts to get useless with it's pseudo-policies. --188.99.93.231 (talk) 23:48, 13 December 2009 (UTC)

 * I just implemented the actual given code in java and it definitly returns the correct results. But I figured out that the given code is not implemented correctly. result[i] = size; should be result[i] = -1; (size_t is an unsigned int, so it should be at least result[i] = 0;)

 * Me Checked the code again and it must definitefly be result[i] -1, but now size_t must be changed to int. (Alternative: set to 0 and i+1, all other references must take care of that) —Preceding unsigned comment added by 155.56.68.215 (talk) 11:27, 28 May 2010 (UTC)
 * Quite right: by using size instead of -1, a random pair of strings I tested locally required 50% more comparisons than the correct algorithm. I believe that the incorrect algorithm was O(m*n), not O(n). I've corrected the sample code, and converted size_t's to int's where necessary. Alex.mccarthy (talk) 22:49, 15 June 2010 (UTC)
 * The article text speaks of setting the "other" characters to the length of the string, not -1. It would help understanding if the code reflected the article, or at least if there was an explanation why -1 works instead of the string length. kostmo (talk) 03:38, 9 September 2010 (UTC)

 * The problem with this code is that it doesn't produce the same result as listed in the article itself. Working through this manually reveals that the ANPANMAN example with this code as written would yield the following results:

The question is, which gets corrected, the code or the table, or both? Shyran (talk) 15:19, 19 October 2010 (UTC)

Agreed - the code produces a different table than the article describes, which is very confusing. I believe the code creates an equivalent table to the table (I've seen this done in other BM implementations) described in the article:

You'll see the tables are equivalent in that the "value from one table" == ("search string length" - 1 - "value in the other table"). Apparently except for 'N', which may indicate a bug in the code.

Its very confusing for the code to not match the article. The code should be an exemplar of the algorithm as described in the article, not an optimized variation of the algorithm. The article either needs to explain the deviation in the code or the code should be modified to be match the algorithm as described in the article. Aff0 (talk) 00:35, 31 January 2011 (UTC)

First table...?
This looks wrong to me (am preparing for an exam, but it goes against what I've read elsewhere).

Could someone check it? 131.111.1.66 (talk) 16:55, 4 May 2009 (UTC)

The paragraph just before the table sections introduce the tables: "one table calculates ...; the other makes ...." However, I believe the tables are described in detail in the subsequent sections in the opposite order then they were just introduced, i.e. the first table mentioned in the introducing paragraph above ("one table calculates ...") is actually the second table described in section entitled "The Second Table" and the second table mentioned in the introducing paragraph above ("the other makes ...") is the first table. If I'm correct about this, then this is especially confusing since the tables are identified as first and second rather than by more descriptive labels like "good suffix shift table" or "bad character shift table". — Preceding unsigned comment added by Aff0 (talk • contribs) 00:48, 31 January 2011 (UTC)

Key or Needle
The article should use the same term throughout, now it uses key in the introduction and later uses needle without introducing the term. (I like needle better) —Preceding unsigned comment added by 85.230.77.206 (talk) 09:30, 30 March 2010 (UTC)

Alternate algorithms that preprocess the target.
"unlike some algorithms that preprocess the string to be searched and can then amortize the expense of the preprocessing by searching repeatedly"

Can we link to an example of such an algorithm, for completeness? RJFJR (talk) 16:39, 17 August 2010 (UTC)

 * Sure! A good example is the Suffix tree. I'll add it in.
 * Andrew Helwer (talk) 18:09, 2 April 2012 (UTC)
 * Andrew Helwer (talk) 18:09, 2 April 2012 (UTC)

O(n/m) != "sub-linear"
O(n/m), where `n` is the length of the haystack and `m` is the length of the needle, is still linear in `n`. Rewording the initial paragraph so as not to be wrong. —Preceding unsigned comment added by Jemfinch (talk • contribs) 17:09, 23 August 2010 (UTC)

Fast BM implementation (including closed source and commercial).
I am doing benchmark of substring search algorithms (at volnitsky.com/project/str_search) and BM looks quite slow. Does anyone knows where to find faster BM implementation(s)? BTW, BM C source posted here is incorrect - returns wrong results if compiled with optimization ( gcc-4.5.1). — Preceding unsigned comment added by Leonid Volnitsky (talk • contribs) 09:36, 2 February 2011 (UTC)

Python version
Can be found at:

http://code.activestate.com/recipes/117223-boyer-moore-horspool-string-searching/

Python
(code is released under the PSF license (http://www.opensource.org/licenses/Python-2.0)

Ooops, sorry this is the Boyer Moore Horspool algorithm. Will move this to that page. — Preceding unsigned comment added by 64.251.74.12 (talk) 21:14, 21 July 2011 (UTC)

Miscellaneous gripes
The 'fast' implementation outlined in the original paper really should be mentioned on this page, as well as Hume and Sunday's improvements to delta1 in "Fast String Searching". The code from the October edit is mine, by the way. I'll be slowly merging the comments into the main body (I think that needs an overhaul, too). I just thought the page urgently needed something...erm, correct on it.

The previous algorithm was a) confusing and inefficient. Why was the search pattern being reversed? Was the original author trying to reuse code from a KMP implementation? There's a comment in the middle that indicates confusion over how (if?) the algorithm works. Does it? b) flat out wrong in at least one place. The delta1 offset is relative to the *offset* (in the old implementation, s+j or whatever), not the start of the potential match (s). The implementation in the original paper doesn't even bother keeping track of the start - it's not necessary. Consider the example search text .....LTT-THAT and search pattern TT-THAT

TT-THAT .....LTT-THAT

T will match, then A != L, and L does not occur in the pattern, so delta1[L] is 7 (length of TT-THAT). The algorithm should move the text 7 relative to the mismatched character (i.e. 6 relative to the start of the block), not the start of the block. You can see here that moving 7 relative to the start will move past a valid match.

Source 2 (movsd) seems...extremely seedy. I don't trust a website that can mix up the names for the bad character rule and good suffix rule. The site also doesn't adequately explain what you are supposed to do if your search pattern has repeated sequences where the repeated block is more than one character long (surely a very, very, very rare case). In fact, I'm tempted to write off the entire page as wholly unreliable, and carefully review any content on this page that seemed to be derived from it (so far, it seems like most of the wiki article). Good grief.

Wikipedia is an encyclopedia, not an algorithms cookbook. I request that people looking to edit the code make sure they don't break anything in the name of "efficiency". Also, if the edit is for efficiency, make sure it's actually, well, more efficient. At the very least, make sure your edits increase or at least maintain clarity.

Reverted 3 changes in the delta2 table construction from user Snowgene. is_prefix does not always return true (obviously, not every suffix of the pattern is a prefix), so last_prefix_index may very well get "fixed" at a previous value p. That is, the p in last_prefix_index = p+1 is not necessarily the p where delta2[p] = last_prefix_index + (patlen-1 - p).

Jy2wong (talk) 12:18, 17 October 2011 (UTC)jy2wong

I rewrote the majority of the article
What are your thoughts? I think it is a bit more clear now. I used ideas from Dan Gusfield's book Algorithms on Strings, Trees, and Sequences. I also added more citations, and put the Performance section on strong theoretical ground - previously there were some pretty big misconceptions about runtimes vis a vis pattern occurring in the text or not.

Any suggestions, criticism? This is my first large-scale edit! Andrew Helwer (talk) 03:56, 8 April 2012 (UTC)

While the article is technically correct it doesn't explicitly state the key insight of the algorithm. The insight the algorithm offers is to look at the end of the pattern, and then skip quickly through the text using information obtained from the pattern in making jumps along the text. The first diagram in the article shows the brute force method, which serves to confuse. I've made some additions to the article. They are clumsy and additional editing is welcomed. Kd4ttc (talk) 17:14, 27 January 2014 (UTC)

Algorithm tweak in Java section
I added a minor tweak for correctness to the Java section. In theory, if you only consider the 'bad character table,' you have the Boyer-Moore-Horspool algorithm, however as it stands, the Java section is incomplete, and even enters infinite loops on some trivial examples. This stems from using the variable i both as the alignment index and as the cursor for checking characters. For example, if the haystack is "ab ab abc def" and the needle is "xy abc" the program gets caught infinitely looping, because it forgets that it has already checked the potential match ending at abc and it tries to match it again, succeeds for 4 characters, fails, then hops back to where it started. The k in the outer loop retains this information that is otherwise lost by decrementing the variable.

I am almost certain that the shift from the offset table will always be larger in such cases, but it seems to me that for correctness sake, that shouldn't be assumed unless it is explicitly stated in comments or in the article. For instance, I was trying to build up my understanding of the algorithm by programming it piecemeal and testing as I went along. I was quite puzzled when my incomplete BM algorithm (though complete BMH, as far as I knew) worked in some cases, but froze in others. For that reason, I decided to fix this code (At least in the Java section.)

Bill Lava (talk) 04:46, 20 August 2012 (UTC)

C data types
The choice of data types for the C implementation is rather odd, to say the least. There is no reason to be using exact-bit-width types here; the architecturally natural (fundamental) integer types should be used instead. 121a0012 (talk) 07:36, 18 January 2013 (UTC)

 * The C and Java implementations were present before I came across this article, so I just left them there. They are untested (or don't work at all) for all I know. I personally wrote (and extensively tested, see here: https://github.com/ahelwer/IvoryTower) the Python implementation, so I'm available to answer any questions you might have about it. Andrew Helwer (talk) 06:20, 23 January 2013 (UTC)

 * Actually from a quick look at both the C and Java implementations, the preprocessing is not done in steps linear in the length of the pattern, but rather quadratic. This is due to use of the suffix length function... it isn't canonical Boyer-Moore, which preprocesses the pattern in linear time. On other other hand if your pattern is sufficiently short you may not care too much, as making the preprocess run in linear time adds a ton of complexity (see the Python implementation). Preprocessing for the bad suffix rule in linear time is so complicated I left the description out of the article, as it could pretty much have an article to itself. Andrew Helwer (talk) 06:30, 23 January 2013 (UTC)

Typo?
"A match or occurrence of P occurs at an alignment if P is equivalent to T[(k-n+1)..k]."

Shouldn't that be ?

No, because the length of the pattern is n. Length of the text is m.

Bug in python code
There is a bug inside the python code which I cannot figure out by myself. If I search for pattern "abcabba" in text "abaabcabbababbcababa" it won't find the only occurence at position 3 (starting with index 0). It just returns an empty list. Unfortunately I have no idea where to correct the code. SeriousPlaygrounder (talk) 19:31, 23 June 2014 (UTC)
 * Thanks for the bug report, I'll look into this. Andrew Helwer (talk) 00:54, 2 August 2014 (UTC)
 * Just confirmed & reproduced on my end. Will debug this weekend. Andrew Helwer (talk) 01:30, 21 February 2015 (UTC)

 * The right code for good suffix table like that. Edited by tr0217@163.com.
 * I believe that this bug has been fixed with the change I've made to fix an off-by-one error. I've submitted a pull request here: https://github.com/ahelwer/WikiCode, as all of the tests now pass, including the one demonstrating the bug described here. Joshthewall (talk) 13:43, 16 April 2020 (UTC)

A bug has been identified and fixed in function "fundamental_preprocess" at 15:15, 11 May 2016 (UTC).--Libo.yin.1 (talk) 08:17, 12 May 2016 (UTC)

The Good Suffix Rule
In the last section (second to last sentence) of the 'Description' subheading it is stated that:

"If an occurrence of P is found, then shift P by the least amount so that a proper prefix of the shifted P matches a suffix of the occurrence of P in T."

The word 'proper' is italicised; so I assume a 'proper prefix' is different in some way to your standard, run of the mill prefix. The article does not specify what this difference might be or if indeed there is a difference at all. Could this be clarified?

JPAIvan (talk) 23:22, 19 July 2014 (UTC)

 * The proper prefix of a string is a prefix which is not equal to the string itself, similar to the definition of a proper subset. This should perhaps be defined in-article. Andrew Helwer (talk) 00:56, 2 August 2014 (UTC)

Does this algorithm work for alphabet size 2?
See Alpha Skip Search, Combinatorial Pattern Matching 1998, for an algorithm that also works on base two, text length N, pattern length M, with average runtime of O( (N/M + M)logM ), with log base alphabet size.

Preprocess the pattern by creating a lookup table of M-logM+1 keys of positions in the pattern, where each key is a sequence of logM letters in the pattern. time O(MlogM).

Main: Skip through the text by length M-logM+1, trying to match key of size logM to the lookup table. If it is in the lookup table, try matching the pattern naively, at the indicated start position.

Often the key will not even be in the lookup table, in which case the algorithm just skips over M-logM+1 letters of the text and tries again. The expected running time is O( (N/M)logM ), even for alphabets of size 2. Daniel Pehoushek 24.33.70.144 (talk) 19:10, 24 August 2014 (UTC)

Good Suffix Rule Description
The description says "... It is the reason comparisons begin at the end of the pattern rather than the start ..."

IMHO this is misleading. The comparison also begins at the end rather than the start to enable the 'Bad Character Rule' to work. So, IMHO, it is misleading to say "It is the reason comparisons ..." in the context of "Good Suffix"; the entire algorithm would be much less efficient, and arguably not recognisable as Boyer-Moore without "comparisons begin at the end".

As further evidence, the Boyer–Moore–Horspool algorithm _only_ uses the 'Bad Character" rule and its table.

It might be reasonable to write something like: "The good suffix rule is markedly more complex in both concept and implementation than the bad character rule. Like the 'Bad Character Rule', it also exploits the algorithm's feature of comparisons beginning at the end of the pattern and proceeding towards the pattern's start ..."

Gbulmeruk (talk) 11:29, 17 November 2015 (UTC)

Misleading description of bad character rule
The article describes what is called "extended bad character rule", not the basic "bad character rule" (see the original paper, and the book https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm#cite_note-ASTS-3 cited in the article). Perhaps this should be clarified.

BartoszKP (talk) 11:29, 4 December 2016 (UTC)

I agree, the Preprocessing section describes an algorithm that differs from the ones provided in the implementation examples, and one that will give results invalidated by the good suffix rule. This ties in to the need to explain Boyer-Moore-Horspool; first provide the extended bad character rule and make it stand on its own, then explain how switches on this version can lead to alignments that would have been ignored should the good suffix rule be applied and provide the basic bad character rule for the Boyer-Moore version. — Preceding unsigned comment added by 109.26.232.78 (talk) 09:39, 6 June 2019 (UTC)

The Galil rule
"Thus if the comparisons get down to position k1 of T, an occurrence of P can be recorded without explicitly comparing past k1."

Why? And what does it mean "past k1"? Aren't we scanning from the end? This whole section is mighty confusing... Can anyone explain it clearly without leaving room for imagination? --84.245.121.159 (talk) 23:56, 18 November 2020 (UTC)

Python Code is incorrect
The Python Code for this algo is incorrect.

```>>> from Wiki import string_search

>>> from BMAlgo import BMA

>>> with open("test2.txt", 'r', errors = 'ignore') as f:

...     strs = f.read

...     A = BMA(strs, "caba")

...     B = string_search('caba', strs)

...     print(A)

...     print(B)

...     print(A == B)

...

[12168657]

[12168657, 12781460]

False

>>> strs[12168657: 12168657 + 4]

'caba'

>>> strs[12781460: 12781460 + 4]

'aaba'

>>>``` Bamgm14 (talk) 03:47, 5 April 2024 (UTC)


text:
Wikipedia:Articles for deletion/Knots in Polish mythology

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was delete. -- AllyUnion (talk) 09:02, 21 Feb 2005 (UTC)

Knots in Polish mythology
Found this orphaned, old VfD nomination when cleaning up related entries in /Old. It seems this was never linked from the main VfD page, so here it is again. No vote. jni 09:49, 10 Feb 2005 (UTC)

 * Delete - there is no such thing as Polish mythology and this seems like some new age rubbish. [[User:Halibutt|Halibutt]] 05:06, Dec 19, 2004 (UTC)
 * Comment - I know little about Slvic mythology - or Polish, for that matter (even through I am Polish and love fantasy). As far I can tell, Halibutt is right. For an even more idiotic entry, see Threshold in Polish mythology. Now that is 100% rubbish, as far as I can tell. --Piotr Konieczny aka Prokonsul Piotrus Talk 23:50, 2 Feb 2005 (UTC)
 * Delete. As far as I know, (willow-)knots are more or less important in folklore in general, but not specifically in Polish mythology. Lectonar 12:36, 10 Feb 2005 (UTC)
 * Delete, codswallop. Wyss 19:53, 10 Feb 2005 (UTC)
 * Delete, nonsense. Article as it stands is un-encyclopaedic. Megan1967 02:19, 11 Feb 2005 (UTC)

This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text:
Talk:J. Thomas Looney

Untitled
My only problem is with the "bravely." Otherwise, except, I suppose, for the bizarrely archaic prose, I don't have any problem with this article. Hydriotaphia 05:07, Dec 19, 2004 (UTC)

I agree that "bravely" displays a bias best ommitted, and I have revised accordingly. Other than that, I fail to understand the nature of the objections to the entry. Perhaps those who flagged the article would be kind enough to indicate the nature of the alleged problems. To me the article, aside from the one misplaced adjective, is scrupulously objective. I'd be happy to work further on the article if needed.--BenJonson 00:24, 20 Feb 2005 (UTC)

Apart from a rather excessive interest in praising various Novocastrian libraries, I can't see what's NPOV about this article. Paul B 11.28, 20 Mar (UTC)

I have noted the last point and removed the first Lit and Phil reference.author: Emmet 3.52, 8 May

Does this article really need to be disputed? Seems fine to me? User:mattsday 12:52, May 22, 2005 (UTC)

Today I edited this page to read "teacher and scholar." Without comment, someone silently edited out the word "scholar." I'd like to know why. What is so threatening about acknowleding Looney as a scholar? Also, I added a reference to Looney's critical role in 1921, with Sir George Greenwood, the author of a half dozen or more books on the Shakespearean question and a british MP active in the India Independence campaign, in founding the Shakespeare Fellowship. I respectfully request that whoever removed these edits without comment justify their reasons for doing so. Thanks.--BenJonson 03:26, 4 May 2007 (UTC)

its unique system of operation
What was this unique system and how did it help? It's not in the library's page, either. (fotoguzzi) 69.64.235.42 (talk) 21:11, 6 April 2010 (UTC)

This page was mentioned in the news...
http://www.guardian.co.uk/film/2011/nov/04/anonymous-shakespeare-film-roland-emmerich --- Wrad (talk) 23:54, 19 November 2011 (UTC)

 * This review is already a ref in the article (ref #3), but perhaps there ought to be a para on Anonymous? --GuillaumeTell 22:39, 20 November 2011 (UTC)

 * "Though you won't find this on his Wikipedia page, Looney was a priest in a cultish Victorian religious group called the 'Church of Humanity' in Newcastle" It's a pity that Shapiro's comments about this article are not even accurate. It would have been nice if he'd bothered to read it first! That information was in the article a for nigh-on a year and a half before he wrote those words. Paul B (talk) 13:48, 21 November 2011 (UTC)

Pronunciation
I've removed the reference to the pronunciation being "Loney". Having spoken to his relatives, I know this to be false, but of course cannot include what I "know" in the article. However, the claim is apparently traceable to a 1972 article by Charles Wisner Barrell, and has been challenged by Irvin Leigh Matus (see here). Therefore it should not be presented as fact. Paul B (talk) 16:19, 10 December 2011 (UTC)
 * Actually, it should be noted within the article that the pronunciation is disputed, providing both citations. We let the reader make up their own minds; we do not make it up for them. - Jack Sebastian (talk) 06:42, 11 December 2011 (UTC)
 * I didn't make it for them did I? I removed an assertion that it is pronounced in a particular way. I didn't replace it with an assertion that it is really pronounced any other way. It would be possible to have a section discussing the "issue", but I hardly think there's enough material. Paul B (talk) 12:06, 12 December 2011 (UTC)
 * When a claim appears in the literature that we are sure is wrong, it is a perfectly normal editorial decision to suppress it. The purpose of an encyclopedia is to compress information, not to build a huge heap of needles where nobody can find the hay. However, if an apparently incorrect claim is relatively popular, there should be a footnote making it clear that we haven't overlooked it, or in some cases even a detailed discussion. In practice this is sometimes impossible because the reason we are sure it's wrong isn't citable, and apart from that there is only the silence on the matter in the reliable sources that get it right. But then, if the reliable sources think it's not worth debunking explicitly, then it may be a good idea to follow them. Hans Adler 12:25, 12 December 2011 (UTC)
 * A little aid for the pronunciation: LOONEY BY NAME, LOONEY BY NATURE.DMC (talk) 07:39, 11 July 2012 (UTC)

title: Talk:J. Thomas Looney


text:
Kaupo, Hawaii

Kaupō is a district of ancient Hawaii (moku in the Hawaiian language) of Maui island in Hawaii. Kaupō is a remote, sparsely populated, sustainable ranching community.

Geography
Kaupō is located along the southeastern shore of Maui, west of Kīpahulu along the Kahikinui coastline. Kaupō is located on a rugged and desolate coast. The Kahikinui Forest Reserve is located in the area, as well as a section of Haleakalā National Park. A trail leads from near the summit of Haleakalā through Kaupō Gap to the coast.

Kaupō is connected to the rest of the island via the Pi'ilani Highway (Hawaii Route 31). The highway is primarily one lane wide and is not paved in all sections.

History
Kaupō was "Wahipana" (Special Place) for ancient Hawaiians. In the early 1900s many families lived in Kaupō. Fishing, farming, hunting and ranching were primary occupations. In 1859 the district was combined with that of Hana.

The Loaloa Heiau and Huialoha Church are located there.

Education
Residents are served by public schools of the Hawaii Department of Education (HIDOE).

Kaupo School served the community from its 1923 opening until the 1960s. By 1964 the number of students was five, so the HIDOE closed the school with Hana High and Elementary School in Hana taking the students. The school reopened in circa 1982 as some landslides that happened that year obstructed the road to Hana. Kaupo School later closed when the road reopened.

title: Kaupo, Hawaii


text:
Caupo of Turaida

Caupo of Turaida, Kaupo or Kaupo Lieven, sometimes Kubbe (died 21 September 1217) was a leader of the Finnic-speaking Livonian people in the beginning of the 13th century, in what are now parts of Latvia and Estonia by the Gulf of Riga. He is sometimes called a 'King of Livonia', the Chronicle of Henry of Livonia refers to him as quasi rex, 'like a king'.

Biography
Caupo was the first prominent Livonian to be christened. He was probably baptized around 1191 by Theoderic of Turaida, a preacher who would later become the abbot of Daugavgrīva Abbey. He became an ardent Christian and a friend of Albert of Buxhoeveden, Bishop of Riga, who, in 1203–1204, took him on a journey to Rome and introduced him to Pope Innocent III. The Pope was impressed by the converted pagan chief and presented him a Bible, hundred gold pieces, ennobled him and gave him the name “Lieven.” When he returned from the journey, his tribe rebelled against him and Caupo took part in a siege of his former fortress in Turaida in 1212. The wooden fort was rebuilt two years later out of brick and stone, closer to its present surviving form.

Caupo participated in a crusader raid against the still pagan Estonians and was killed in the Battle of St. Matthew's Day in 1217, fighting against the troops of the Estonian leader Lembitu of Lehola. Caupo had male successors, his son Bertold had been killed 1210 in the Battle of Ümera. His grandson, Nicholas, was the first descendant who started using the name Lieven more frequently.

Modern Estonians, Latvians, and remaining Livonians do not have a singular view about the historical role of Caupo. Baltic nationalists generally consider him a negative figure and a traitor to his people, however, such claims are sometimes dismissed by scholars as applying a modern viewpoint to a medieval chieftain. Some Latvian folk tales name him "Kaupo the accursed, the scourge of the Livs,... Kaupo who has sold his soul to the foreign bishops."

title: Caupo of Turaida