WorldCat Identities

Osborne, Bud 1881-1964

Works: 37 works in 42 publications in 1 language and 256 library holdings
Genres: Drama  B films  Low budget films  Horror films  Detective and mystery films  Action and adventure films  Western films  Western television programs  Television programs  Conference papers and proceedings 
Roles: Actor, Author, Editor, Performer
Classifications: PN1997, 791.4372
Publication Timeline
Most widely held works by Bud Osborne
Bride of the monster( Visual )

1 edition published in 2000 in English and held by 172 WorldCat member libraries worldwide

A mad scientist tries to harness atomic energy into the creation of super beings. Together with his sidekick slave, Lobo, he finds a willing bride for his monster in the person of a nosey girl reporter. Good eventually defeats evil in a hysterical chase through the marshes as the mad doctor is eaten alive by his own monster
Jail bait by Edward D Wood( Visual )

1 edition published in 2008 in English and held by 22 WorldCat member libraries worldwide

She's a good girl, to leave alone! Fresh from his sensational Glen or Glenda?, Ed Wood, Jr. presents his homage to the gangster films of the '30s and '40s, starring his sex kitten girlfriend Dolores Fuller and introducing to the screen handsome young Steve Reeves. Inspired by the popular TV show Dragnet, this Ed Wood film tells the story of a rich but troubled young man who kills a cop and has plastic surgery to hide his identity. Filmdom's legendary Alex Gordon co-wrote this clever script to help Ed make his first legitimate feature film
Night of the ghouls( Visual )

1 edition published in 2008 in English and held by 17 WorldCat member libraries worldwide

Undercover ghostchaser Lt. Bradford investigates a mysterious medium, Dr. Acula, who, fleeces relatives of the dead, by faking to channel with the beyond. But beware - the night is alive with creatures such as the gigantic 400 lb. Lobo, Vampira-wannabe Sheila, the ever-clever psychic Criswell (whose predictions are always 100% wrong) and the irrepressible comedy of Kelton the Cop
Learning unification-based natural language grammars by Bud Osborne( Book )

6 editions published in 1994 in English and Undetermined and held by 9 WorldCat member libraries worldwide

Birds of a feather : In an evil time ; The Road ; Darwin's man( Visual )

1 edition published in 1996 in English and held by 3 WorldCat member libraries worldwide

Birds of a feather: Paladin becomes the enemy of two railroad companies and every gunman in town when he attempts to settle a dispute. In an evil time: Paladin is forced to kill a prisoner, then must await the man's vengeful brothers with no weapon and only one person to support him in a small Kansas town. The Road: Paladin is ambushed in the desert, and the only people who can help him are a father-and-son prospecting team. Darwin's man: Cattle baron Avery Coombs believes in the survival of the fittest, so he encourages his sons Tully and Jayce to fight each other to the death
50th annual meeting of the Association for Computational Linguistics 2012 : ACL 2012, Jeju Island, Korea, 8-14 July 2012 by Association for Computational Linguistics( Book )

1 edition published in 2012 in English and held by 3 WorldCat member libraries worldwide

Lost treasures of the west( Visual )

1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide

Squaw's love (1911, silent film, 13 min.): A glimpse of life, love and jealousy amidst the American Indians
Stream-based statistical machine translation by Abby D Levenberg( )

1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide

We investigate a new approach for SMT system training within the streaming model of computation. We develop and test incrementally retrainable models which, given an incoming stream of new data, can efficiently incorporate the stream data online. A naive approach using a stream would use an unbounded amount of space. Instead, our online SMT system can incorporate information from unbounded incoming streams and maintain constant space and time. Crucially, we are able to match (or even exceed) translation performance of comparable systems which are batch retrained and use unbounded space. Our approach is particularly suited for situations when there is arbitrarily large amounts of new training material and we wish to incorporate it efficiently and in small space. The novel contributions of this thesis are: 1. An online, randomised language model that can model unbounded input streams in constant space and time. 2. An incrementally retrainable translationmodel for both phrase-based and grammarbased systems. The model presented is efficient enough to incorporate novel parallel text at the single sentence level. 3. Strategies for updating our stream-based language model and translation model which demonstrate how such components can be successfully used in a streaming translation setting. This operates both within a single streaming environment and also in the novel situation of having to translate multiple streams. 4. Demonstration that recent data from the stream is beneficial to translation performance. Our stream-based SMT system is efficient for tackling massive volumes of new training data and offers-up new ways of thinking about translating web data and dealing with other natural language streams
The last round-up( Visual )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Denver Dixon (Bob Custer) foreman of the John Dunlap (Hank Bell) Bar-D Ranch, fights with ranch cowhand "Mile-Away" Hardy (Bud Osborne). Denver severely chastizes "Mile-Away" for being reckless while driving Miss Lucy Graves (Hazel Mills) the new schoolmarm. Seeking revenge, "Mile Away" quits, rustles the ranch cattle, sets fire to a few things and kidnaps Miss Lucy
Introducing corpus-based rules and algorithms in a rule-based machine translation system by Loic Dugast( )

1 edition published in 2013 in English and held by 1 WorldCat member library worldwide

Real-time event detection in massive streams by Saša Petrović( )

1 edition published in 2013 in English and held by 1 WorldCat member library worldwide

A discriminative latent variable model for statistical machine translation( )

1 edition published in 2008 in English and held by 1 WorldCat member library worldwide

The westerns( Visual )

1 edition published in 2011 in English and held by 1 WorldCat member library worldwide

Conditional-entropy metrics for feature selection by Iain Bancarz( )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

We examine the task of feature selection, which is a method of forming simplified descriptions of complex data for use in probabilistic classifiers. Feature selection typically requires a numerical measure or metric of the desirability of a given set of features. The thesis considers a number of existing metrics, with particular attention to those based on entropy and other quantities derived from information theory. A useful new perspective on feature selection is provided by the concepts of partitioning and encoding of data by a feature set. The ideas of partitioning and encoding, together with the theoretical shortcomings of existing metrics, motivate a new class of feature selection metrics based on conditional entropy. The simplest of the new metrics is referred to as expected partition entropy or EPE. Performances of the new and existing metrics are compared by experiments with a simplified form of part-of-speech tagging and with classification of Reuters news stories by topic. In order to conduct the experiments, a new class of accelerated feature selection search algorithms is introduced; a member of this class is found to provide significantly increased speed with minimal loss in performance, as measured by feature selection metrics and accuracy on test data. The comparative performance of existing metrics is also analysed, giving rise to a new general conjecture regarding the wrapper class of metrics. Each wrapper is inherently tied to a specific type of classifier. The experimental results support the idea that a wrapper selects feature sets which perform well in conjunction with its own particular classifier, but this good performance cannot be expected to carry over to other types of model. The new metrics introduced in this thesis prove to have substantial advantages over a representative selection of other feature selection mechanisms: Mutual information, frequency-based cutoff, the Koller-Sahami information loss measure, and two different types of wrapper method. Feature selection using the new metrics easily outperforms other filter-based methods such as mutual information; additionally, our approach attains comparable performance to a wrapper method, but at a fraction of the computational expense. Finally, members of the new class of metrics succeed in a case where the Koller-Sahami metric fails to provide a meaningful criterion for feature selection
Variable bit quantisation for LSH by Sean Moran( )

1 edition published in 2013 in English and held by 1 WorldCat member library worldwide

His brother's ghost ; Shadows of death( Visual )

1 edition published in 2012 in English and held by 1 WorldCat member library worldwide

Shadows of death: With the railroad coming to Red Rock, trouble is expected and Billy has been sent to help his friend Fuzzy, the town's sheriff
Discovering lexical generalisations : supervised machine learning approach to inheritance hierarchy construction by Caroline Sporleder( )

1 edition published in 2004 in English and held by 1 WorldCat member library worldwide

Grammar development over the last decades has seen a shift away from large inventories of grammar rules to richer lexical structures. Many modern grammar theories are highly lexicalised. But simply listing lexical entries typically results in an undesirable amount of redundancy. Lexical inheritance hierarchies, on the other hand, make it possible to capture linguistic generalisations and thereby reduce redundancy. Inheritance hierarchies are usually constructed by hand but this is time-consuming and often impractical if a lexicon is very large. Constructing hierarchies automatically or semiautomatically facilitates a more systematic analysis of the lexical data. In addition, lexical data is often extracted automatically from corpora and this is likely to increase over the coming years. Therefore it makes sense to go a step further and automate the hierarchical organisation of lexical data too. Previous approaches to automatic lexical inheritance hierarchy construction tended to focus on minimality criteria, aiming for hierarchies that minimised one or more criteria such as the number of path-value pairs, the number of nodes or the number of inheritance links (Petersen 2001, Barg 1996a, and in a slightly different context: Light 1994). Aiming for minimality is motivated by the fact that the conciseness of inheritance hierarchies is a main reason for their use. However, I will argue that there are several problems with minimality-based approaches. First, minimality is not well defined in the context of lexical inheritance hierarchies as there is a tension between different minimality criteria. Second, minimality-based approaches tend to underestimate the importance of linguistic plausibility. While such approaches start with a definition of minimal redundancy and then try to prove that this leads to plausible hierarchies, the approach suggested here takes the opposite direction. It starts with a manually built hierarchy to which a supervised machine learning algorithm is applied with the aim of finding a set of formal criteria that can guide the construction of plausible hierarchies. Taking this direction means that it is more likely that the selected criteria do in fact lead to plausible hierarchies. Using a machine learning technique also has the advantage that the set of criteria can be much larger than in hand-crafted definitions. Consequently, one can define conciseness in very broad terms, taking into account interdependencies in the data as well as simple minimality criteria. This leads to a more fine-grained model of hierarchy quality. In practice, the method proposed here consists of two components: Galois lattices are used to define the search space as the set of all generalisations over the input lexicon. Maximum entropy models which have been trained on a manually built hierarchy are then applied to the lattice of the input lexicon to distinguish between plausible and implausible generalisations based on the formal criteria that were found in the training step. An inheritance hierarchy is then derived by pruning implausible generalisations. The hierarchy is automatically evaluated by matching it to a manually built hierarchy for the input lexicon. Automatically constructing lexical hierarchies is a hard task, partly because what is considered the best hierarchy for a lexicon is to some extent subjective. Supervised learning methods also suffer from a lack of suitable training data. Hence, a semi-automatic architecture may be best suited for the task. Therefore, the performance of the system has been tested using a semi-automatic as well as an automatic architecture and it has also been compared to the performance achieved by the pruning algorithm suggested by Petersen (2001). The findings show that the method proposed here is well suited for semi-automatic hierarchy construction
Gunning for justice( Visual )

1 edition published in 1999 in English and held by 1 WorldCat member library worldwide

After Johnny breaks up a gunfight, the dying man gives him a map of the location of hidden gold bullion and tells him to give it to Ed. The outlaws know of the gold and try to get the map from Johnny. Their leader Blake realizes Ed is Edwina, the girl Johnny knows as Winnie. He gets Johnny to give the map to Winnie, gets the Sheriff to arrest Johnny, and gets Winnie to lead him to the gold
Proceedings of the seventh Conference on Natural Language Learning at HLT-NAACL Edmonton (Alberta) by ACM Conference on Natural Language Learning( Book )

1 edition published in 2003 in English and held by 1 WorldCat member library worldwide

moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.38 (from 0.18 for Lost treas ... to 0.98 for CoNLL99, C ...)

Alternative Names
Bud Osborne Amerikaans acteur (1884-1964)

Bud Osborne attore statunitense

Osborne, Budd, 1881-1964

Osborne, Lennie Bud, 1881-1964

Osborne, Miles, 1881-1964

Осборн, Бад американский актёр

English (24)